Database Paper Browser

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
4148
Venue
SIGMOD
Year
2009
Pagerank
0.00018304179
Overall Rank
675 | 95.32%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 34 of 34 citing papers.

Rank Citing Paper Year Venue Pagerank
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,299 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012712766
1,934 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00010047294
2,160 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 9.4037759e-05
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05
3,019 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.699097e-05
3,182 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 7.4280768e-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,598 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 6.053944e-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,477 Learned Cardinality Estimation for Similarity Queries 2021 SIGMOD 5.4856699e-05
5,577 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 5.423881e-05
5,690 FARGO: Fast Maximum Inner Product Search via Global Multi-Probing 2023 VLDB 5.3699421e-05
6,000 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.2365238e-05
6,375 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 5.0868008e-05
6,388 Similarity Search and Locality Sensitive Hashing using Ternary Content Addressable Memories 2010 SIGMOD 5.079988e-05
6,545 Flexible Aggregate Similarity Search 2011 SIGMOD 5.01361e-05
6,918 Online Video Recommendation in Sharing Community 2015 SIGMOD 4.8878659e-05
7,198 ARKGraph: All-Range Approximate K-Nearest-Neighbor Graph 2023 VLDB 4.79852e-05
7,698 Near-Duplicate Text Alignment with One Permutation Hashing 2024 SIGMOD 4.6699546e-05
7,848 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 4.6323445e-05
9,763 Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations 2025 PODS 4.2815042e-05
10,042 Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations 2026 SIGMOD 4.1905499e-05
10,129 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 4.1905499e-05
10,260 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 4.1905499e-05
10,291 ConANN: Conformal Approximate Nearest Neighbor Search 2026 VLDB 4.1905499e-05
11,389 Migrating Social Event Recommendation Over Microblogs 2022 VLDB 4.1905499e-05
11,539 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB 4.1905499e-05
11,545 Fast Algorithm for Anchor Graph Hashing 2021 VLDB 4.1905499e-05
11,963 Scaling Manifold Ranking Based Image Retrieval 2015 VLDB 4.1905499e-05
12,184 Effective Data Co-Reduction for Multimedia Similarity Search 2011 SIGMOD 4.1905499e-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
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016113151
8 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0015436578
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
48 Nearest Neighbor Queries 1995 SIGMOD 0.0006954126
78 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00056385781
129 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00044255276
159 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00040135453
399 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00024359304
710 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.00017727016
802 Evaluating Top-k Selection Queries 1999 VLDB 0.00016440813
3,062 Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbor Searches 2000 VLDB 7.6348035e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
579 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.0001982328
2,099 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.5429949e-05
6,375 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 5.0868008e-05
1,180 A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space 1997 PODS 0.00013455619
8,759 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 4.4520434e-05
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
1,225 SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013182109
596 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00019455943
2,160 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 9.4037759e-05
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05