Database Paper Browser

Back to papers

Near-Duplicate Text Alignment with One Permutation Hashing

Summary: OPH-based compact windows compress all O(n^2 k) min-hashes to O(n+k) space for near-duplicate text alignment under Jaccard, avoiding enumeration. An efficient algorithm derives all query-similar sketches directly from OPH compact windows with three optimizations, reducing index cost and query latency on real datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6967
Venue
SIGMOD
Year
2024
Pagerank
4.6699546e-05
Overall Rank
7,698 | 46.50%
DOI
10.1145/3677136

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
10,035 SWIFT: Enabling Large-Scale Temporal Graph Learning on a Single Machine 2026 SIGMOD 4.1905499e-05
10,245 SeDA: Bridging the Gap between Efficient Syntactic and Precise Semantic Search of Similar Passages in Large Text Corpora 2026 VLDB 4.1905499e-05
10,266 Near-Duplicate Text Alignment under Weighted Jaccard Similarity 2026 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
399 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00024359304
579 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.0001982328
596 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00019455943
614 Copy Detection Mechanisms for Digital Documents 1995 SIGMOD 0.00019088537
675 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018304179
703 Winnowing: Local Algorithms for Document Fingerprinting 2003 SIGMOD 0.0001784726
858 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015833075
1,232 Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints 2008 VLDB 0.00013133604
2,588 Pass-Join: A Partition-based Method for Similarity Joins 2012 VLDB 8.4872437e-05
3,461 Leveraging Set Relations in Exact Set Similarity Join 2017 VLDB 7.0696567e-05
4,247 Local Similarity Search for Unstructured Text 2016 SIGMOD 6.3180334e-05
5,071 Faerie: Efficient Filtering Algorithms for Approximate Dictionary-based Entity Extraction 2011 SIGMOD 5.7122974e-05
7,636 Allign: Aligning All-Pair Near-Duplicate Passages in Long Texts 2021 SIGMOD 4.6863871e-05
8,284 TxtAlign: Efficient Near-Duplicate Text Alignment Search via Bottom-k Sketches for Plagiarism Detection 2022 SIGMOD 4.5392079e-05
9,875 Near-Duplicate Sequence Search at Scale for Large Language Model Memorization Evaluation 2023 SIGMOD 4.2626861e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
9,934 Efficient and Effective KNN Sequence Search with Approximate n-grams 2014 VLDB 4.245954e-05
8,037 A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union 2011 SIGMOD 4.5965282e-05
4,247 Local Similarity Search for Unstructured Text 2016 SIGMOD 6.3180334e-05
5,825 Space-efficient Substring Occurrence Estimation 2011 PODS 5.3119504e-05
2,872 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing 2013 VLDB 7.9797548e-05
8,284 TxtAlign: Efficient Near-Duplicate Text Alignment Search via Bottom-k Sketches for Plagiarism Detection 2022 SIGMOD 4.5392079e-05
7,707 Efficient Top-k Algorithms for Approximate Substring Matching 2013 SIGMOD 4.6676985e-05
7,636 Allign: Aligning All-Pair Near-Duplicate Passages in Long Texts 2021 SIGMOD 4.6863871e-05
10,266 Near-Duplicate Text Alignment under Weighted Jaccard Similarity 2026 VLDB 4.1905499e-05