Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting

Summary: Collision Counting LSH (C2LSH): dynamic compound LSH from m single LSHs; a point o is a candidate for q if its collision count with q exceeds l. m independent of dimensionality; C2LSH offers guarantees on query quality and outperforms LSB-forest in high-D. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4552
Venue: SIGMOD
Year: 2012
Pagerank: 0.000193396
Overall Rank: 605 | 95.80%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 55 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,260	JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search	2026	VLDB	4.1945683e-05
10,602	Wolverine: Highly Efficient Monotonic Search Path Repair for Graph-based ANN Index Updates	2025	VLDB	4.1945683e-05
11,535	MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1	2021	VLDB	4.1945683e-05
11,541	Fast Algorithm for Anchor Graph Hashing	2021	VLDB	4.1945683e-05
11,655	Top-k Queries over Digital Traces	2019	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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.0032169493
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076637636
400	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.0002427237
709	Efficient Similarity Search and Classification via Rank Aggregation	2003	SIGMOD	0.00017768547
2,024	ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search	2011	SIGMOD	9.7519678e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,303	MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances	2023	VLDB	4.358026e-05
3,938	Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond	2017	VLDB	6.6155909e-05
2,971	Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces	2023	VLDB	7.7970531e-05
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076637636
682	Quality and Efficiency in High Dimensional Nearest Neighbor Search	2009	SIGMOD	0.00018201541
3,056	DSH: Data Sensitive Hashing for High-Dimensional k-NN Search	2014	SIGMOD	7.6432146e-05
6,376	DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search	2024	VLDB	5.0916875e-05
2,181	PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search	2020	VLDB	9.3451821e-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