An Efficient Partition Based Method for Exact Set Similarity Joins
Summary: Introduces a partition-based exact set-similarity join that prunes pairs via shared subsets and 1-deletion neighborhoods, overcoming prefix-filter limitations. Greedy allocation and adaptive grouping reduce optimization from O(s^3) to O(s log s), yielding 2–5× speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dong Deng (Tsinghua University)
- 2. Guoliang Li (Tsinghua University)
- 3. He Wen (Tsinghua University)
- 4. Jianhua Feng (Tsinghua University)
BibTeX Citation
@article{deng_vldb16,
title = {{An Efficient Partition Based Method for Exact Set Similarity Joins}},
author = {Deng, Dong and Li, Guoliang and Wen, He and Feng, Jianhua},
journal = {PVLDB},
series = {{VLDB} '16},
volume = {9},
number = {4},
pages = {360--371},
doi = {10.14778/2856318.2856330},
url = {https://doi.org/10.14778/2856318.2856330},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 162 | Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity | 1998 | SIGMOD | 0.00027536748 |
| 168 | Efficient Exact Set-Similarity Joins | 2006 | VLDB | 0.00027163517 |
| 198 | CrowdER: Crowdsourcing Entity Resolution | 2012 | VLDB | 0.00025555196 |
| 201 | Efficient set joins on similarity predicates | 2004 | SIGMOD | 0.00025331535 |
| 360 | Efficient Parallel Set-Similarity Joins Using MapReduce | 2010 | SIGMOD | 0.00020009936 |
| 963 | Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search | 2012 | SIGMOD | 0.00012816649 |
| 992 | Bayesian Locality Sensitive Hashing for Fast Similarity Search | 2012 | VLDB | 0.00012646771 |
| 1,923 | ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search | 2011 | SIGMOD | 9.3750526e-05 |
| 1,933 | Pass-Join: A Partition-based Method for Similarity Joins | 2012 | VLDB | 9.3459285e-05 |
| 2,220 | String Similarity Joins: An Experimental Evaluation | 2014 | VLDB | 8.8146984e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,408 | Fast Approximate Similarity Join in Vector Databases | 2025 | SIGMOD |
| 2 | 360 | Efficient Parallel Set-Similarity Joins Using MapReduce | 2010 | SIGMOD |
| 3 | 963 | Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search | 2012 | SIGMOD |
| 4 | 1,933 | Pass-Join: A Partition-based Method for Similarity Joins | 2012 | VLDB |
| 5 | 7,030 | Efficient Similarity Join and Search on Multi-Attribute Data | 2015 | SIGMOD |
| 6 | 201 | Efficient set joins on similarity predicates | 2004 | SIGMOD |
| 7 | 2,513 | An Empirical Evaluation of Set Similarity Join Techniques | 2016 | VLDB |
| 8 | 2,921 | Leveraging Set Relations in Exact Set Similarity Join | 2017 | VLDB |
| 9 | 3,596 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD |
| 10 | 168 | Efficient Exact Set-Similarity Joins | 2006 | VLDB |