Efficient multi-way Theta-join processing using MapReduce

Proceedings of the VLDB Endowment

Volumn 5, Issue 11, 2012, Pages 1184-1195

  Zhang, Xiaofei ^a   Chen, Lei ^a   Wang, Min ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

DISTRIBUTED AND PARALLEL DATABASE; JOIN OPERATION; JOIN PROCESSING; PROCESSING UNITS; PROGRAMMING MODELS; QUERY EVALUATION; SHARED NOTHING; TOTAL PROCESSING TIME;

DATABASE SYSTEMS;

EID: 84873185478     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2350229.2350238     Document Type: Article

References (29)

1. Transaction processing performance council. http://www.tpc.org/.
2. F. Afrati and J. Ullman. Optimizing multiway joins in a map-reduce environment. TKDE, 23(9):1282-1298, 2011.
3. P. Agrawal and et al. Scheduling shared scans of large data files. PVLDB, 1(1):958-969, 2008.
4. D. Battŕe and et al. Nephele/pacts: a programming model and execution framework for web-scale analytical processing. In SoCC, pages 119-130, 2010.
5. D. Borthakur and et al. Apache hadoop goes realtime at facebook. In SIGMOD, pages 1071-1080, 2011.
6. G. Brightwell and et al. Note on counting eulerian circuits. CoRR, cs.CC/0405067, 2004.
7. Y. Cao and et al. Es2: A cloud data storage system for supporting both oltp and olap. In ICDE, pages 291-302, 2011.
8. S. Chaudhuri and et al. Optimization of real conjunctive queries. In PODS, pages 59-70, 1993.
9. T. Condie and et al. Mapreduce online. In NSDI, pages 313-328, 2010.
10. T. H. Cormen and et al. Introduction to Algorithms (3. ed.). MIT Press, 2009.
11. S. Das and et al. G-store: a scalable data store for transactional multi key access in the cloud. In SoCC, pages 163-174, 2010.
12. J. Dean and et al. Mapreduce: simplified data processing on large clusters. Commun. ACM, 51(1):107-113, 2008.
13. J. Dittrich and et al. Hadoop++: Making a yellow elephant run like a cheetah (without it even noticing). PVLDB, 3(1):518-529, 2010.
14. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, 1998.
15. I. Gelfand and et al. Calculus of Variations. Dover Publ., 2000.
16. A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.
17. Y. He and et al. Rcfile: A fast and space-efficient data placement structure in mapreduce-based warehouse systems. In ICDE, pages 1199-1208, 2011.
18. A. Iosup and et al. Performance analysis of cloud computing services for many-tasks scientific computing. TPDS, pages 931-945, 2011.
19. K. Jansen. Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. Algorithmica, 39(1):59-81, 2004.
20. E. T. Jaynes. Probability theory: The logic of science. Cambridge University Press, Cambridge, 2003.
21. D. Jiang and et al. The performance of mapreduce: An in-depth study. PVLDB, 3(1):472-483, 2010.
22. C. Lee and et al. Optimizing large join queries using a graph-based approach. TKDE, 13(2):298-315, 2001.
23. R. Lee and et al. Ysmart: Yet another sql-to-mapreduce translator. In ICDCS, pages 25-36, 2011.
24. T. Nykiel and et al. Mrshare: Sharing across multiple queries in mapreduce. PVLDB, 3(1):494-505, 2010.
25. A. Okcan and et al. Processing theta-joins using mapreduce. In SIGMOD, pages 949-960, 2011.
26. K.-L. Tan and et al. A note on the strategy space of multiway join query optimization problem in parallel systems. SIGMOD Record, 20(4):81-82, 1991.
27. R. Vernica and et al. Efficient parallel set-similarity joins using mapreduce. In SIGMOD, pages 495-506, 2010.
28. S. Wu and et al. Query optimization for massively parallel data processing. In SoCC, pages 1-13, 2011.
29. J. Zhou and et al. Incorporating partitioning and parallel plans into the scope optimizer. In ICDE, pages 1060-1071, 2010.