Fully dynamic metric access methods based on hyperplane partitioning-Reference-Cited by-同舟云学术

Fully dynamic metric access methods based on hyperplane partitioning

Published:2011-06 Issue:4 Volume:36 Page:734-747
ISSN:0306-4379
Container-title:Information Systems
language:en
Short-container-title:Information Systems

Author:

Navarro Gonzalo,Uribe-Paredes Roberto

Publisher

Elsevier BV

Subject

Hardware and Architecture,Information Systems,Software

Reference15 articles.

1. Foundations of Multidimensional and Metric Data Structures;Samet,2005

2. Searching in metric spaces;Chávez;ACM Computing Surveys,2001

3. Voronoi trees and clustering problems;Dehne;Information Systems,1987

4. S. Brin, Near neighbor search in large metric spaces, in: Proceedings of the 21st Very Large Databases Conference (VLDB), 1995, pp. 574–584.

5. P. Ciaccia, M. Patella, P. Zezula, M-tree: an efficient access method for similarity search in metric spaces, in: Proceedings of the 23rd Very Large Databases Conference (VLDB), 1997, pp. 426–435.

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

1. GTS: GPU-based Tree Index for Fast Similarity Search;Proceedings of the ACM on Management of Data;2024-05-29

2. SCORE: Scalable Contact Tracing over Uncertain Trajectories;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2024

3. Indexing Metric Spaces for Exact Similarity Search;ACM Computing Surveys;2022-12-07

4. Fast kNN query processing over a multi-node GPU environment;The Journal of Supercomputing;2021-07-15

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