Pivoting M-tree: A Metric Access Method for Efficient Similarity Search

In this paper pivoting M-tree (PM-tree) is introduced, 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 PMtree the shape of a metric region is determined as an 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, improves the overall efficiency of the similarity search. Preliminary experimental results on a synthetic dataset are included.

• Type: Conference
• Year: 2004
• Where: DATESO
• Authors: Tomás Skopal
• Keywords: DATESO 2004, DATESO 2007, Method Combining M-tree, Metric Region, Pivot-based Approach