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.00016079505
Overall Rank
578 | 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.00015142453
925 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013026835
987 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012643645
1,318 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011035606
1,460 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010558941
1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.00010045437
2,426 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 8.4692316e-05
2,501 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 8.359489e-05
2,968 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.7879589e-05
3,244 Similarity Query Processing for High-Dimensional Data 2020 VLDB 7.479122e-05
3,552 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.1888282e-05
4,077 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 6.8040917e-05
4,703 Learned Cardinality Estimation for Similarity Queries 2021 SIGMOD 6.4458272e-05
4,873 Neighbor-Sensitive Hashing 2016 VLDB 6.3580715e-05
5,227 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.2080477e-05
5,294 FARGO: Fast Maximum Inner Product Search via Global Multi-Probing 2023 VLDB 6.1780995e-05
5,526 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0804398e-05
5,891 ARKGraph: All-Range Approximate K-Nearest-Neighbor Graph 2023 VLDB 5.9396547e-05
6,656 Similarity Search and Locality Sensitive Hashing using Ternary Content Addressable Memories 2010 SIGMOD 5.7034822e-05
6,885 Flexible Aggregate Similarity Search 2011 SIGMOD 5.6402295e-05
7,121 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.580601e-05
7,286 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5493084e-05
7,684 Online Video Recommendation in Sharing Community 2015 SIGMOD 5.4565877e-05
7,926 Near-Duplicate Text Alignment with One Permutation Hashing 2024 SIGMOD 5.4083603e-05
10,140 Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations 2025 PODS 5.0597449e-05
10,358 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.0156513e-05
10,555 LSHAlign: All-Pair Near-Duplicate Text Alignment via LSH 2026 SIGMOD 4.9605343e-05
10,616 Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations 2026 SIGMOD 4.9605343e-05
10,801 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 4.9605343e-05
10,898 Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization 2026 VLDB 4.9605343e-05
10,905 ConANN: Conformal Approximate Nearest Neighbor Search 2026 VLDB 4.9605343e-05
11,943 Migrating Social Event Recommendation Over Microblogs 2022 VLDB 4.9605343e-05
12,085 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB 4.9605343e-05
12,091 Fast Algorithm for Anchor Graph Hashing 2021 VLDB 4.9605343e-05
12,493 Scaling Manifold Ranking Based Image Retrieval 2015 VLDB 4.9605343e-05
12,711 Effective Data Co-Reduction for Multimedia Similarity Search 2011 SIGMOD 4.9605343e-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.0011386412
5 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0010688884
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057610161
28 Nearest Neighbor Queries 1995 SIGMOD 0.00051134355
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00044967652
90 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00034749222
143 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00029095978
281 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00022262975
647 Evaluating Top-k Selection Queries 1999 VLDB 0.00015165562
674 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.00014872783
3,332 Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbor Searches 2000 VLDB 7.4057218e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 339 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
2 2,129 What is the nearest neighbor in high dimensional spaces? 2000 VLDB
3 5,526 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB
4 1,161 A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space 1997 PODS
5 5,814 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 925 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
8 286 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
9 1,460 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
10 1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB