Database Paper Browser

Back to papers

Efficient Multi-way Theta-Join Processing Using MapReduce

Summary: Cost-based scheduling for multi-way Theta-joins in a shared-nothing MapReduce paradigm; metrics for single and multi-job plans. Introduces a chain-typed Theta-join that can be done in one MapReduce job, beating Pig/Hive solutions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10356
Venue
VLDB
Year
2012
Pagerank
7.6343994e-05
Overall Rank
3,062 | 78.70%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

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
335 Optimization of Real Conjunctive Queries 1993 PODS 0.00027036073
447 Efficient Parallel Set-Similarity Joins Using MapReduce 2010 SIGMOD 0.00022900171
794 Hadoop++: Making a Yellow Elephant Run Like a Cheetah (Without It Even Noticing) 2010 VLDB 0.00016605103
947 MRShare: Sharing Across Multiple Queries in MapReduce 2010 VLDB 0.00015114576
1,074 Processing Theta-Joins using MapReduce* 2011 SIGMOD 0.00014260096
1,499 Apache Hadoop Goes Realtime at Facebook 2011 SIGMOD 0.00011675192
1,615 The Performance of MapReduce: An In-depth Study 2010 VLDB 0.00011132319
3,539 Scheduling Shared Scans of Large Data Files 2008 VLDB 6.9956521e-05
Previous Page 1 / 1 Next

Semantically Similar Papers