Locality-sensitive operators for parallel main-memory database clusters

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2014, Pages 592-603

  Rödiger, Wolf ^a   Mühlbauer, Tobias ^a   Unterbrunner, Philipp ^b   Reiser, Angelika ^a   Kemper, Alfons ^a   Neumann, Thomas ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b SnowFlake Computing   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; SCHEDULING;

COMMUNICATION SCHEDULING; DISTRIBUTED OPERATORS; DISTRIBUTED PROCESSING; IMPROVE PERFORMANCE; MAIN-MEMORY DATABASE; NETWORK COMMUNICATIONS; OPTIMAL PARTITIONS; SELECTIVE BROADCAST;

TELECOMMUNICATION SYSTEMS;

EID: 84901798856     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2014.6816684     Document Type: Conference Paper

References (37)

1. S. Fushimi, M. Kitsuregawa, and H. Tanaka, "An overview of the system software of a parallel relational database machine GRACE," in PVLDB, 1986.
2. D. J. Dewitt, S. Ghandeharizadeh, D. A. Schneider, A. Bricker, H.I. Hsiao, and R. Rasmussen, "The Gamma database machine project," TKDE, vol. 2, no. 1, 1990.
3. H. Boral, W. Alexander, L. Clay, G. Copeland, S. Danforth, M. Franklin, B. Hart, M. Smith, and P. Valduriez, "Prototyping Bubba, a highly parallel database system," TKDE, vol. 2, no. 1, 1990.
4. G. Copeland, W. Alexander, E. Boughter, and T. Keller, "Data placement in Bubba," SIGMOD Record, vol. 17, no. 3, 1988.
5. IEEE study group on Next Generation 802.3 BASE-T, "Next generation BASE-T call for interest," http://www.ieee802.org/3/NGBASET, 2012.
6. A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta, "VL2: a scalable and flexible data center network," CACM, vol. 54, no. 3, 2011.
7. J. L. Hennessy and D. A. Patterson, Computer Architecture, 5th ed. Morgan Kaufmann, 2011.
8. R. Kallman, H. Kimura, J. Natkins, A. Pavlo, A. Rasin, S. Zdonik, E. P. C. Jones, S. Madden, M. Stonebraker, Y. Zhang, J. Hugg, and D. J. Abadi, "H-Store: a high-performance, distributed main memory transaction processing system," PVLDB, vol. 1, no. 2, 2008.
9. A. Kemper and T. Neumann, "HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots," in ICDE, 2011.
10. S. Manegold, M. L. Kersten, and P. Boncz, "Database architecture evolution: mammals flourished long before dinosaurs became extinct," PVLDB, vol. 2, no. 2, 2009.
11. M. Zukowski, M. van de Wiel, and P. Boncz, "Vectorwise: A vectorized analytical DBMS," in ICDE, 2012.
12. R. S. Xin, J. Rosen, M. Zaharia, M. J. Franklin, S. Shenker, and I. Stoica, "Shark: SQL and rich analytics at scale," in SIGMOD, 2013.
13. M. Kitsuregawa, H. Tanaka, and T. Moto-Oka, "Application of hash to data base machine and its architecture," NGC, vol. 1, no. 1, 1983.
14. S. Rao, R. Ramakrishnan, A. Silberstein, M. Ovsiannikov, and D. Reeves, "Sailfish: A framework for large scale data processing," in SoCC, 2012.
15. E. B. Nightingale, J. Elson, J. Fan, O. Hofmann, J. Howell, and Y. Suzue, "Flat datacenter storage," in OSDI, 2012.
16. J. L. Wolf, D. M. Dias, and P. S. Yu, "A parallel sort merge join algorithm for managing data skew," TPDS, vol. 4, no. 1, 1993.
17. J. L. Wolf, P. S. Yu, J. Turek, and D. M. Dias, "A parallel hash join algorithm for managing data skew," TPDS, vol. 4, no. 12, 1993.
18. A. N. Wilschut and P. M. G. Apers, "Dataflow query execution in a parallel main-memory environment," in PDIS, 1991.
19. J. W. Stamos and H. C. Young, "A symmetric fragment and replicate algorithm for distributed joins," TPDS, vol. 4, no. 12, 1993.
20. R. Epstein, M. Stonebraker, and E. Wong, "Distributed query processing in a relational data base system," in SIGMOD, 1978.
21. F. N. Afrati and J. D. Ullman, "Optimizing joins in a map-reduce environment," in EDBT, 2010.
22. S. Blanas, J. M. Patel, V. Ercegovac, J. Rao, E. J. Shekita, and Y. Tian, "A comparison of join algorithms for log processing in MapReduce," in SIGMOD, 2010.
23. P. Frey, R. Goncalves, M. Kersten, and J. Teubner, "Spinning relations: high-speed networks for distributed join processing," in DaMoN, 2009.
24. J. Teubner and R. Mueller, "How soccer players would do stream joins," in SIGMOD, 2011.
25. M.-C. Albutiu, A. Kemper, and T. Neumann, "Massively parallel sort-merge joins in main memory multi-core database systems," PVLDB, vol. 5, no. 10, 2012.
26. Y. Li, I. Pandis, R. Mueller, V. Raman, and G. Lohman, "NUMA-aware algorithms: The case of data shuffling," in CIDR, 2013.
27. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," CACM, vol. 13, no. 7, 1970.
28. M. A. Bender, "Don't thrash: how to cache your hash on flash," PVLDB, vol. 5, no. 11, 2012.
29. C. Kim, J. Park, N. Satish, H. Lee, P. Dubey, and J. Chhugani, "CloudRAMSort: fast and efficient large-scale distributed RAM sort on shared-nothing cluster," in SIGMOD, 2012.
30. C. Kim, T. Kaldewey, V. W. Lee, E. Sedlar, A. D. Nguyen, N. Satish, J. Chhugani, A. Di Blas, and P. Dubey, "Sort vs. hash revisited: Fast join implementation on modern multi-core CPUs," PVLDB, 2009.
31. S. Manegold, P. Boncz, and M. Kersten, "Optimizing main-memory join on modern hardware," TKDE, vol. 14, no. 4, 2002.
32. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.
33. T. Gonzalez and S. Sahni, "Open shop scheduling to minimize finish time," JACM, vol. 23, no. 4, 1976.
34. D. J. DeWitt, R. H. Katz, F. Olken, L. D. Shapiro, M. R. Stonebraker, and D. A. Wood, "Implementation techniques for main memory database systems," in SIGMOD, 1984.
35. T. Urhan and M. J. Franklin, "XJoin: A reactively-scheduled pipelined join operator," IEEE Data Engineering Bulletin, vol. 23, no. 2, 2000.
36. J. Gray, P. Sundaresan, S. Englert, K. Baclawski, and P. J. Weinberger, "Quickly generating billion-record synthetic databases," SIG-MOD Record, vol. 23, no. 2, 1994.
37. M. Stonebraker, "The case for shared nothing," IEEE Database En-ginieering, vol. 9, no. 1, 1986.