Database Paper Browser

Back to papers

Runtime Optimization of Join Location in Parallel Data Management Systems

Summary: Per-key runtime choice between map-side and reduce-side joins in parallel storage, accounting for UDFs and transfer costs. Extends ski-rental with multi-resource load balancing (CPU, network, I/O) and worst-case guarantees; implemented on Hadoop, Spark, and Muppet; yields throughput gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11433
Venue
VLDB
Year
2017
Pagerank
4.1945683e-05
Overall Rank
11,797 | 17.94%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

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

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank Cited Paper Year Venue Pagerank
166 Approximate Frequency Counts over Data Streams 2002 VLDB 0.00039361552
288 Storm @Twitter 2014 SIGMOD 0.00028939871
328 An Architecture for Parallel Topic Models 2010 VLDB 0.0002728514
588 Practical Skew Handling in Parallel Joins 1992 VLDB 0.00019604754
835 Finding Frequent Items in Data Streams 2008 VLDB 0.00016109621
2,605 Muppet: MapReduce-Style Processing of Fast Data 2012 VLDB 8.4646171e-05
3,308 Automatic Partitioning of Database Applications 2012 VLDB 7.2422925e-05
4,943 Lifting the Burden of History from Adaptive Query Processing 2004 VLDB 5.8170713e-05
Previous Page 1 / 1 Next

Semantically Similar Papers