An access structure for similarity search in metric spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3268, Issue , 2004, Pages 133-143

  Dohnal, Vlastislav ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY;

ACCESS STRUCTURE; BOUNDED SEARCH; DATATYPES; INSERTIONS AND DELETIONS; MATHEMATICAL NOTION; METRIC SPACES; NOVEL ACCESS; SEARCH COSTS; SIMILARITY RETRIEVAL; SIMILARITY SEARCH;

SET THEORY;

EID: 34547704674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30192-9_13     Document Type: Article

References (13)

1. Stefan Berchtold, Christian Böhm, and Hans-Peter Kriegel. The pyramid-technique: Towards breaking the curse of dimensionality. In ACM SIGMOD 1998, pages 142-153, 1998
2. Tolga Bozkaya and Z. Meral Özsoyoglu. Indexing large metric spaces for similarity search queries. ACM TODS, 24(3):361-404, 1999.
3. Sergey Brin. Near neighbor search in large metric spaces. In VLDB 1995, pages 574-584, 1995.
4. Benjamin Bustos, Gonzalo Navarro, and Edgar Chávez. Pivot selection techniques for proximity searching in metric spaces. In SCCC 2001, Proceedings of the XXI Conference of the Chilean Computer Science Society, pages 33-40. IEEE CS Press, 2001.
5. Edgar Chávez, Gonzalo Navarro, Ricardo Baeza-Yates, and José Luis Marroquin. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, 2001.
6. Paolo Ciaccia, Marco Patella, and Pavel Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB 1997, pages 426-435, 1997.
7. Vlastislav Dohnal, Claudio Gennaro, Pasquale Savino, and Pavel Zezula. Separable splits in metric data sets. In Proceedings of 9-th Italian Symposium on Advanced Database Systems, SEBD 2001, pages 45-62, 2001.
8. Vlastislav Dohnal, Claudio Gennaro, Pasquale Savino, and Pavel Zezula. D-Index: Distance searching index for metric data sets. Multimedia Tools and Applications, 21(l):9-33, 2003.
9. Caetano Traina Jr., Agma J. M. Traina, Bernhard Seeger, and Christos Faloutsos. Slim-Trees: High performance metric trees minimizing overlap between nodes. In EDBT 2000, volume 1777, pages 51-65, 2000.
10. Jeffrey K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40(4):175-179, 1991.
11. Peter N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, pages 311-321, 1993.
12. Peter N. Yianilos. Excluded middle vantage point forests for nearest neighbor search. In 6th DIMACS Implementation Challenge, ALENEX'99, 1999.
13. Cui Yu, Beng Chin Ooi, Kian-Lee Tan, and H. V. Jagadish. Indexing the distance: An efficient method to KNN processing. In VLDB 2001, pages 421-430, 2001.