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
h2bac67f6fc1b0b73
Venue
VLDB
Year
1998
Pagerank
0.0004503446
Overall Rank
45 | 99.70%
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 100 citing papers.

Rank Citing Paper Year Venue Pagerank
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057568153
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
142 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00029202746
227 Robust and Fast Similarity Search for Moving Object Trajectories 2005 SIGMOD 0.0002393284
280 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.0002230467
306 On The Marriage of Lp-norms and Edit Distance 2004 VLDB 0.00021575844
341 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data 2020 VLDB 0.00020539791
345 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00020445545
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016335405
576 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016121388
650 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015149775
804 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00013832333
839 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00013547412
927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013025904
1,294 Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials 2004 SIGMOD 0.00011145111
1,304 Continuous Nearest Neighbor Search 2002 VLDB 0.00011104243
1,328 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011003106
1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.0001004502
1,634 Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces 2000 VLDB 0.0001001862
1,635 Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases 2008 VLDB 0.00010017067
1,793 The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation 2000 VLDB 9.6235776e-05
1,923 ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search 2011 SIGMOD 9.3750526e-05
2,113 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0196806e-05
2,503 FEXIPRO: Fast and Exact Inner Product Retrieval in Recommender Systems 2017 SIGMOD 8.3786151e-05
2,505 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 8.3779738e-05
2,821 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 7.9711961e-05
2,872 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 7.9228762e-05
2,939 Approximate NN Queries on Streams with Guaranteed Error/performance Bounds 2004 VLDB 7.8340314e-05
2,969 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.8000797e-05
3,016 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.7483267e-05
3,108 Similarity Evaluation on Tree-structured Data 2005 SIGMOD 7.640323e-05
3,182 General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows 2002 SIGMOD 7.561954e-05
3,230 Similarity Query Processing for High-Dimensional Data 2020 VLDB 7.5056037e-05
3,325 Efficient k-NN Search on Vertically Decomposed Data 2002 SIGMOD 7.4271038e-05
3,333 FTW: Fast Similarity Search under the Time Warping Distance 2005 PODS 7.4153527e-05
3,414 Angle-based Space Partitioning for Efficient Parallel Skyline Computation 2008 SIGMOD 7.3244819e-05
3,507 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD 7.2494536e-05
3,638 Location-based Spatial Queries 2003 SIGMOD 7.1446219e-05
3,658 Time-Parameterized Queries in Spatio-Temporal Databases 2002 SIGMOD 7.1243855e-05
3,809 On the Complexity of Inner Product Similarity Join 2016 PODS 7.0089846e-05
4,151 Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 2013 SIGMOD 6.776727e-05
4,193 Top-k Publish-Subscribe for Social Annotation of News 2013 VLDB 6.7434303e-05
4,715 Maximum Inner Product is Query-Scaled Nearest Neighbor 2025 VLDB 6.4554594e-05
4,856 Neighbor-Sensitive Hashing 2016 VLDB 6.3798143e-05
4,886 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 6.3694868e-05
4,983 Indexing Large Human-Motion Databases 2004 VLDB 6.3269506e-05
5,238 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.2169207e-05
5,527 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0936219e-05
5,722 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 6.0183253e-05
5,796 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 5.9910143e-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.001992968
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0011405675
8 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.0008122792
44 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB 0.00045337853
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040370171
90 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00034860244
279 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022308048
353 The Query By Image Content (QBIC) System 1995 SIGMOD 0.00020222998
527 Multi-Step Processing of Spatial Joins 1994 SIGMOD 0.00016880616
1,142 Beyond Uniformity and Independence : Analysis of R-trees Using the Concept of Fractal Dimension 1994 PODS 0.00011848523
1,527 On the Analysis of Indexing Schemes 1997 PODS 0.00010350889
3,887 Fast Parallel Similarity Search in Multimedia Databases 1997 SIGMOD 6.9458013e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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