Mb+tree: A dynamically updatable metric index for similarity search

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

Volumn 1846, Issue , 2000, Pages 356-374

  Ishikawa, Masahiro ^a   Chen, Hanxiong ^b   Furuse, Kazutaka ^a   Yu, Jeffrey Xu ^c   Ohbo, Nobuo ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b TSUKUBA INTERNATIONAL UNIVERSITY   (Japan)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COST REDUCTION; DATA HANDLING; FORESTRY; INFORMATION MANAGEMENT; QUERY PROCESSING; SET THEORY; TOPOLOGY; TREES (MATHEMATICS);

ACCESS METHODS; APPROXIMATE MATCHES; DISJOINT PARTITION; DISTANCE CALCULATION; GENERIC METRIC SPACES; LARGE DATABASE; SIMILARITY SEARCH; SPACE DIVISION;

SEARCH ENGINES;

EID: 24644479204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45151-x_34     Document Type: Conference Paper

References (8)

1. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, 1998.
2. Tolga Bozkaya and Meral Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. Proceedings of the ACM SIGMOD Conference on Management of Data, Tucson, Arizona, May 1997, pages 357–368, May 1997.
3. Masajiro Iwasaki. Implementation and evaluation of metric space indices for similarity search. IPSJ Transactions on Databases, in Japanese, 40:24–44, Feb 1999.
4. Marco Patella Paolo Ciaccia and Pavel Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd VLDB Conference, Athenes, Greece, 1997, pages 357–368, 1997.
5. Divyakant Agrawal Ravi Kanth and Ambuj K. Singh. Dimensionality reduction for similarity searching in dynamic databases. In Proceeding of ACM SIGMOD Conference on Management of Data, Seattle, Washington, 1998, pages 166–176, 1998.
6. S. Brin. Near neighbour search in large metric spaces. In Proceedings of the 21st VLDB Conference, Zurich, Switzerland, 1995, pages 574–584, 1995.
7. Jeffery K. Uhlmann. Satisfying general proximity/similary queries with metric trees. Information Processing Letters, 40:175–179, November 1991.
8. Masatoshi Yoshikawa Yasushi Sakurai and Shunsuke Uemura. High-dimensional nearest neighbour search based on virtual bounding rectangles. In Proceeding of International Conference on FODO’98, pages 258–267, 1998.