Efficient multi-way theta-join processing using MapReduce
Open Access
- 1 July 2012
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 5 (11) , 1184-1195
Abstract
No abstract availableAll Related Versions
This publication has 22 references indexed in Scilit:
- Query optimization for massively parallel data processing2011
- MRShareProceedings of the VLDB Endowment, 2010
- The performance of MapReduceProceedings of the VLDB Endowment, 2010
- Scheduling shared scans of large data filesProceedings of the VLDB Endowment, 2008
- MapReduceCommunications of the ACM, 2008
- Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation SchemeAlgorithmica, 2004
- Optimizing large join queries using a graph-based approachIEEE Transactions on Knowledge and Data Engineering, 2001
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Optimization of real conjunctive queries1993
- A note on the strategy space of multiway join query optimization problem in parallel systemsACM SIGMOD Record, 1991