DBScholar

Back to papers

Efficient set joins on similarity predicates

Summary: General, scalable algorithm for set joins on similarity predicates (intersect size, Jaccard, cosine, edit distance) extending beyond simple containment. Inverted-index probing with staged optimizations, memory-efficient partitioning, and index compression enabling in-memory operation; generalizes to weighted/unweighted partial word overlap. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3626
Venue
SIGMOD
Year
2004
Pagerank
0.00025597287
Overall Rank
200 | 98.63%
DOI
10.1145/1007568.1007652

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{sarawagi_sigmod04,
        title = {{Efficient set joins on similarity predicates}},
        author = {Sarawagi, Sunita and Kirpal, Alok},
        series = {{SIGMOD} '04},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1007568.1007652},
        url = {https://dl.acm.org/doi/10.1145/1007568.1007652},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 53 citing papers.

Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers