Scalable and adaptive online joins

Proceedings of the VLDB Endowment

Volumn 7, Issue 6, 2014, Pages 441-452

  Elseidy, Mohammed ^a   Elguindy, Abdallah ^a   Vitorovic, Aleksandar ^a   Koch, Christoph ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE RATIO; DATA DISTRIBUTION; EVENTUAL CONSISTENCY; JOIN PROCESSING; RESOURCE UTILIZATIONS; STATE OF THE ART; STATIC APPROACH; STATIC PARTITIONING;

EID: 84896867857     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2732279.2732281     Document Type: Conference Paper

References (43)

1. The TPC-H benchmark. http://www.tpc.org/tpch/.
2. D. Abadi, Y. Ahmad, M. Balazinska, U. Çetintemel, M. Cherniack, J. Hwang, W. Lindner, A. Maskey, A. Rasin, E. Ryvkina, N. Tatbul, Y. Xing, and S. Zdonik. The design of the Borealis stream processing engine. In CIDR, pages 277-289, 2005.
3. F. Afrati and J. Ullman. Optimizing joins in a MapReduce environment. In EDBT, pages 99-110, 2010.
4. A. Arasu, B. Babcock, S. Babu, J. Cieslewicz, M. Datar, K. Ito, R. Motwani, U. Srivastava, and J. Widom. STREAM: The Stanford data stream management system. Technical report, Stanford InfoLab, 2004.
5. A. Arasu, M. Cherniack, E. Galvez, D. Maier, A. Maskey, E. Ryvkina, M. Stonebraker, R. Tibbetts. Linear road: a stream data management benchmark. In VLDB, pages 480-491, 2004.
6. R. Avnur and J. Hellerstein. Eddies: continuously adaptive query processing. In SIGMOD, pages 261-272, 2000.
7. S. Babu and P. Bizarro. Adaptive query processing in the looking glass. In CIDR, pages 238-249, 2005.
8. S. Blanas, J. Patel, V. Ercegovac, J. Rao, E. Shekita, and Y. Tian. A comparison of join algorithms for log processing in MapReduce. In SIGMOD, pages 975-986, 2010.
9. R. Fernandez, M. Migliavacca, E. Kalyvianaki and P. Pietzuch. Integrating scale out and fault tolerance in stream processing using operator state management. In SIGMOD, pages 725-736, 2013.
10. S. Chaudhuri and V. Narasayya. TPC-D data generation with skew.
11. J. Dean and S. Ghemawat. MapReduce: simplified data processing on large clusters. In OSDI, pages 10-10, 2004.
12. A. Deshpande and J. Hellerstein. Lifting the burden of history from adaptive query processing. In VLDB, pages 948-959, 2004.
13. A. Deshpande, Z. Ives, and V. Raman. Adaptive query processing. Foundations and Trends in Databases, 1(1):1-140, 2007.
14. J. Dittrich, B. Seeger, D. Taylor, and P. Widmayer. Progressive merge join: a generic and non-blocking sort-based join algorithm. In VLDB, pages 299-310, 2002.
15. M. Elseidy, A. Elguindy, A. Vitorovic, and C. Koch. Scalable and adaptive online joins. EPFL-REPORT 190035 Technical Report, 2013.
16. A. Gounaris, N. Paton, A. Fernandes, and R. Sakellariou. Adaptive query processing: A survey. In British National Conference on Databases, pages 11-25, 2002.
17. A. Gounaris, E. Tsamoura, and Y. Manolopoulos. Adaptive query processing in distributed settings. Advanced Query Processing, 36(1):211-236, 2012.
18. G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73-169, 1993.
19. X. Gu, P. Yu, and H. Wang. Adaptive load diffusion for multiway windowed stream joins. In ICDE, pages 146-155, 2007.
20. P. Haas and J. Hellerstein. Ripple joins for online aggregation. In SIGMOD, pages 287-298, 1999.
21. J. Hellerstein, M. Franklin, S. Chandrasekaran, A. Deshpande, K. Hildrum, S. Madden, V. Raman, and M. Shah. Adaptive query processing: Technology in evolution. IEEE Data Engineering Bulletin, 23(2), 2000.
22. J. Hellerstein, P. Haas, and H. Wang. Online aggregation. In SIGMOD, pages 171-182, 1997.
23. Y. Ioannidis and S. Christodoulakis. On the propagation of errors in the size of join results. In SIGMOD, pages 268-277, 1991.
24. B. Liu, M. Jbantova, and E. Rundensteiner. Optimizing state-intensive non-blocking queries using run-time adaptation. In ICDE Workshop, page 614-623, 2007.
25. M. Mokbel, M. Lu, and W. Aref. Hash-Merge join: A non-blocking join algorithm for producing fast and early join results. In ICDE, pages 251-262, 2004.
26. A. Okcan and M. Riedewald. Processing theta-joins using MapReduce. In SIGMOD, pages 949-960, 2011.
27. M. Olson, K. Bostic, and M. Seltzer. Berkeley DB. In Annual Technical Conference, USENIX, pages 43-43, 1999.
28. C. Olston, B. Reed, A. Silberstein, and U. Srivastava. Automatic optimization of parallel dataflow programs. In Annual Technical Conference, USENIX, pages 267-273, 2008.
29. N. Paton, J. Buenabad, M. Chen, V. Raman, G. Swart, I. Narang, D. Yellin, and A. Fernandes. Autonomic query parallelization using non-dedicated computers: an evaluation of adaptivity options. VLDBJ, 18(1):119-140, 2009.
30. D. Schneider and D. DeWitt. A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment. In SIGMOD, pages 110-121, 1989.
31. M. Shah, J. Hellerstein, S. Chandrasekaran, and M. Franklin. Flux: An adaptive partitioning operator for continuous query systems. In ICDE, pages 25-36, 2002.
32. J. Stamos and H. Young. A symmetric fragment and replicate algorithm for distributed joins. Transactions on Parallel and Distributed Systems, 4(12):1345-1354, 1993.
33. M. Stillger, G. Lohman, V. Markl, and M. Kandil. LEO -DB2's learning optimizer. In VLDB, pages 19-28, 2001.
34. Y. Tao, M. L. Yiu, D. Papadias, M. Hadjieleftheriou, and N. Mamoulis. RPJ: producing fast join results on streams through rate-based optimization. In SIGMOD, pages 371-382, 2005.
35. F. Tian and D. DeWitt. Tuple routing strategies for distributed eddies. In VLDB, pages 333-344, 2003.
36. P. Upadhyaya, Y. Kwon, and M. Balazinska. A latency and fault-tolerance optimizer for online parallel query plans. In SIGMOD, pages 241-252, 2011.
37. T. Urhan and M. Franklin. XJoin: A reactively-scheduled pipelined join operator. IEEE Data Engineering Bulletin, 23(2):27-33, 2000.
38. S. Wang and E. Rundensteiner. Scalable stream join processing with expensive predicates: workload distribution and adaptation by time-slicing. In EDBT, pages 299-310, 2009.
39. A. Wilschut and P. Apers. Dataflow query execution in a parallel main-memory environment. In Parallel and Distributed Information Systems, pages 68-77, 1991.
40. Y. Xing, S. Zdonik, and J. Hwang. Dynamic load distribution in the Borealis stream processor. In ICDE, pages 791-802, 2005.
41. H. Yang, A. Dasdan, R. Hsiao, and D. Parker. Map-Reduce-Merge: simplified relational data processing on large clusters. In SIGMOD, pages 1029-1040, 2007.
42. X. Zhang, L. Chen, and M. Wang. Efficient multi-way theta-join processing using MapReduce. VLDBJ, 5(11):1184-1195, 2012.
43. Y. Zhou, B. Ooi, and K. Tan. Dynamic load management for distributed continuous query systems. In ICDE, 2005.