Database Paper Browser

Back to papers

A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

Summary: Formal analysis shows HDVS partitioning methods have linear complexity and degrade beyond ~10 dimensions; sequential scans often win. It proposes VA-file, an approximate vector-encoding, comparing with R*-tree and X-tree, and shows near-sequential speed. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8488
Venue
VLDB
Year
1998
Pagerank
0.00056242144
Overall Rank
79 | 99.46%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 50 of 96 citing papers.

Rank Citing Paper Year Venue Pagerank
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076637636
161 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00039846974
212 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00033913475
251 Robust and Fast Similarity Search for Moving Object Trajectories 2005 SIGMOD 0.00030644658
358 On The Marriage of Lp-norms and Edit Distance 2004 VLDB 0.0002599481
400 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.0002427237
682 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018201541
736 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data 2020 VLDB 0.00017447617
770 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00016917602
867 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015792021
1,010 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014652858
1,229 SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013157271
1,275 Continuous Nearest Neighbor Search 2002 VLDB 0.00012883899
1,363 Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials 2004 SIGMOD 0.00012372959
1,364 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00012370117
1,542 Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases 2008 VLDB 0.00011456321
1,757 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00010660932
1,806 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 0.00010490769
1,925 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 0.00010073407
2,024 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.7519678e-05
2,107 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.5330494e-05
2,324 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 9.0326444e-05
2,971 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7970531e-05
3,018 Approximate NN Queries on Streams with Guaranteed Error/performance Bounds 2004 VLDB 7.7002798e-05
3,056 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.6432146e-05
3,163 Top-k Publish-Subscribe for Social Annotation of News 2013 VLDB 7.4553071e-05
3,199 Similarity Evaluation on Tree-structured Data 2005 SIGMOD 7.3927291e-05
3,294 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD 7.2619257e-05
3,300 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.2516103e-05
3,417 General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows 2002 SIGMOD 7.1195863e-05
3,510 Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 2013 SIGMOD 7.0258619e-05
3,518 FTW: Fast Similarity Search under the Time Warping Distance 2005 PODS 7.0153323e-05
3,579 Efficient k-NN Search on Vertically Decomposed Data 2002 SIGMOD 6.9502303e-05
3,621 Angle-based Space Partitioning for Efficient Parallel Skyline Computation 2008 SIGMOD 6.9078084e-05
3,629 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 6.902069e-05
3,726 Indexing Large Human-Motion Databases 2004 VLDB 6.8148202e-05
3,772 FEXIPRO: Fast and Exact Inner Product Retrieval in Recommender Systems 2017 SIGMOD 6.7761705e-05
3,800 Time-Parameterized Queries in Spatio-Temporal Databases 2002 SIGMOD 6.7585633e-05
3,814 Location-based Spatial Queries 2003 SIGMOD 6.7341058e-05
4,243 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 6.32976e-05
4,278 Similarity Query Processing for High-Dimensional Data 2020 VLDB 6.2953764e-05
4,598 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 6.0586236e-05
4,808 On the Complexity of Inner Product Similarity Join 2016 PODS 5.908896e-05
5,224 Neighbor-Sensitive Hashing 2016 VLDB 5.6197981e-05
5,352 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 5.5529869e-05
5,456 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 5.4976692e-05
5,878 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 5.2916009e-05
6,082 Query-Sensitive Embeddings 2005 SIGMOD 5.2205711e-05
6,164 Similarity Search: A Matching Based Approach 2006 VLDB 5.1733919e-05
6,181 PPQ-Trajectory: Spatio-temporal Quantization for Querying in Large Trajectory Repositories 2021 VLDB 5.1686247e-05
Previous Page 1 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0032169493
5 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.0018397217
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016162015
24 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects 1987 VLDB 0.00083378538
91 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.0005181666
129 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.0004429571
284 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00028994728
330 The Query By Image Content (QBIC) System 1995 SIGMOD 0.00027229588
478 Multi-Step Processing of Spatial Joins 1994 SIGMOD 0.0002222104
1,114 Beyond Uniformity and Independence : Analysis of R-trees Using the Concept of Fractal Dimension 1994 PODS 0.00013901031
1,488 On the Analysis of Indexing Schemes 1997 PODS 0.00011699446
3,555 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD 6.9772546e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
3,609 Similarity search in the blink of an eye with compressed indices 2023 VLDB 6.9215236e-05
1,010 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014652858
1,925 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 0.00010073407
3,555 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD 6.9772546e-05
825 Dimensionality Reduction for Similarity Searching in Dynamic Databases 1998 SIGMOD 0.00016228517
6,325 On the Effects of Dimensionality Reduction on High Dimensional Similarity Search 2001 PODS 5.1105081e-05
9,283 Adaptive Indexing in High-Dimensional Metric Spaces 2023 VLDB 4.3631652e-05
8,647 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD 4.4768766e-05
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076637636
13,568 What's Wrong with High-Dimensional Similarity Search? 2008 VLDB -