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
8489
Venue
VLDB
Year
1998
Pagerank
0.00056385781
Overall Rank
78 | 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.00076824554
159 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00040135453
210 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034086264
251 Robust and Fast Similarity Search for Moving Object Trajectories 2005 SIGMOD 0.00030589775
358 On The Marriage of Lp-norms and Edit Distance 2004 VLDB 0.00026059337
399 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00024359304
675 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018304179
730 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data 2020 VLDB 0.00017443615
763 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00016963981
858 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015833075
1,013 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014632051
1,225 SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013182109
1,272 Continuous Nearest Neighbor Search 2002 VLDB 0.00012871443
1,347 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00012463441
1,373 Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials 2004 SIGMOD 0.00012326961
1,535 Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases 2008 VLDB 0.00011461371
1,802 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 0.0001048177
1,923 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 0.00010079134
1,934 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00010047294
2,012 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.8007613e-05
2,099 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.5429949e-05
2,287 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 9.1004806e-05
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05
3,018 Approximate NN Queries on Streams with Guaranteed Error/performance Bounds 2004 VLDB 7.6995792e-05
3,019 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.699097e-05
3,173 Top-k Publish-Subscribe for Social Annotation of News 2013 VLDB 7.4460605e-05
3,206 Similarity Evaluation on Tree-structured Data 2005 SIGMOD 7.3855924e-05
3,297 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD 7.2549403e-05
3,301 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.2450912e-05
3,418 General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows 2002 SIGMOD 7.1129681e-05
3,515 Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 2013 SIGMOD 7.0191008e-05
3,522 FTW: Fast Similarity Search under the Time Warping Distance 2005 PODS 7.0086323e-05
3,574 Efficient k-NN Search on Vertically Decomposed Data 2002 SIGMOD 6.9520978e-05
3,616 Angle-based Space Partitioning for Efficient Parallel Skyline Computation 2008 SIGMOD 6.9108126e-05
3,629 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 6.8997167e-05
3,728 Indexing Large Human-Motion Databases 2004 VLDB 6.8082657e-05
3,780 FEXIPRO: Fast and Exact Inner Product Retrieval in Recommender Systems 2017 SIGMOD 6.7703467e-05
3,802 Time-Parameterized Queries in Spatio-Temporal Databases 2002 SIGMOD 6.7524078e-05
3,815 Location-based Spatial Queries 2003 SIGMOD 6.7314038e-05
4,230 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 6.3337893e-05
4,273 Similarity Query Processing for High-Dimensional Data 2020 VLDB 6.2932217e-05
4,600 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 6.0528015e-05
4,808 On the Complexity of Inner Product Similarity Join 2016 PODS 5.9040739e-05
4,869 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 5.8588434e-05
5,218 Neighbor-Sensitive Hashing 2016 VLDB 5.6204105e-05
5,349 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 5.5541926e-05
5,883 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 5.2865165e-05
6,077 Query-Sensitive Embeddings 2005 SIGMOD 5.2203422e-05
6,173 Similarity Search: A Matching Based Approach 2006 VLDB 5.1684255e-05
6,183 PPQ-Trajectory: Spatio-temporal Quantization for Querying in Large Trajectory Repositories 2021 VLDB 5.1636638e-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.0032118946
5 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.0018380955
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016113151
24 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects 1987 VLDB 0.00083300888
91 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00051785122
129 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00044255276
301 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00028396714
331 The Query By Image Content (QBIC) System 1995 SIGMOD 0.00027199905
479 Multi-Step Processing of Spatial Joins 1994 SIGMOD 0.00022182486
1,111 Beyond Uniformity and Independence : Analysis of R-trees Using the Concept of Fractal Dimension 1994 PODS 0.0001389881
1,485 On the Analysis of Indexing Schemes 1997 PODS 0.00011698762
3,549 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD 6.9792126e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
3,541 Similarity search in the blink of an eye with compressed indices 2023 VLDB 6.9910982e-05
1,013 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014632051
1,923 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 0.00010079134
3,549 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD 6.9792126e-05
821 Dimensionality Reduction for Similarity Searching in Dynamic Databases 1998 SIGMOD 0.00016232579
6,316 On the Effects of Dimensionality Reduction on High Dimensional Similarity Search 2001 PODS 5.1098143e-05
9,288 Adaptive Indexing in High-Dimensional Metric Spaces 2023 VLDB 4.3589837e-05
8,645 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD 4.4725847e-05
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
13,581 What's Wrong with High-Dimensional Similarity Search? 2008 VLDB -