DSH: Data Sensitive Hashing for High-Dimensional k-NN Search

Summary: DSH: Data Sensitive Hashing for high-dimensional k-NN search leverages data distributions to balance buckets and preserve NN relations. The method offers guarantees and remains orthogonal to indexing strategies, with practical efficiency on non-uniform data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4770
Venue: SIGMOD
Year: 2014
Pagerank: 7.6432146e-05
Overall Rank: 3,056 | 78.75%
DOI: 10.1145/2588555.2588565

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
212	Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph	2019	VLDB	0.00033913475
1,364	Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination	2020	SIGMOD	0.00012370117
1,757	VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning	2020	VLDB	0.00010660932
1,971	LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index	2016	SIGMOD	9.893198e-05
5,224	Neighbor-Sensitive Hashing	2016	VLDB	5.6197981e-05
8,712	ANN Softmax: Acceleration of Extreme Classification Training	2022	VLDB	4.4626362e-05
11,655	Top-k Queries over Digital Traces	2019	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076637636
79	A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces	1998	VLDB	0.00056242144
400	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.0002427237
605	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.000193396
682	Quality and Efficiency in High Dimensional Nearest Neighbor Search	2009	SIGMOD	0.00018201541
1,305	Bayesian Locality Sensitive Hashing for Fast Similarity Search	2012	VLDB	0.00012687101
3,300	Indexing the Distance: An Efficient Method to KNN Processing	2001	VLDB	7.2516103e-05
6,082	Query-Sensitive Embeddings	2005	SIGMOD	5.2205711e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
400	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.0002427237
8,763	Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search	2015	PODS	4.456315e-05
4,243	Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring	2020	SIGMOD	6.32976e-05
562	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB	0.00020091752
2,181	PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search	2020	VLDB	9.3451821e-05
9,303	MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances	2023	VLDB	4.358026e-05
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076637636
605	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.000193396
6,376	DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search	2024	VLDB	5.0916875e-05
5,224	Neighbor-Sensitive Hashing	2016	VLDB	5.6197981e-05