DBScholar

Back to papers

Progressive Merge Join: A Generic and Non-Blocking Sort-Based Join Algorithm

Summary: PMJ makes sort-based joins non-blocking by emitting matches as external mergesort produces initial runs, avoiding the usual full-sort delay. Its generic framework covers join variants and probabilistic online selectivity estimation, with early output and modest runtime overhead. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9044
Venue
VLDB
Year
2002
Pagerank
8.1205738e-05
Overall Rank
2,787 | 80.89%
DOI
10.1016/B978-155860869-6/50034-2

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{dittrich_vldb02,
        title = {{Progressive Merge Join: A Generic and Non-Blocking Sort-Based Join Algorithm}},
        author = {Dittrich, Jens-Peter and Seeger, Bernhard and Taylor, David Scot and Widmayer, Peter},
        journal = {PVLDB},
        series = {{VLDB} '02},
        doi = {10.1016/B978-155860869-6/50034-2},
        url = {https://doi.org/10.1016/B978-155860869-6/50034-2},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers