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)
Incoming Non-self Citations Over Time
Authors
- 1. Junhao Gan (Sun Yat-Sen University)
- 2. Jianlin Feng (Sun Yat-Sen University)
- 3. Qiong Fang (Hong Kong University of Science and Technology)
- 4. Wilfred Ng (Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{gan_sigmod12,
title = {{Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting}},
author = {Gan, Junhao and Feng, Jianlin and Fang, Qiong and Ng, Wilfred},
series = {{SIGMOD} '12},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2213836.2213898},
url = {https://dl.acm.org/doi/10.1145/2213836.2213898},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 60 citing papers.
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.0019892478 |
| 20 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00057610161 |
| 281 | Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search | 2007 | VLDB | 0.00022262975 |
| 674 | Efficient Similarity Search and Classification via Rank Aggregation | 2003 | SIGMOD | 0.00014872783 |
| 1,928 | ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search | 2011 | SIGMOD | 9.3476482e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,187 | Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond | 2017 | VLDB |
| 2 | 1,618 | Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces | 2023 | VLDB |
| 3 | 20 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB |
| 4 | 578 | Quality and Efficiency in High Dimensional Nearest Neighbor Search | 2009 | SIGMOD |
| 5 | 2,501 | DSH: Data Sensitive Hashing for High-Dimensional k-NN Search | 2014 | SIGMOD |
| 6 | 6,717 | Distance-Sensitive Hashing | 2018 | PODS |
| 7 | 5,526 | DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search | 2024 | VLDB |
| 8 | 1,460 | PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search | 2020 | VLDB |
| 9 | 2,968 | Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring | 2020 | SIGMOD |
| 10 | 286 | Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search | 2016 | VLDB |