DBScholar

Back to papers

Skew Handling Techniques in Sort-Merge Join

Summary: Analyzes skew in sort-merge join and introduces refinements to mitigate its performance penalties, filling a gap left by hash-based skew handling. Near-zero overhead in non-skew cases and band-join gains; these refinements can replace standard sort-merge. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3409
Venue
SIGMOD
Year
2002
Pagerank
6.0472244e-05
Overall Rank
5,897 | 59.55%
DOI
10.1145/564691.564711

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{li_sigmod02,
        title = {{Skew Handling Techniques in Sort-Merge Join}},
        author = {Li, Wei and Gao, Dengfeng and Snodgrass, Richard T.},
        series = {{SIGMOD} '02},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/564691.564711},
        url = {https://dl.acm.org/doi/10.1145/564691.564711},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 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