DBScholar

Back to papers

LSHAlign: All-Pair Near-Duplicate Text Alignment via LSH

Summary: LSHAlign solves all-pair near-duplicate alignment by grouping subsequences sharing LSH signatures and representing each group in O(1) space. It achieves expected O((|T|+|S|)mL) time/space, excluding output, with order-of-magnitude speedups. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
7456
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,265 | 29.58%
DOI
10.1145/3802083

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{zhang_sigmod26,
        title = {{LSHAlign: All-Pair Near-Duplicate Text Alignment via LSH}},
        author = {Zhang, Yuheng and Peng, Zhencan and Qiao, Miao and Zhang, Wei and Li, Feifei and Deng, Dong},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802083},
        url = {https://dl.acm.org/doi/10.1145/3802083},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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
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
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
779 JOSIE: Overlap Set Similarity Search for Finding Joinable Tables in Data Lakes 2019 SIGMOD 0.00014092047
978 Winnowing: Local Algorithms for Document Fingerprinting 2003 SIGMOD 0.00012859554
1,284 Copy Detection Mechanisms for Digital Documents 1995 SIGMOD 0.00011332822
1,495 LSH Ensemble: Internet-Scale Domain Search 2016 VLDB 0.00010571481
7,676 Allign: Aligning All-Pair Near-Duplicate Passages in Long Texts 2021 SIGMOD 5.5686107e-05
7,745 Near-Duplicate Text Alignment with One Permutation Hashing 2024 SIGMOD 5.5534781e-05
8,522 TxtAlign: Efficient Near-Duplicate Text Alignment Search via Bottom-k Sketches for Plagiarism Detection 2022 SIGMOD 5.4119882e-05
10,024 Near-Duplicate Sequence Search at Scale for Large Language Model Memorization Evaluation 2023 SIGMOD 5.1757914e-05
10,554 Near-Duplicate Text Alignment under Weighted Jaccard Similarity 2026 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 287 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB
2 7,692 Efficient Top-k Algorithms for Approximate Substring Matching 2013 SIGMOD
3 4,052 Local Similarity Search for Unstructured Text 2016 SIGMOD
4 8,613 Bidirectionally Densifying LSH Sketches with Empty Bins 2021 SIGMOD
5 4,857 Similarity Join Size Estimation using Locality Sensitive Hashing 2011 VLDB
6 2,390 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing 2013 VLDB
7 10,554 Near-Duplicate Text Alignment under Weighted Jaccard Similarity 2026 VLDB
8 8,522 TxtAlign: Efficient Near-Duplicate Text Alignment Search via Bottom-k Sketches for Plagiarism Detection 2022 SIGMOD
9 7,745 Near-Duplicate Text Alignment with One Permutation Hashing 2024 SIGMOD
10 7,676 Allign: Aligning All-Pair Near-Duplicate Passages in Long Texts 2021 SIGMOD