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 7 of 57 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,359 | DiskJoin: Large-scale Vector Similarity Join with SSD | 2026 | SIGMOD | 5.093636e-05 |
| 10,512 | SVFusion: A CPU-GPU Co-Processing Architecture for Large-Scale Real-Time Vector Search | 2026 | VLDB | 5.093636e-05 |
| 10,525 | Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search | 2026 | VLDB | 5.093636e-05 |
| 10,548 | JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search | 2026 | VLDB | 5.093636e-05 |
| 11,732 | MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 | 2021 | VLDB | 5.093636e-05 |
| 11,738 | Fast Algorithm for Anchor Graph Hashing | 2021 | VLDB | 5.093636e-05 |
| 11,850 | Top-k Queries over Digital Traces | 2019 | SIGMOD | 5.093636e-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.0020210012 |
| 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00056760516 |
| 287 | Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search | 2007 | VLDB | 0.00022323585 |
| 690 | Efficient Similarity Search and Classification via Rank Aggregation | 2003 | SIGMOD | 0.0001492934 |
| 1,935 | ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search | 2011 | SIGMOD | 9.4560124e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,389 | Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond | 2017 | VLDB |
| 2 | 1,934 | Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces | 2023 | VLDB |
| 3 | 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB |
| 4 | 581 | Quality and Efficiency in High Dimensional Nearest Neighbor Search | 2009 | SIGMOD |
| 5 | 2,673 | DSH: Data Sensitive Hashing for High-Dimensional k-NN Search | 2014 | SIGMOD |
| 6 | 6,583 | Distance-Sensitive Hashing | 2018 | PODS |
| 7 | 5,800 | DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search | 2024 | VLDB |
| 8 | 1,546 | PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search | 2020 | VLDB |
| 9 | 3,279 | Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring | 2020 | SIGMOD |
| 10 | 332 | Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search | 2016 | VLDB |