Nearest neighbours search using the PM-tree

Lecture Notes in Computer Science

Volumn 3453, Issue , 2005, Pages 803-815

  Skopal, Tomáš ^a   Pokorný, Jaroslav ^a   Snášel, Václav ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; INDEXING (OF INFORMATION); MULTIMEDIA SYSTEMS; TREES (MATHEMATICS);

K NEAREST NEIGHBOURS (K-NN); MULTIMEDIA DATABASES; REAL-WORLD DATASETS; SEARCH ALGORITHMS;

SEARCH ENGINES;

EID: 24644501843     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11408079_73     Document Type: Conference Paper

References (13)

1. C. Böhm, S. Berchtold, and D. Keim. Searching in High-Dimensional Spaces - Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys, 33(3):322-373, 2001.
2. B. Bustos, G. Navarro, and E. Chávez. Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters, 24(14):2357-2366, 2003.
3. E. Chávez. Optimal discretization for pivot based algorithms. Manuscript, ftp://garota.fismat.umich.mx/pub/users/elchavez/minimax.ps.gz, 1999.
4. E. Chávez, G. Navarro, R. Baeza-Yates, and J. Marroquín. Searching in Metric Spaces. ACM Computing Surveys, 33(3):273-321, 2001.
5. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In Proceedings of the 23rd Athens Intern. Conf. on VLDB, pages 426-435. Morgan Kaufmann, 1997.
6. M. L. Micó, J. Oncina, and E. Vidal. A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recognition Letters, 15(1):9-17, 1994.
7. M. Patella. Similarity Search in Multimedia Databases. PhD thesis, University of Bologna, 1999.
8. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, CA, pages 71-79, 1995.
9. M. Shapiro. The choice of reference points in best-match file searching. Commun. ACM, 20(5):339-343, 1977.
10. T. Skopal. Metric Indexing in Information Retrieval. PhD thesis, Technical University of Ostrava, http://urtax.ms.mff.cuni.cz/~skopal/phd/thesis. pdf, 2004.
11. T. Skopal, J. Pokorný, M. Krátký, and V. Snášel. Revisiting M-tree Building Principles. In Proceedings of the 7th East-European Conference on Advances in Databases and Information Systems (ADBIS), Dresden, Germany, LNCS 2798, Springer-Verlag, pages 148-162, 2003.
12. T. Skopal, J. Pokorný, and V. Snášel. PM-tree: Pivoting Metric Tree for Similarity Search in Multimedia Databases. In Local proceedings of the 8th East-European Conference on Advances in Databases and Information Systems (ADBIS), Budapest, Hungary, pages 99-114, 2004.
13. WBIIS project: Wavelet-based Image Indexing and Searching, Stanford University, http://wang.ist.psu.edu/.