Database Paper Browser

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
3347
Venue
SIGMOD
Year
2002
Pagerank
5.1546943e-05
Overall Rank
6,214 | 56.78%
DOI
-

Incoming Non-self Citations Over Time

Authors

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