{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:42:57Z","timestamp":1761864177773,"version":"3.44.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:p>\n            Existing binary join based plans may be suboptimal for important, emerging applications. Typical query optimizers enumerate plans using binary joins only. In this paper, we introduce the multi-way join aware optimizer in SAP HANA. The naive way to extend the existing query optimizer to be aware of multi-way joins (\n            <jats:italic toggle=\"yes\">m<\/jats:italic>\n            -way joins for short) is to enumerate\n            <jats:italic toggle=\"yes\">m<\/jats:italic>\n            -way joins on top of a traditional binary join enumeration framework. However, many different binary joins correspond to the same\n            <jats:italic toggle=\"yes\">m<\/jats:italic>\n            -way join. Thus, unnecessary join enumerations would be required for such naive integration. To solve this problem, we introduce the new concept of an\n            <jats:italic toggle=\"yes\">m<\/jats:italic>\n            -way join unit and explain how the construction of join units is plugged into the SAP HANA query optimizer. We also provide a series of optimizer enhancements by exploiting\n            <jats:italic toggle=\"yes\">m<\/jats:italic>\n            -way join unit characteristics. Using TPC-H and our customer workloads, we showcase the superiority of our\n            <jats:italic toggle=\"yes\">m<\/jats:italic>\n            -way join aware optimizer.\n          <\/jats:p>","DOI":"10.14778\/3415478.3415531","type":"journal-article","created":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T18:46:35Z","timestamp":1600109195000},"page":"3019-3031","source":"Crossref","is-referenced-by-count":3,"title":["Towards multi-way join aware optimizer in SAP HANA"],"prefix":"10.14778","volume":"13","author":[{"given":"Sungheun","family":"Wi","sequence":"first","affiliation":[{"name":"SAP Labs Korea"}]},{"given":"Wook-Shin","family":"Han","sequence":"additional","affiliation":[{"name":"POSTECH, South Korea"}]},{"given":"Chuho","family":"Chang","sequence":"additional","affiliation":[{"name":"SAP Labs Korea"}]},{"given":"Kihong","family":"Kim","sequence":"additional","affiliation":[{"name":"SAP Labs Korea"}]}],"member":"320","published-online":{"date-parts":[[2020,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559877"},{"key":"e_1_2_1_3_1","first-page":"1033","volume-title":"VLDB conference","author":"Cha S. K.","year":"2004","unstructured":"S. K. Cha and C. Song. P*TIME: Highly scalable OLTP DBMS for managing update-intensive stream workload. In VLDB conference, pages 1033--1044, 2004."},{"key":"e_1_2_1_4_1","first-page":"354","volume-title":"VLDB conference","author":"Chaudhuri S.","year":"1994","unstructured":"S. Chaudhuri and K. Shim. Including group-by in query optimization. In VLDB conference, pages 354--366, 1994."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094114.2094126"},{"issue":"1","key":"e_1_2_1_6_1","first-page":"28","article-title":"The SAP HANA database - an architecture overview","volume":"35","author":"F\u00e4rber F.","year":"2012","unstructured":"F. F\u00e4rber, N. May, W. Lehner, P. Gro\u00dfe, I. M\u00fcller, H. Rauhe, and J. Dees. The SAP HANA database - an architecture overview. IEEE Data Eng. Bull., 35(1):28--33, 2012.","journal-title":"IEEE Data Eng. Bull."},{"issue":"3","key":"e_1_2_1_7_1","first-page":"19","article-title":"The cascades framework for query optimization","volume":"18","author":"Graefe G.","year":"1995","unstructured":"G. Graefe. The cascades framework for query optimization. IEEE Data Eng. Bull., 18(3):19--29, 1995.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1993.344061"},{"key":"e_1_2_1_9_1","first-page":"8271478","article-title":"Fast algorithms for computing semijoin reduction sequences","author":"Hill G.","year":"2012","unstructured":"G. Hill and T. Peh. Fast algorithms for computing semijoin reduction sequences. U.S. Patent 8271478, 2012.","journal-title":"U.S. Patent"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0110-5"},{"key":"e_1_2_1_11_1","first-page":"8880508","article-title":"Processing database queries using format conversion","author":"Jeong C.","year":"2014","unstructured":"C. Jeong, S. Hwang, S. K. Cha, and S. H. Wi. Processing database queries using format conversion. U.S. Patent 8880508, 2014.","journal-title":"U.S. Patent"},{"key":"e_1_2_1_12_1","first-page":"1165","volume-title":"IEEE ICDE conference","author":"Lee J.","year":"2013","unstructured":"J. Lee, Y. S. Kwon, F. F\u00e4rber, M. Muehle, C. Lee, C. Bensberg, J. Lee, A. H. Lee, and W. Lehner. SAP HANA distributed in-memory database system: Transaction, session, and metadata management. In IEEE ICDE conference, pages 1165--1173, 2013."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465314"},{"key":"e_1_2_1_14_1","first-page":"930","volume-title":"VLDB conference","author":"Moerkotte G.","year":"2006","unstructured":"G. Moerkotte and T. Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products. In VLDB conference, pages 930--941, 2006."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"e_1_2_1_16_1","first-page":"314","volume-title":"VLDB conference","author":"Ono K.","year":"1990","unstructured":"K. Ono and G. M. Lohman. Measuring the complexity of join enumeration in query optimization. In VLDB conference, pages 314--325, 1990."},{"key":"e_1_2_1_17_1","first-page":"306","volume-title":"VLDB conference","author":"Pellenkoft A.","year":"1997","unstructured":"A. Pellenkoft, C. A. Galindo-Legaria, and M. L. Kersten. The complexity of transformation-based join enumeration. In VLDB conference, pages 306--315, 1997."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335419"},{"key":"e_1_2_1_19_1","unstructured":"https:\/\/www.sap.com\/products\/s4hana-erp.html."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536251"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213946"},{"key":"e_1_2_1_22_1","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Snowflake_schema."},{"key":"e_1_2_1_23_1","first-page":"377","article-title":"Method for calculating distributed joins in main memory with minimal communication overhead","volume":"8","author":"Steinau O.","year":"2011","unstructured":"O. Steinau and J. Hartmann. Method for calculating distributed joins in main memory with minimal communication overhead. U.S. Patent 8 046 377, 2011.","journal-title":"U.S. Patent"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914872"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/22952.22955"},{"key":"e_1_2_1_26_1","first-page":"96","volume-title":"International Conference on Database Theory (ICDT)","author":"Veldhuizen T. L.","year":"2014","unstructured":"T. L. Veldhuizen. Triejoin: A simple, worst-case optimal join algorithm. In International Conference on Database Theory (ICDT), pages 96--106, 2014."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2008.61"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687671"},{"key":"e_1_2_1_29_1","first-page":"89","volume-title":"IEEE ICDE conference","author":"Yan W. P.","year":"1994","unstructured":"W. P. Yan and P. A. Larson. Performing group-by before join. In IEEE ICDE conference, pages 89--100, 1994."},{"key":"e_1_2_1_30_1","first-page":"345","volume-title":"VLDB conference","author":"Yan W. P.","year":"1995","unstructured":"W. P. Yan and P. A. Larson. Eager aggregation and lazy aggregation. In VLDB conference, pages 345--357, 1995."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3415478.3415531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T02:27:13Z","timestamp":1758076033000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3415478.3415531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":30,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["10.14778\/3415478.3415531"],"URL":"https:\/\/doi.org\/10.14778\/3415478.3415531","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2020,8]]}}}