SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The choice of reference points in best-match file searching
Communications of the ACM
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Dynamic similarity search in multi-metric spaces
MIR '06 Proceedings of the 8th ACM international workshop on Multimedia information retrieval
A hyperplane based indexing technique for high-dimensional data
Information Sciences: an International Journal
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
New dynamic construction techniques for M-tree
Journal of Discrete Algorithms
On Index-Free Similarity Search in Metric Spaces
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Improving the performance of M-tree family by nearest-neighbor graphs
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Construction of tree-based indexes for level-contiguous buffering support
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
On fast non-metric similarity search by metric access methods
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Inverted file-based indexing for efficient multimedia information retrieval in metric spaces
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Cut-Region: a compact building block for hierarchical metric indexing
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
| Hi-index | 0.00 |
We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-tree is a metric access method for similarity search in large multimedia databases. As an extension of M-tree, the structure of PM-tree exploits local dynamic pivots (like M-tree does it) as well as global static pivots (used by LAESA-like methods). While in M-tree a metric region is represented by a hyper-sphere, in PM-tree the ”volume” of metric region is further reduced by a set of hyper-rings. As a consequence, the shape of PM-tree's metric region bounds the indexed objects more tightly which, in turn, improves the overall search efficiency. Besides the description of PM-tree, we propose an optimal k-NN search algorithm. Finally, the efficiency of k-NN search is experimentally evaluated on large synthetic as well as real-world datasets.