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
h6af97ac096ecb9f5
Venue
SIGMOD
Year
2020
Pagerank
7.8000797e-05
Overall Rank
2,969 | 80.04%
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 18 of 18 citing papers.

Rank Citing Paper Year Venue Pagerank
804 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00013832333
1,684 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.8801753e-05
5,238 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.2169207e-05
5,527 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0936219e-05
7,096 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.601767e-05
7,264 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5703557e-05
7,593 DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph 2025 SIGMOD 5.4880197e-05
8,306 Wolverine: Highly Efficient Monotonic Search Path Repair for Graph-based ANN Index Updates 2025 VLDB 5.3583322e-05
10,089 HAKES: Scalable Vector Database for Embedding Search Service 2025 VLDB 5.0807138e-05
10,121 DIDS: Double Indices and Double Summarizations for Fast Similarity Search 2024 VLDB 5.0771316e-05
10,325 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.0346745e-05
10,461 GEM: A Native Graph-based Index for Multi-Vector Retrieval 2026 SIGMOD 4.9793485e-05
10,509 TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search 2026 SIGMOD 4.9793485e-05
10,827 Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization 2026 VLDB 4.9793485e-05
10,829 RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search 2026 VLDB 4.9793485e-05
10,874 BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector 2026 VLDB 4.9793485e-05
12,035 MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1 2021 VLDB 4.9793485e-05
13,674 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.001992968
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057568153
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
279 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022308048
280 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.0002230467
298 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00021833987
338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020585187
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016335405
576 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016121388
674 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.00014886692
927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013025904
1,530 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010344205
2,113 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0196806e-05
7,329 Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search 2018 SIGMOD 5.5505604e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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