DBScholar

Back to papers

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

Summary: Quantifies the dimensional curse: partitioning/clustering indexes become linear and lose to sequential scan beyond ~10 dimensions. Introduces VA-file, a compact vector-approximation organization that accelerates the unavoidable scan, outperforming R*- and X-trees experimentally. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8679
Venue
VLDB
Year
1998
Pagerank
0.00044853085
Overall Rank
46 | 99.69%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{weber_vldb98,
        title = {{A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces}},
        author = {Weber, Roger and Schek, Hans-J. and Blott, Stephen},
        journal = {PVLDB},
        series = {{VLDB} '98},
        pages = {194--205},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 97 citing papers.

Rank Citing Paper Year Venue Pagerank
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034701237
142 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.0002962566
221 Robust and Fast Similarity Search for Moving Object Trajectories 2005 SIGMOD 0.00024224879
287 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00022323585
303 On The Marriage of Lp-norms and Edit Distance 2004 VLDB 0.00021956234
398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00019194947
406 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data 2020 VLDB 0.00019054532
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
581 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016153395
705 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014829964
926 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00013181732
990 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00012796562
1,280 Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials 2004 SIGMOD 0.00011354776
1,281 Continuous Nearest Neighbor Search 2002 VLDB 0.00011349245
1,357 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00011043994
1,430 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.0001080902
1,602 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 0.00010239526
1,605 Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases 2008 VLDB 0.00010229844
1,778 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 9.7769047e-05
1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 9.4561907e-05
1,935 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.4560124e-05
2,158 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0622995e-05
2,673 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 8.2730112e-05
2,886 Approximate NN Queries on Streams with Guaranteed Error/performance Bounds 2004 VLDB 7.9957585e-05
2,938 FEXIPRO: Fast and Exact Inner Product Retrieval in Recommender Systems 2017 SIGMOD 7.942728e-05
2,979 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.8984588e-05
3,037 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 7.8275859e-05
3,047 Similarity Evaluation on Tree-structured Data 2005 SIGMOD 7.8155543e-05
3,108 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 7.7499741e-05
3,125 General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows 2002 SIGMOD 7.7344198e-05
3,267 FTW: Fast Similarity Search under the Time Warping Distance 2005 PODS 7.5816553e-05
3,279 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.5711218e-05
3,310 Similarity Query Processing for High-Dimensional Data 2020 VLDB 7.5363562e-05
3,363 Efficient k-NN Search on Vertically Decomposed Data 2002 SIGMOD 7.4808966e-05
3,429 Angle-based Space Partitioning for Efficient Parallel Skyline Computation 2008 SIGMOD 7.4203247e-05
3,440 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD 7.4142918e-05
3,562 Location-based Spatial Queries 2003 SIGMOD 7.3080612e-05
3,581 Time-Parameterized Queries in Spatio-Temporal Databases 2002 SIGMOD 7.2873782e-05
3,806 On the Complexity of Inner Product Similarity Join 2016 PODS 7.108802e-05
4,060 Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 2013 SIGMOD 6.9322681e-05
4,105 Top-k Publish-Subscribe for Social Annotation of News 2013 VLDB 6.8982075e-05
4,867 Indexing Large Human-Motion Databases 2004 VLDB 6.4720439e-05
4,927 Neighbor-Sensitive Hashing 2016 VLDB 6.4426453e-05
4,970 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 6.4197336e-05
5,121 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.3577317e-05
5,592 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 6.1552372e-05
5,666 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 6.1285141e-05
5,800 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0850924e-05
5,909 Query-Sensitive Embeddings 2005 SIGMOD 6.0444989e-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.0020210012
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
8 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.00082404462
42 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB 0.00046170812
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040719947
85 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00035405879
277 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022537944
353 The Query By Image Content (QBIC) System 1995 SIGMOD 0.00020370587
522 Multi-Step Processing of Spatial Joins 1994 SIGMOD 0.00017133516
1,129 Beyond Uniformity and Independence : Analysis of R-trees Using the Concept of Fractal Dimension 1994 PODS 0.00012061727
1,512 On the Analysis of Indexing Schemes 1997 PODS 0.00010536001
3,866 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD 7.061829e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 10,227 Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search 2026 SIGMOD
2 705 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB
3 1,778 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB
4 3,866 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD
5 797 Dimensionality Reduction for Similarity Searching in Dynamic Databases 1998 SIGMOD
6 6,646 On the Effects of Dimensionality Reduction on High Dimensional Similarity Search 2001 PODS
7 9,334 Adaptive Indexing in High-Dimensional Metric Spaces 2023 VLDB
8 8,655 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD
9 21 Similarity Search in High Dimensions via Hashing 1999 VLDB
10 13,768 What's Wrong with High-Dimensional Similarity Search? 2008 VLDB