DBScholar

Back to papers

Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring

Summary: Novel LSH scheme LCCS-LSH using Longest Circular Co-Substring (LCCS) and Circular Shift Array (CSA) for efficient k-LCCS search. LSH-family-independent, supports multi-metric c-ANNS; introduces a multi-probe version and outperforms SOTA on five real datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6055
Venue
SIGMOD
Year
2020
Pagerank
7.5711218e-05
Overall Rank
3,279 | 77.51%
DOI
10.1145/3318464.3389778

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lei_sigmod20,
        title = {{Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring}},
        author = {Lei, Yifan and Huang, Qiang and Kankanhalli, Mohan and Tung, Anthony K. H.},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3389778},
        url = {https://dl.acm.org/doi/10.1145/3318464.3389778},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Rank Citing Paper Year Venue Pagerank
1,357 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00011043994
1,802 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.7284341e-05
5,121 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.3577317e-05
5,800 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0850924e-05
6,956 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.7303405e-05
7,145 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.6908957e-05
7,761 DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph 2025 SIGMOD 5.550467e-05
9,236 Wolverine: Highly Efficient Monotonic Search Path Repair for Graph-based ANN Index Updates 2025 VLDB 5.3016261e-05
9,918 HAKES: Scalable Vector Database for Embedding Search Service 2025 VLDB 5.1955087e-05
9,964 DIDS: Double Indices and Double Summarizations for Fast Similarity Search 2024 VLDB 5.18753e-05
10,247 GEM: A Native Graph-based Index for Multi-Vector Retrieval 2026 SIGMOD 5.093636e-05
10,297 TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,417 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
11,732 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB 5.093636e-05
13,357 From Zero to Hero: Detecting Leaked Data through Synthetic Data Injection and Model Querying 2024 VLDB -
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 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
93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034701237
277 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022537944
287 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00022323585
332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020920444
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
690 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.0001492934
990 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00012796562
1,572 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010329197
2,158 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0622995e-05
7,240 Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search 2018 SIGMOD 5.6643589e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB
2 6,583 Distance-Sensitive Hashing 2018 PODS
3 2,673 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD
4 990 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
5 5,800 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB
6 1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
7 11,732 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB
8 1,546 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
9 369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
10 332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB