Database Paper Browser

Back to papers

Neighbor-Sensitive Hashing

Summary: Neighbor-Sensitive Hashing reframes kNN hashing by increasing distance between similar items in hash space. Theoretical analysis and a practical algorithm show improved efficiency and accuracy on benchmarks versus state-of-the-art methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11254
Venue
VLDB
Year
2016
Pagerank
5.6204105e-05
Overall Rank
5,218 | 63.74%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
1,161 VerdictDB: Universalizing Approximate Query Processing 2018 SIGMOD 0.00013579831
1,347 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00012463441
2,525 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data 2024 SIGMOD 8.5991468e-05
2,589 Database Learning: Toward a Database that Becomes Smarter Every Time 2017 SIGMOD 8.4868591e-05
5,817 BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guarantees 2019 SIGMOD 5.3154329e-05
6,790 InferDB: In-Database Machine Learning Inference Using Indexes 2024 VLDB 4.9205968e-05
11,196 A Step Toward Deep Online Aggregation 2023 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 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.0032118946
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
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
399 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00024359304
579 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.0001982328
675 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018304179
858 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015833075
1,299 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012712766
1,451 Online Aggregation for Large MapReduce Jobs 2011 VLDB 0.00011925842
1,867 Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems 2014 SIGMOD 0.00010264932
2,424 The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing 2014 SIGMOD 8.8415494e-05
2,872 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing 2013 VLDB 7.9797548e-05
3,019 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.699097e-05
3,301 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.2450912e-05
3,808 Turbo-Charging Estimate Convergence in DBO 2009 VLDB 6.7416988e-05
6,077 Query-Sensitive Embeddings 2005 SIGMOD 5.2203422e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05
4,035 Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces 2006 SIGMOD 6.5111577e-05
596 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00019455943
9,267 MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances 2023 VLDB 4.3647353e-05
10,363 On the Adversarial Robustness of Locality-Sensitive Hashing in Hamming Space 2025 PODS 4.1905499e-05
579 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.0001982328
8,759 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 4.4520434e-05
4,598 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 6.053944e-05
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
3,019 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.699097e-05