DBScholar

Back to papers

Neighbor-Sensitive Hashing

Summary: Rejects the standard locality-sensitive hashing premise: deliberately separating similar items in Hamming space can improve approximate-kNN discrimination. Provides theoretical justification and a corresponding hashing algorithm, yielding better accuracy and efficiency empirically. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
11441
Venue
VLDB
Year
2016
Pagerank
6.4426453e-05
Overall Rank
4,927 | 66.20%
DOI
10.14778/2850583.2850589

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{park_vldb16,
        title = {{Neighbor-Sensitive Hashing}},
        author = {Park, Yongjoo and Cafarella, Michael and Mozafari, Barzan},
        journal = {PVLDB},
        series = {{VLDB} '16},
        volume = {9},
        number = {3},
        pages = {144--155},
        doi = {10.14778/2850583.2850589},
        url = {https://doi.org/10.14778/2850583.2850589},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
772 VerdictDB: Universalizing Approximate Query Processing 2018 SIGMOD 0.00014147905
926 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00013181732
1,515 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data 2024 SIGMOD 0.00010521317
1,995 Database Learning: Toward a Database that Becomes Smarter Every Time 2017 SIGMOD 9.3403665e-05
5,456 InferDB: In-Database Machine Learning Inference Using Indexes 2024 VLDB 6.2131252e-05
5,785 BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guarantees 2019 SIGMOD 6.0892672e-05
9,392 A Step Toward Deep Online Aggregation 2023 SIGMOD 5.2755515e-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.0020210012
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
46 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00044853085
85 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00035405879
287 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00022323585
369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00019945234
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
581 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016153395
991 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012793339
1,009 Online Aggregation for Large MapReduce Jobs 2011 VLDB 0.00012684342
1,401 Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems 2014 SIGMOD 0.00010889902
1,872 The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing 2014 SIGMOD 9.5759874e-05
2,390 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing 2013 VLDB 8.6438351e-05
2,673 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 8.2730112e-05
2,979 Indexing the Distance: An Efficient Method to KNN Processing 2001 VLDB 7.8984588e-05
3,157 Turbo-Charging Estimate Convergence in DBO 2009 VLDB 7.6911286e-05
5,909 Query-Sensitive Embeddings 2005 SIGMOD 6.0444989e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 3,710 Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces 2006 SIGMOD
2 332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
3 9,493 MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances 2023 VLDB
4 10,645 On the Adversarial Robustness of Locality-Sensitive Hashing in Hamming Space 2025 PODS
5 369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
6 5,666 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS
7 6,583 Distance-Sensitive Hashing 2018 PODS
8 3,858 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD
9 21 Similarity Search in High Dimensions via Hashing 1999 VLDB
10 2,673 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD