Efficient Metric Indexing for Similarity Search and Similarity Joins
Abstract: Spatial queries including similarity search and similarity joins are useful in many areas, such as multimedia retrieval, data integration, and so on. However, they are not supported well by commercial DBMSs. This may be due to the complex data types involved and the needs for flexible similarity criteria seen in real applications. In this paper, we propose a versatile and efficient disk-based disk index for metric data, the Space Space-fillingcurve and Pivot-based B+-tree tree (SPB-tree). (SPB This index leverages the B+-tree, tree, and uses space space-filling filling curve to cluster data into compact regions, thus achieving storage efficiency. It utilizes a small set of soso called pivots to reduce significantly th the e number of distance computations when using the index. Further, it makes use of a separate random access file to support abroad range of data. By design, it is easyto integrate the SPB SPB-tree tree into an existing DBMS. We present efficient algorithms for proces processing sing similarity search and similarity joins, as well as corresponding cost models based on SPB-trees. SPB Extensive experiments using both real and synthetic data show that, compared with state-of-the-art art competitors, the SPB SPB-tree tree has much lower construction cost, c smallerstorage size, and supports more efficient similarity search and similarity joins with high accuracy cost models.