An Index Data Structure for Searching in Metric Space Databases-Reference-Cited by-同舟云学术

An Index Data Structure for Searching in Metric Space Databases

Published:2006 Issue: Volume: Page:611-617
ISSN:0302-9743
Container-title:Computational Science – ICCS 2006
language:
Short-container-title:

Author:

Uribe Roberto,Navarro Gonzalo,Barrientos Ricardo J.,Marín Mauricio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11758501_82

Reference12 articles.

1. Lecture Notes in Computer Science;R. Baeza-Yates,1994

2. Brin, S.: Near neighbor search in large metric spaces. In: The 21st VLDB Conference, pp. 574–584. Morgan Kaufmann Publishers, San Francisco (1995)

3. Burkhard, W., Keller, R.: Some approaches to best-match file searching. Communication of ACM 16(4), 230–236 (1973)

4. Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Computing Surveys 33(3), 273–321 (2001)

5. Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: The 23st International Conference on VLDB, pp. 426–435 (1997)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. VD-tree;Proceedings of the 36th Annual ACM Symposium on Applied Computing;2021-03-22

2. Nearest neighbors methods for support vector machines;Annals of Operations Research;2015-08-22

3. On indexing metric spaces using cut-regions;Information Systems;2014-07

4. Static-to-Dynamic Transformation for Metric Indexing Structures;Similarity Search and Applications;2012

5. The Basic Principles of Metric Indexing;Studies in Computational Intelligence;2009