DBScholar

Back to papers

Quality and Efficiency in High Dimensional Nearest Neighbor Search

Summary: Proposes LSB-tree, a locality-sensitive B-tree for high-dimensional NN, enabling sub-linear queries with quality guarantees in a DB-friendly index. LSB-forest stacks LSB-trees to achieve rigorous-LSH quality at much lower space and time, with linear-space updates; experiments show two orders of magnitude faster than exact NN and better quality than linear-space approximations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hefc9711ac4333897
Venue
SIGMOD
Year
2009
Pagerank
0.00016121388
Overall Rank
576 | 96.13%
DOI
10.1145/1559845.1559905

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{tao_sigmod09,
        title = {{Quality and Efficiency in High Dimensional Nearest Neighbor Search}},
        author = {Tao, Yufei and Yi, Ke and Sheng, Cheng and Kalnis, Panos},
        series = {{SIGMOD} '09},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1559845.1559905},
        url = {https://dl.acm.org/doi/10.1145/1559845.1559905},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 36 of 36 citing papers.

Rank Citing Paper Year Venue Pagerank
650 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015149775
927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013025904
992 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012646771
1,328 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011003106
1,485 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010523759
1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.0001004502
2,448 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 8.4494625e-05
2,505 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 8.3779738e-05
2,969 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.8000797e-05
3,230 Similarity Query Processing for High-Dimensional Data 2020 VLDB 7.5056037e-05
3,546 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.2123214e-05
4,050 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 6.8298981e-05
4,688 Learned Cardinality Estimation for Similarity Queries 2021 SIGMOD 6.4697463e-05
4,856 Neighbor-Sensitive Hashing 2016 VLDB 6.3798143e-05
5,238 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.2169207e-05
5,268 FARGO: Fast Maximum Inner Product Search via Global Multi-Probing 2023 VLDB 6.2015316e-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,920 ARKGraph: All-Range Approximate K-Nearest-Neighbor Graph 2023 VLDB 5.9475097e-05
6,646 Similarity Search and Locality Sensitive Hashing using Ternary Content Addressable Memories 2010 SIGMOD 5.7218669e-05
6,868 Flexible Aggregate Similarity Search 2011 SIGMOD 5.6599382e-05
7,096 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.601767e-05
7,264 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5703557e-05
7,665 Online Video Recommendation in Sharing Community 2015 SIGMOD 5.4772833e-05
7,906 Near-Duplicate Text Alignment with One Permutation Hashing 2024 SIGMOD 5.428873e-05
10,101 Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations 2025 PODS 5.0789354e-05
10,325 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.0346745e-05
10,478 LSHAlign: All-Pair Near-Duplicate Text Alignment via LSH 2026 SIGMOD 4.9793485e-05
10,540 Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations 2026 SIGMOD 4.9793485e-05
10,730 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 4.9793485e-05
10,827 Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization 2026 VLDB 4.9793485e-05
10,834 ConANN: Conformal Approximate Nearest Neighbor Search 2026 VLDB 4.9793485e-05
11,893 Migrating Social Event Recommendation Over Microblogs 2022 VLDB 4.9793485e-05
12,035 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB 4.9793485e-05
12,041 Fast Algorithm for Anchor Graph Hashing 2021 VLDB 4.9793485e-05
12,444 Scaling Manifold Ranking Based Image Retrieval 2015 VLDB 4.9793485e-05
12,662 Effective Data Co-Reduction for Multimedia Similarity Search 2011 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank Cited Paper Year Venue Pagerank
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0011405675
5 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0010679641
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057568153
28 Nearest Neighbor Queries 1995 SIGMOD 0.00051312804
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
90 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00034860244
142 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00029202746
280 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.0002230467
643 Evaluating Top-k Selection Queries 1999 VLDB 0.00015217076
674 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.00014886692
3,320 Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbor Searches 2000 VLDB 7.4302233e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
2 2,113 What is the nearest neighbor in high dimensional spaces? 2000 VLDB
3 5,527 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB
4 1,157 A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space 1997 PODS
5 5,796 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS
6 20 Similarity Search in High Dimensions via Hashing 1999 VLDB
7 927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
8 298 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
9 1,485 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
10 1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB