PM-tree: Pivoting Metric Tree for Similarity Search in Multimedia Databases

In this paper we introduce the Pivoting M-tree (PM-tree), a metric access method combining M-tree with the pivot-based approach. While in M-tree a metric region is represented by a hyper-sphere, in PM-tree the shape of a metric region is determined by intersection of the hyper-sphere and a set of hyper-rings. The set of hyper-rings for each metric region is related to a fixed set of pivot objects. As a consequence, the shape of a metric region bounds the indexed objects more tightly which, in turn, significantly improves the overall efficiency of similarity search. We present basic algorithms on PM-tree and two cost models for range query processing. Finally, the PM-tree efficiency is experimentally evaluated on large synthetic as well as real-world datasets.

[1]  James Z. Wang.  Wavelet-Based Image Indexing and Searching , 2001 .

[2]  Václav Snásel,et al.  Revisiting M-Tree Building Principles , 2003, ADBIS.

[3]  Marvin B. Shapiro.  The choice of reference points in best-match file searching , 1977, CACM.

[4]  Ge Yu,et al.  M+-tree : A New Dynamical Multidimensional Index for Metric Spaces , 2003, ADC.

[5]  Ricardo A. Baeza-Yates,et al.  Searching in metric spaces , 2001, CSUR.

[6]  Pavel Zezula,et al.  A cost model for similarity queries in metric spaces , 1998, PODS '98.

[7]  Christian Böhm,et al.  Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases , 2001, CSUR.

[8]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[9]  Z. Meral Özsoyoglu,et al.  Distance-based indexing for high-dimensional metric spaces , 1997, SIGMOD '97.

[10]  Luisa Micó,et al.  A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements , 1994, Pattern Recognit. Lett..

[11]  Christos Faloutsos,et al.  Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes , 2000, EDBT.

[12]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[13]  Daniel A. Keim,et al.  Similarity search in multimedia databases , 2004, Proceedings. 20th International Conference on Data Engineering.