{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T18:29:40Z","timestamp":1777055380012,"version":"3.51.4"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T00:00:00Z","timestamp":1666396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T00:00:00Z","timestamp":1666396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005713","name":"Technische Universit\u00e4t M\u00fcnchen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005713","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Groupjoins combine execution of a<jats:italic>join<\/jats:italic>and a subsequent<jats:italic>group-by<\/jats:italic>. They are common in analytical queries and occur in about \"Equation missing\"of the queries in TPC-H and TPC-DS. While they were originally invented to improve performance, efficient parallel execution of groupjoins can be limited by contention in many-core systems. Efficient implementations of groupjoins are highly desirable, as groupjoins are not only used to fuse group-by and join, but are also useful to efficiently execute nested aggregates. For these, the query optimizer needs to reason over the result of aggregation to optimally schedule it. Traditional systems quickly reach their limits of selectivity and cardinality estimations over computed columns and often treat group-by as an optimization barrier. In this paper, we present techniques to efficiently estimate, plan, and execute groupjoins and nested aggregates. We propose four novel techniques,<jats:italic>aggregate estimates<\/jats:italic>to predict the result distributions of aggregates,<jats:italic>parallel groupjoin execution<\/jats:italic>for scalable execution of groupjoins,<jats:italic>index groupjoins<\/jats:italic>, and a greedy<jats:italic>eager aggregation<\/jats:italic>optimization technique that introduces nested preaggregations to significantly improve execution plans. The resulting system has improved estimates, better execution plans, and a contention-free evaluation of groupjoins, which speeds up TPC-H and TPC-DS queries significantly.<\/jats:p>","DOI":"10.1007\/s00778-022-00765-x","type":"journal-article","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T21:03:21Z","timestamp":1666472601000},"page":"1165-1190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Practical planning and execution of groupjoin and nested aggregates"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9351-7118","authenticated-orcid":false,"given":"Philipp","family":"Fent","sequence":"first","affiliation":[]},{"given":"Altan","family":"Birler","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,22]]},"reference":[{"key":"765_CR1","first-page":"171","volume":"12","author":"A Azzalini","year":"1985","unstructured":"Azzalini, A.: A class of distributions which includes the normal ones. Scand. J. Stat. 12, 171\u2013178 (1985)","journal-title":"Scand. J. Stat."},{"key":"765_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139248891","volume-title":"The Skew-Normal and Related Families","author":"A Azzalini","year":"2013","unstructured":"Azzalini, A.: The Skew-Normal and Related Families, vol. 3. Cambridge University Press (2013)"},{"key":"765_CR3","doi-asserted-by":"crossref","unstructured":"Bandle, M., Giceva, J., Neumann, T.: To partition, or not to partition, that is the join question in a real system. In: SIGMOD, pp. 168\u2013180. ACM (2021)","DOI":"10.1145\/3448016.3452831"},{"key":"765_CR4","doi-asserted-by":"crossref","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. In: SIGFIDET Workshop, pp. 107\u2013141. ACM (1970)","DOI":"10.21236\/AD0712079"},{"key":"765_CR5","doi-asserted-by":"crossref","unstructured":"Beischl, A., Kersten, T., Bandle, M., Giceva, J., Neumann, T.: Profiling dataflow systems on multiple abstraction levels. In: EuroSys, pp. 474\u2013489. ACM (2021)","DOI":"10.1145\/3447786.3456254"},{"issue":"2","key":"765_CR6","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.14778\/1687553.1687563","volume":"2","author":"S Bellamkonda","year":"2009","unstructured":"Bellamkonda, S., Ahmed, R., Witkowski, A., Amor, A., Za\u00eft, M., Lin, C.C.: Enhanced subquery optimizations in Oracle. Proc. VLDB Endow. 2(2), 1366\u20131377 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"765_CR7","doi-asserted-by":"crossref","unstructured":"Birler, A., Radke, B., Neumann, T.: Concurrent online sampling for all, for free. In: DaMoN, pp. 5:1\u20135:8. ACM (2020)","DOI":"10.1145\/3399666.3399924"},{"key":"765_CR8","doi-asserted-by":"crossref","unstructured":"Boehm, H., Adve, S.V.: Foundations of the C++ concurrency memory model. In: PLDI, pp. 68\u201378. ACM (2008)","DOI":"10.1145\/1379022.1375591"},{"key":"765_CR9","doi-asserted-by":"crossref","unstructured":"Boncz, P.A., Anadiotis, A.G., Kl\u00e4be, S.: JCC-H: adding join crossing correlations with skew to TPC-H. In: TPCTC, Lecture Notes in Computer Science, vol. 10661, pp. 103\u2013119. Springer (2017)","DOI":"10.1007\/978-3-319-72401-0_8"},{"key":"765_CR10","doi-asserted-by":"crossref","unstructured":"Boncz, P.A., Neumann, T., Erling, O.: TPC-H analyzed: hidden messages and lessons learned from an influential benchmark. In: TPCTC, Lecture Notes in Computer Science, vol. 8391, pp. 61\u201376. Springer (2013)","DOI":"10.1007\/978-3-319-04936-6_5"},{"key":"765_CR11","unstructured":"Boncz, P.A., Zukowski, M., Nes, N.: MonetDB X100: Hyper-pipelining query execution. In: CIDR (2005)"},{"key":"765_CR12","doi-asserted-by":"crossref","unstructured":"Chatziantoniou, D., Akinde, M.O., Johnson, T., Kim, S.: The MD-join: an operator for complex OLAP. In: ICDE, pp. 524\u2013533. IEEE (2001)","DOI":"10.1109\/ICDE.2001.914866"},{"key":"765_CR13","unstructured":"Chaudhuri, S., Shim, K.: Including group-by in query optimization. In: VLDB, pp. 354\u2013366 (1994)"},{"key":"765_CR14","unstructured":"Cieslewicz, J., Ross, K.A.: Adaptive aggregation on chip multiprocessors. In: VLDB, pp. 339\u2013350. ACM (2007)"},{"key":"765_CR15","doi-asserted-by":"crossref","unstructured":"Cluet, S., Moerkotte, G.: Efficient evaluation of aggregates on bulk types. In: DBPL, Electronic Workshops in Computing, p.\u00a08. Springer (1995)","DOI":"10.14236\/ewic\/DBPL1995.6"},{"key":"765_CR16","doi-asserted-by":"crossref","unstructured":"Crotty, A., Galakatos, A., Kraska, T.: Getting swole: generating access-aware code with predicate pullups. In: ICDE, pp. 1273\u20131284. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00114"},{"key":"765_CR17","doi-asserted-by":"crossref","unstructured":"Dageville, B., Cruanes, T., Zukowski, M., Antonov, V., Avanes, A., Bock, J., Claybaugh, J., Engovatov, D., Hentschel, M., Huang, J., Lee, A.W., Motivala, A., Munir, A.Q., Pelley, S., Povinec, P., Rahn, G., Triantafyllis, S., Unterbrunner, P.: The Snowflake elastic data warehouse. In: SIGMOD, pp. 215\u2013226. ACM (2016)","DOI":"10.1145\/2882903.2903741"},{"key":"765_CR18","unstructured":"Dayal, U.: Of nests and trees: a unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In: VLDB, pp. 197\u2013208 (1987)"},{"key":"765_CR19","volume-title":"Extreme Value Theory: An Introduction","author":"L De Haan","year":"2007","unstructured":"De Haan, L., Ferreira, A.: Extreme Value Theory: An Introduction. Springer (2007)"},{"key":"765_CR20","doi-asserted-by":"crossref","unstructured":"Diaconu, C., Freedman, C., Ismert, E., Larson, P., Mittal, P., Stonecipher, R., Verma, N., Zwilling, M.: Hekaton: SQL server\u2019s memory-optimized OLTP engine. In: SIGMOD, pp. 1243\u20131254. ACM (2013)","DOI":"10.1145\/2463676.2463710"},{"issue":"8","key":"765_CR21","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.14778\/3389133.3389138","volume":"13","author":"M Dreseler","year":"2020","unstructured":"Dreseler, M., Boissier, M., Rabl, T., Uflacker, M.: Quantifying TPC-H choke points and their optimizations. Proc. VLDB Endow. 13(8), 1206\u20131220 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"765_CR22","doi-asserted-by":"crossref","unstructured":"Durner, D., Leis, V., Neumann, T.: On the impact of memory allocation on high-performance query processing. In: DaMoN, pp. 21:1\u201321:3. ACM (2019)","DOI":"10.1145\/3329785.3329918"},{"issue":"9","key":"765_CR23","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.14778\/3329772.3329780","volume":"12","author":"A Dutt","year":"2019","unstructured":"Dutt, A., Wang, C., Nazi, A., Kandula, S., Narasayya, V.R., Chaudhuri, S.: Selectivity estimation for range predicates using lightweight models. Proc. VLDB Endow. 12(9), 1044\u20131057 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"765_CR24","unstructured":"Eich, M.: Extending dynamic-programming-based plan generators: beyond pure enumeration. Ph.D. thesis, University of Mannheim, Germany (2017)"},{"issue":"5","key":"765_CR25","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s00778-017-0476-3","volume":"27","author":"M Eich","year":"2018","unstructured":"Eich, M., Fender, P., Moerkotte, G.: Efficient generation of query plans containing group-by, join, and groupjoin. VLDB J. 27(5), 617\u2013641 (2018)","journal-title":"VLDB J."},{"issue":"2","key":"765_CR26","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.14778\/1687553.1687556","volume":"2","author":"A El-Helw","year":"2009","unstructured":"El-Helw, A., Ilyas, I.F., Zuzarte, C.: StatAdvisor: recommending statistical views. Proc. VLDB Endow. 2(2), 1306\u20131317 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"765_CR27","doi-asserted-by":"crossref","unstructured":"Elhemali, M., Galindo-Legaria, C.A., Grabs, T., Joshi, M.: Execution strategies for SQL subqueries. In: SIGMOD, pp. 993\u20131004. ACM (2007)","DOI":"10.1145\/1247480.1247598"},{"key":"765_CR28","unstructured":"Freitag, M.J., Neumann, T.: Every row counts: combining sketches and sampling for accurate group-by result estimates. In: CIDR (2019)"},{"key":"765_CR29","doi-asserted-by":"crossref","unstructured":"Galindo-Legaria, C.A., Joshi, M.: Orthogonal optimization of subqueries and aggregation. In: SIGMOD, pp. 571\u2013581. ACM (2001)","DOI":"10.1145\/376284.375748"},{"key":"765_CR30","doi-asserted-by":"crossref","unstructured":"Graefe, G., Kuno, H.A.: Modern B-tree techniques. In: ICDE, pp. 1370\u20131373. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767956"},{"key":"765_CR31","doi-asserted-by":"crossref","unstructured":"Gray, J., Sundaresan, P., Englert, S., Baclawski, K., Weinberger, P.J.: Quickly generating billion-record synthetic databases. In: SIGMOD (1994)","DOI":"10.1145\/191839.191886"},{"key":"765_CR32","doi-asserted-by":"crossref","unstructured":"Grefen, P.W.P.J., de\u00a0By, R.A.: A multi-set extended relational algebra\u2014a formal approach to a practical issue. In: ICDE, pp. 80\u201388. IEEE (1994)","DOI":"10.1109\/ICDE.1994.283002"},{"key":"765_CR33","unstructured":"Gupta, A., Harinarayan, V., Quass, D.: Aggregate-query processing in data warehousing environments. In: VLDB, pp. 358\u2013369 (1995)"},{"key":"765_CR34","doi-asserted-by":"crossref","unstructured":"Hirn, D., Grust, T.: PgCuckoo: Laying plan eggs in PostgreSQL\u2019s nest. In: SIGMOD, pp. 1929\u20131932. ACM (2019)","DOI":"10.1145\/3299869.3320211"},{"key":"765_CR35","doi-asserted-by":"crossref","unstructured":"H\u00f6lsch, J., Grossniklaus, M., Scholl, M.H.: Optimization of nested queries using the NF2 algebra. In: SIGMOD, pp. 1765\u20131780. ACM (2016)","DOI":"10.1145\/2882903.2915241"},{"key":"765_CR36","unstructured":"Kemper, A., Kossmann, D., Wiesner, C.: Generalised hash teams for join and group-by. In: VLDB, pp. 30\u201341 (1999)"},{"key":"765_CR37","unstructured":"Kersten, M., Koutsourakis, P., Nes, N., Zhan, Y.: Bridging the chasm between science and reality. In: CIDR (2021)"},{"issue":"2","key":"765_CR38","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.14778\/1687553.1687564","volume":"2","author":"C Kim","year":"2009","unstructured":"Kim, C., Sedlar, E., Chhugani, J., Kaldewey, T., Nguyen, A.D., Blas, A.D., Lee, V.W., Satish, N., Dubey, P.: Sort versus hash revisited: fast join implementation on modern multi-core CPUs. Proc. VLDB Endow. 2(2), 1378\u20131389 (2009)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"765_CR39","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1145\/319732.319745","volume":"7","author":"W Kim","year":"1982","unstructured":"Kim, W.: On optimizing an SQL-like nested query. ACM Trans. Database Syst. 7(3), 443\u2013469 (1982)","journal-title":"ACM Trans. Database Syst."},{"key":"765_CR40","unstructured":"Kipf, A., Freitag, M., Vorona, D., Boncz, P., Neumann, T., Kemper, A.: Estimating filtered group-by queries is hard: Deep learning to the rescue. In: AIDB (2019)"},{"key":"765_CR41","unstructured":"Kipf, A., Kipf, T., Radke, B., Leis, V., Boncz, P.A., Kemper, A.: Learned cardinalities: Estimating correlated joins with deep learning. In: CIDR (2019)"},{"key":"765_CR42","doi-asserted-by":"crossref","unstructured":"Kohn, A., Leis, V., Neumann, T.: Building advanced SQL analytics from low-level plan operators. Proc. VLDB Endow. 14 (2021)","DOI":"10.1145\/3448016.3457288"},{"issue":"1","key":"765_CR43","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/352958.352982","volume":"25","author":"D Kossmann","year":"2000","unstructured":"Kossmann, D., Stocker, K.: Iterative dynamic programming: a new class of query optimization algorithms. ACM Trans. Database Syst. 25(1), 43\u201382 (2000)","journal-title":"ACM Trans. Database Syst."},{"key":"765_CR44","doi-asserted-by":"crossref","unstructured":"Lang, H., M\u00fchlbauer, T., Funke, F., Boncz, P.A., Neumann, T., Kemper, A.: Data blocks: hybrid OLTP and OLAP on compressed storage using both vectorization and compilation. In: SIGMOD, pp. 311\u2013326. ACM (2016)","DOI":"10.1145\/2882903.2882925"},{"key":"765_CR45","unstructured":"Larson, P.: Data reduction by partial preaggregation. In: ICDE, pp. 706\u2013715. IEEE (2002)"},{"key":"765_CR46","doi-asserted-by":"crossref","unstructured":"Leis, V., Boncz, P.A., Kemper, A., Neumann, T.: Morsel-driven parallelism: a NUMA-aware query evaluation framework for the many-core age. In: SIGMOD, pp. 743\u2013754. ACM (2014)","DOI":"10.1145\/2588555.2610507"},{"issue":"3","key":"765_CR47","doi-asserted-by":"publisher","first-page":"204","DOI":"10.14778\/2850583.2850594","volume":"9","author":"V Leis","year":"2015","unstructured":"Leis, V., Gubichev, A., Mirchev, A., Boncz, P.A., Kemper, A., Neumann, T.: How good are query optimizers, really? Proc. VLDB Endow. 9(3), 204\u2013215 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"765_CR48","doi-asserted-by":"crossref","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: ICDE, pp. 38\u201349. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544812"},{"issue":"5","key":"765_CR49","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00778-017-0480-7","volume":"27","author":"V Leis","year":"2018","unstructured":"Leis, V., Radke, B., Gubichev, A., Mirchev, A., Boncz, P.A., Kemper, A., Neumann, T.: Query optimization through the looking glass, and what we found running the join order benchmark. VLDB J. 27(5), 643\u2013668 (2018)","journal-title":"VLDB J."},{"key":"765_CR50","doi-asserted-by":"crossref","unstructured":"Leis, V., Scheibner, F., Kemper, A., Neumann, T.: The ART of practical synchronization. In: DaMoN, pp. 3:1\u20133:8. ACM (2016)","DOI":"10.1145\/2933349.2933352"},{"issue":"3","key":"765_CR51","doi-asserted-by":"publisher","first-page":"292","DOI":"10.14778\/3291264.3291273","volume":"12","author":"F Liu","year":"2018","unstructured":"Liu, F., Salmasi, A., Blanas, S., Sidiropoulos, A.: Chasing similarity: distribution-aware aggregation scheduling. Proc. VLDB Endow. 12(3), 292\u2013306 (2018)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"765_CR52","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s00778-017-0475-4","volume":"27","author":"D Makreshanski","year":"2018","unstructured":"Makreshanski, D., Giannikis, G., Alonso, G., Kossmann, D.: Many-query join: efficient shared execution of relational joins on modern hardware. VLDB J. 27(5), 669\u2013692 (2018)","journal-title":"VLDB J."},{"key":"765_CR53","doi-asserted-by":"crossref","unstructured":"May, N., Moerkotte, G.: Main memory implementations for binary grouping. In: XSym, Lecture Notes in Computer Science, vol. 3671, pp. 162\u2013176. Springer (2005)","DOI":"10.1007\/11547273_12"},{"issue":"1","key":"765_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/3151113.3151114","volume":"11","author":"P Menon","year":"2017","unstructured":"Menon, P., Pavlo, A., Mowry, T.C.: Relaxed operator fusion for in-memory databases: making compilation, vectorization, and prefetching work together at last. Proc. VLDB Endow. 11(1), 1\u201313 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"765_CR55","doi-asserted-by":"crossref","unstructured":"Moerkotte, G., Neumann, T.: Faster join enumeration for complex queries. In: ICDE, pp. 1430\u20131432. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497579"},{"issue":"11","key":"765_CR56","first-page":"843","volume":"4","author":"G Moerkotte","year":"2011","unstructured":"Moerkotte, G., Neumann, T.: Accelerating queries with group-by and join by groupjoin. PVLDB 4(11), 843\u2013851 (2011)","journal-title":"PVLDB"},{"issue":"1","key":"765_CR57","doi-asserted-by":"publisher","first-page":"982","DOI":"10.14778\/1687627.1687738","volume":"2","author":"G Moerkotte","year":"2009","unstructured":"Moerkotte, G., Neumann, T., Steidl, G.: Preventing bad plans by bounding the impact of cardinality estimation errors. Proc. VLDB Endow. 2(1), 982\u2013993 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"765_CR58","unstructured":"Muralikrishna, M.: Improved unnesting algorithms for join aggregate SQL queries. In: VLDB, pp. 91\u2013102 (1992)"},{"key":"765_CR59","unstructured":"Nambiar, R.O., Poess, M.: The making of TPC-DS. In: VLDB, pp. 1049\u20131058. ACM (2006)"},{"issue":"9","key":"765_CR60","doi-asserted-by":"publisher","first-page":"539","DOI":"10.14778\/2002938.2002940","volume":"4","author":"T Neumann","year":"2011","unstructured":"Neumann, T.: Efficiently compiling efficient query plans for modern hardware. Proc. VLDB Endow. 4(9), 539\u2013550 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"765_CR61","unstructured":"Neumann, T., Freitag, M.J.: Umbra: a disk-based system with in-memory performance. In: CIDR (2020)"},{"key":"765_CR62","unstructured":"Neumann, T., Kemper, A.: Unnesting arbitrary queries. In: BTW, LNI, vol. P-241, pp. 383\u2013402. GI (2015)"},{"key":"765_CR63","unstructured":"Neumann, T., Leis, V., Kemper, A.: The complete story of joins (in HyPer). In: BTW, LNI, vol. P-265, pp. 31\u201350. GI (2017)"},{"key":"765_CR64","doi-asserted-by":"crossref","unstructured":"Neumann, T., Radke, B.: Adaptive optimization of very large join queries. In: SIGMOD, pp. 677\u2013692. ACM (2018)","DOI":"10.1145\/3183713.3183733"},{"key":"765_CR65","doi-asserted-by":"crossref","unstructured":"O\u2019Neill, M., Vaziripour, E., Wu, J., Zappala, D.: Condensing Steam: Distilling the diversity of gamer behavior. In: Internet Measurement Conference, pp. 81\u201395. ACM (2016)","DOI":"10.1145\/2987443.2987489"},{"issue":"7","key":"765_CR66","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1080\/02664760050120542","volume":"27","author":"A Pewsey","year":"2000","unstructured":"Pewsey, A.: Problems of inference for Azzalini\u2019s skewnormal distribution. J. Appl. Stat. 27(7), 859\u2013870 (2000)","journal-title":"J. Appl. Stat."},{"key":"765_CR67","doi-asserted-by":"crossref","unstructured":"Polychroniou, O., Ross, K.A.: High throughput heavy hitter aggregation for modern SIMD processors. In: DaMoN, p.\u00a06. ACM (2013)","DOI":"10.1145\/2485278.2485284"},{"key":"765_CR68","unstructured":"Radke, B., Neumann, T.: LinDP++: generalizing linearized DP to crossproducts and non-inner joins. In: BTW, LNI, vol. P-289, pp. 57\u201376. GI (2019)"},{"key":"765_CR69","doi-asserted-by":"crossref","unstructured":"Raman, V., Attaluri, G.K., Barber, R., Chainani, N., Kalmuk, D., KulandaiSamy, V., Leenstra, J., Lightstone, S., Liu, S., Lohman, G.M., Malkemus, T., M\u00fcller, R., Pandis, I., Schiefer, B., Sharpe, D., Sidle, R., Storm, A.J., Zhang, L.: DB2 with BLU acceleration: so much more than just a column store. Proc. VLDB Endow. 6(11), 1080\u20131091 (2013)","DOI":"10.14778\/2536222.2536233"},{"key":"765_CR70","doi-asserted-by":"crossref","unstructured":"Schleich, M., Olteanu, D., Khamis, M.A., Ngo, H.Q., Nguyen, X.: A layered aggregate engine for analytics workloads. In: SIGMOD, pp. 1642\u20131659. ACM (2019)","DOI":"10.1145\/3299869.3324961"},{"key":"765_CR71","doi-asserted-by":"crossref","unstructured":"Schuh, S., Chen, X., Dittrich, J.: An experimental comparison of thirteen relational equi-joins in main memory. In: SIGMOD, pp. 1961\u20131976. ACM (2016)","DOI":"10.1145\/2882903.2882917"},{"key":"765_CR72","doi-asserted-by":"crossref","unstructured":"Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: SIGMOD, pp. 23\u201334. ACM (1979)","DOI":"10.1145\/582095.582099"},{"key":"765_CR73","doi-asserted-by":"crossref","unstructured":"Seshadri, P., Hellerstein, J.M., Pirahesh, H., Leung, T.Y.C., Ramakrishnan, R., Srivastava, D., Stuckey, P.J., Sudarshan, S.: Cost-based optimization for magic: algebra and implementation. In: SIGMOD, pp. 435\u2013446. ACM Press (1996)","DOI":"10.1145\/235968.233360"},{"key":"765_CR74","unstructured":"Steenhagen, H.J.: Optimization of object query languages. Ph.D. thesis, University of Twente (1995)"},{"key":"765_CR75","unstructured":"Stocker, K., Kossmann, D., Braumandl, R., Kemper, A.: Integrating semi-join-reducers into state of the art query processors. In: ICDE, pp. 575\u2013584. IEEE (2001)"},{"key":"765_CR76","doi-asserted-by":"crossref","unstructured":"Stonebraker, M., Rowe, L.A.: The design of Postgres. In: SIGMOD, pp. 340\u2013355. ACM Press (1986)","DOI":"10.1145\/16856.16888"},{"key":"765_CR77","doi-asserted-by":"crossref","unstructured":"Vogelsgesang, A., Haubenschild, M., Finis, J., Kemper, A., Leis, V., M\u00fchlbauer, T., Neumann, T., Then, M.: Get real: how benchmarks fail to represent the real world. In: DBTest@SIGMOD, pp. 1:1\u20131:6. ACM (2018)","DOI":"10.1145\/3209950.3209952"},{"key":"765_CR78","unstructured":"Yan, W.P., Larson, P.: Performing group-by before join. In: ICDE, pp. 89\u2013100. IEEE (1994)"},{"key":"765_CR79","unstructured":"Yan, W.P., Larson, P.: Eager aggregation and lazy aggregation. In: VLDB, pp. 345\u2013357 (1995)"},{"key":"765_CR80","unstructured":"Zhang, Z., Deshmukh, H., Patel, J.M.: Data partitioning for in-memory systems: myths, challenges, and opportunities. In: CIDR (2019)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00765-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-022-00765-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00765-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T10:43:22Z","timestamp":1728211402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-022-00765-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,22]]},"references-count":80,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["765"],"URL":"https:\/\/doi.org\/10.1007\/s00778-022-00765-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,22]]},"assertion":[{"value":"1 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}