Practical planning and execution of groupjoin and nested aggregates

Groupjoins combine execution of a join and a subsequent group-by . They are common in analytical queries and occur in about 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-...

Full description

Saved in:

Bibliographic Details
Published in:	The VLDB journal Vol. 32; no. 6; pp. 1165 - 1190
Main Authors:	Fent, Philipp, Birler, Altan, Neumann, Thomas
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2023 Springer Nature B.V
Subjects:	Aggregates Algorithms Computer Science Database Management Estimates Optimization Queries Semantics Special Issue Paper Query processing Parallel processing Query optimization
ISSN:	1066-8888, 0949-877X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Groupjoins combine execution of a join and a subsequent group-by . They are common in analytical queries and occur in about 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, aggregate estimates to predict the result distributions of aggregates, parallel groupjoin execution for scalable execution of groupjoins, index groupjoins , and a greedy eager aggregation 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.
AbstractList	Groupjoins combine execution of a join and a subsequent group-by. They are common in analytical queries and occur in about 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, aggregate estimates to predict the result distributions of aggregates, parallel groupjoin execution for scalable execution of groupjoins, index groupjoins, and a greedy eager aggregation 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. Groupjoins combine execution of a join and a subsequent group-by . They are common in analytical queries and occur in about 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, aggregate estimates to predict the result distributions of aggregates, parallel groupjoin execution for scalable execution of groupjoins, index groupjoins , and a greedy eager aggregation 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. Groupjoins combine execution of a join and a subsequent group-by . 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, aggregate estimates to predict the result distributions of aggregates, parallel groupjoin execution for scalable execution of groupjoins, index groupjoins , and a greedy eager aggregation 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.
Author	Neumann, Thomas Birler, Altan Fent, Philipp
Author_xml	– sequence: 1 givenname: Philipp orcidid: 0000-0002-9351-7118 surname: Fent fullname: Fent, Philipp email: fent@in.tum.de organization: Technische Universität München – sequence: 2 givenname: Altan surname: Birler fullname: Birler, Altan organization: Technische Universität München – sequence: 3 givenname: Thomas surname: Neumann fullname: Neumann, Thomas organization: Technische Universität München
BookMark	eNp9kE1LAzEQhoNUsK3-AU8LnqP52N1sjlL8goIeFLyFaXaybKnJmmyh_ntjV_DmHGYG5n1nhmdBZj54JOSSs2vOmLpJOamGMiFo7uqKHk7InOlS00ap9xmZc1bXtMlxRhYpbRnLUlHNyeolgh17C7ti2IH3ve8K8G2BB7T7sQ--CK7oYtgP29D748hjGrEtoOsidjBiOienDnYJL37rkrzd372uHun6-eFpdbumVvJypLZ2lUOQrQDOEQCaFrRuld6UdmMV1xYrpaB0XCPTVlRKo5KsdHXlWimUXJKrae8Qw-c-f2G2YR99PmmkqGqluJR1VolJZWNIKaIzQ-w_IH4ZzswPLDPBMpmAOcIyh2ySkyllse8w_q3-x_UNqRFv8Q
Cites_doi	10.14778/3151113.3151114 10.14778/3291264.3291273 10.14778/3389133.3389138 10.1145/319732.319745 10.14778/3329772.3329780 10.14778/2850583.2850594 10.1080/02664760050120542 10.1017/CBO9781139248891 10.14778/1687553.1687564 10.14778/1687553.1687556 10.14778/1687627.1687738 10.1007/s00778-017-0475-4 10.1007/s00778-017-0476-3 10.14778/2002938.2002940 10.1145/352958.352982 10.14778/1687553.1687563 10.1007/s00778-017-0480-7 10.1145/2463676.2463710 10.1145/3329785.3329918 10.1145/1247480.1247598 10.1145/1379022.1375591 10.1145/3448016.3457288 10.14236/ewic/DBPL1995.6 10.1145/2588555.2610507 10.1109/ICDE.2008.4497579 10.1109/ICDE.2001.914866 10.1109/ICDE.2011.5767956 10.1145/2882903.2882917 10.1145/3183713.3183733 10.1145/3399666.3399924 10.1145/2882903.2903741 10.1109/ICDE48307.2020.00114 10.1007/11547273_12 10.1145/3447786.3456254 10.1145/376284.375748 10.1145/2485278.2485284 10.1145/3299869.3320211 10.1145/3209950.3209952 10.1145/16856.16888 10.21236/AD0712079 10.1007/978-3-319-72401-0_8 10.1145/191839.191886 10.1145/2987443.2987489 10.1145/3299869.3324961 10.1109/ICDE.1994.283002 10.1145/582095.582099 10.1145/235968.233360 10.1109/ICDE.2013.6544812 10.14778/2536222.2536233 10.1145/3448016.3452831 10.1145/2882903.2915241 10.1145/2882903.2882925 10.1007/978-3-319-04936-6_5 10.1145/2933349.2933352
ContentType	Journal Article
Copyright	The Author(s) 2022 The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: The Author(s) 2022 – notice: The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	C6C AAYXX CITATION 8FE 8FG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS
DOI	10.1007/s00778-022-00765-x
DatabaseName	Springer Nature OA Free Journals CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Database Suite (ProQuest) Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China
DatabaseTitle	CrossRef Advanced Technologies & Aerospace Collection Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central Advanced Technologies & Aerospace Database ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New)
DatabaseTitleList	Advanced Technologies & Aerospace Collection CrossRef
Database_xml	– sequence: 1 dbid: P5Z name: Advanced Technologies & Aerospace Database url: https://search.proquest.com/hightechjournals sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	0949-877X
EndPage	1190
ExternalDocumentID	10_1007_s00778_022_00765_x
GrantInformation_xml	– fundername: Technische Universität München (1025)
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 123 1N0 1SB 2.D 203 29R 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 3-Y 30V 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AAKMM AALFJ AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAWTV AAYFX AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACM ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADL ADQRH ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEBYY AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AENSD AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWIH AFWTZ AFWXC AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS C6C CAG CCLIF COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GUFHI GXS H13 HF~ HG5 HG6 HGAVV HMJXF HQYDN HRMNR HVGLF HZ~ I07 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LHSKQ LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P0- P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VXZ W23 W48 W7O WK8 YLTOR YZZ Z45 Z7R Z7X Z83 Z88 Z8M Z8R Z8W Z92 ZMTXR ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEFXT AEJOY AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP AKRVB ARAPS ATHPR AYFIA BENPR BGLVJ CCPQU CITATION HCIFZ K7- PHGZM PHGZT PQGLB 8FE 8FG AZQEC DWQXO GNUQQ JQ2 P62 PKEHL PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c314t-c6f5fea3d2a11eaaa8da99d79b4cbc719ce577a4f19e09c2579e7304f65fd3273
IEDL.DBID	P5Z
ISICitedReferencesCount	3
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000871177600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1066-8888
IngestDate	Sun Nov 30 04:08:46 EST 2025 Sat Nov 29 03:17:18 EST 2025 Fri Feb 21 02:43:08 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	false
IsScholarly	true
Issue	6
Keywords	Query processing Parallel processing Query optimization
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c314t-c6f5fea3d2a11eaaa8da99d79b4cbc719ce577a4f19e09c2579e7304f65fd3273
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-9351-7118
OpenAccessLink	https://link.springer.com/10.1007/s00778-022-00765-x
PQID	3256771336
PQPubID	2043708
PageCount	26
ParticipantIDs	proquest_journals_3256771336 crossref_primary_10_1007_s00778_022_00765_x springer_journals_10_1007_s00778_022_00765_x
PublicationCentury	2000
PublicationDate	20231100 2023-11-00 20231101
PublicationDateYYYYMMDD	2023-11-01
PublicationDate_xml	– month: 11 year: 2023 text: 20231100
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: New York
PublicationSubtitle	The International Journal on Very Large Data Bases
PublicationTitle	The VLDB journal
PublicationTitleAbbrev	The VLDB Journal
PublicationYear	2023
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	De Haan, Ferreira (CR19) 2007 CR37 CR36 Neumann (CR60) 2011; 4 CR35 CR79 Azzalini (CR2) 2013 CR34 CR78 CR33 CR77 CR32 CR76 CR31 CR75 CR30 CR74 CR73 CR72 CR71 Bellamkonda, Ahmed, Witkowski, Amor, Zaït, Lin (CR6) 2009; 2 CR70 Liu, Salmasi, Blanas, Sidiropoulos (CR51) 2018; 12 CR4 CR3 Leis, Radke, Gubichev, Mirchev, Boncz, Kemper, Neumann (CR49) 2018; 27 Azzalini (CR1) 1985; 12 CR5 CR8 CR7 CR9 CR48 CR46 Dutt, Wang, Nazi, Kandula, Narasayya, Chaudhuri (CR23) 2019; 12 CR45 CR44 CR42 CR41 CR40 Kossmann, Stocker (CR43) 2000; 25 CR80 Eich, Fender, Moerkotte (CR25) 2018; 27 CR18 CR17 CR16 CR15 CR59 CR14 Moerkotte, Neumann (CR56) 2011; 4 CR58 CR13 CR12 CR11 CR55 CR10 Makreshanski, Giannikis, Alonso, Kossmann (CR52) 2018; 27 Leis, Gubichev, Mirchev, Boncz, Kemper, Neumann (CR47) 2015; 9 CR53 CR50 Menon, Pavlo, Mowry (CR54) 2017; 11 Pewsey (CR66) 2000; 27 Dreseler, Boissier, Rabl, Uflacker (CR21) 2020; 13 CR29 CR28 CR27 Kim, Sedlar, Chhugani, Kaldewey, Nguyen, Blas, Lee, Satish, Dubey (CR38) 2009; 2 El-Helw, Ilyas, Zuzarte (CR26) 2009; 2 CR69 CR24 CR68 CR67 CR22 CR65 CR20 CR64 CR63 CR62 CR61 Moerkotte, Neumann, Steidl (CR57) 2009; 2 Kim (CR39) 1982; 7 765_CR15 765_CR59 765_CR16 765_CR17 765_CR18 765_CR11 765_CR55 765_CR12 765_CR13 765_CR14 765_CR58 D Makreshanski (765_CR52) 2018; 27 765_CR53 765_CR10 765_CR50 W Kim (765_CR39) 1982; 7 765_CR9 G Moerkotte (765_CR56) 2011; 4 765_CR8 765_CR48 P Menon (765_CR54) 2017; 11 F Liu (765_CR51) 2018; 12 765_CR44 765_CR45 765_CR46 765_CR3 765_CR40 765_CR41 V Leis (765_CR47) 2015; 9 765_CR42 V Leis (765_CR49) 2018; 27 765_CR7 765_CR80 M Dreseler (765_CR21) 2020; 13 765_CR5 765_CR4 D Kossmann (765_CR43) 2000; 25 765_CR37 A Azzalini (765_CR1) 1985; 12 765_CR33 765_CR77 765_CR34 G Moerkotte (765_CR57) 2009; 2 765_CR78 L De Haan (765_CR19) 2007 765_CR35 765_CR79 A Dutt (765_CR23) 2019; 12 765_CR36 765_CR73 765_CR30 765_CR74 765_CR31 765_CR75 765_CR32 T Neumann (765_CR60) 2011; 4 765_CR76 765_CR70 A El-Helw (765_CR26) 2009; 2 765_CR71 765_CR72 A Azzalini (765_CR2) 2013 A Pewsey (765_CR66) 2000; 27 765_CR27 765_CR28 765_CR29 765_CR22 765_CR67 765_CR24 765_CR68 765_CR69 C Kim (765_CR38) 2009; 2 765_CR62 765_CR63 765_CR20 765_CR64 765_CR65 765_CR61 S Bellamkonda (765_CR6) 2009; 2 M Eich (765_CR25) 2018; 27
References_xml	– ident: CR45 – ident: CR70 – ident: CR22 – volume: 11 start-page: 1 issue: 1 year: 2017 end-page: 13 ident: CR54 article-title: Relaxed operator fusion for in-memory databases: making compilation, vectorization, and prefetching work together at last publication-title: Proc. VLDB Endow. doi: 10.14778/3151113.3151114 – ident: CR68 – ident: CR74 – ident: CR4 – ident: CR16 – ident: CR12 – volume: 12 start-page: 292 issue: 3 year: 2018 end-page: 306 ident: CR51 article-title: Chasing similarity: distribution-aware aggregation scheduling publication-title: Proc. VLDB Endow. doi: 10.14778/3291264.3291273 – volume: 13 start-page: 1206 issue: 8 year: 2020 end-page: 1220 ident: CR21 article-title: Quantifying TPC-H choke points and their optimizations publication-title: Proc. VLDB Endow. doi: 10.14778/3389133.3389138 – ident: CR35 – ident: CR29 – ident: CR61 – ident: CR80 – ident: CR77 – ident: CR8 – ident: CR58 – ident: CR42 – volume: 7 start-page: 443 issue: 3 year: 1982 end-page: 469 ident: CR39 article-title: On optimizing an SQL-like nested query publication-title: ACM Trans. Database Syst. doi: 10.1145/319732.319745 – ident: CR46 – ident: CR71 – ident: CR67 – ident: CR75 – ident: CR15 – volume: 12 start-page: 1044 issue: 9 year: 2019 end-page: 1057 ident: CR23 article-title: Selectivity estimation for range predicates using lightweight models publication-title: Proc. VLDB Endow. doi: 10.14778/3329772.3329780 – ident: CR50 – volume: 12 start-page: 171 year: 1985 end-page: 178 ident: CR1 article-title: A class of distributions which includes the normal ones publication-title: Scand. J. Stat. – ident: CR11 – ident: CR9 – ident: CR32 – ident: CR36 – ident: CR78 – volume: 9 start-page: 204 issue: 3 year: 2015 end-page: 215 ident: CR47 article-title: How good are query optimizers, really? publication-title: Proc. VLDB Endow. doi: 10.14778/2850583.2850594 – volume: 27 start-page: 859 issue: 7 year: 2000 end-page: 870 ident: CR66 article-title: Problems of inference for Azzalini’s skewnormal distribution publication-title: J. Appl. Stat. doi: 10.1080/02664760050120542 – ident: CR5 – ident: CR64 – year: 2013 ident: CR2 publication-title: The Skew-Normal and Related Families doi: 10.1017/CBO9781139248891 – ident: CR18 – volume: 2 start-page: 1378 issue: 2 year: 2009 end-page: 1389 ident: CR38 article-title: Sort versus hash revisited: fast join implementation on modern multi-core CPUs publication-title: Proc. VLDB Endow. doi: 10.14778/1687553.1687564 – ident: CR72 – ident: CR14 – volume: 2 start-page: 1306 issue: 2 year: 2009 end-page: 1317 ident: CR26 article-title: StatAdvisor: recommending statistical views publication-title: Proc. VLDB Endow. doi: 10.14778/1687553.1687556 – volume: 2 start-page: 982 issue: 1 year: 2009 end-page: 993 ident: CR57 article-title: Preventing bad plans by bounding the impact of cardinality estimation errors publication-title: Proc. VLDB Endow. doi: 10.14778/1687627.1687738 – ident: CR37 – ident: CR53 – ident: CR30 – ident: CR10 – ident: CR33 – ident: CR79 – year: 2007 ident: CR19 publication-title: Extreme Value Theory: An Introduction – ident: CR40 – ident: CR63 – ident: CR27 – volume: 27 start-page: 669 issue: 5 year: 2018 end-page: 692 ident: CR52 article-title: Many-query join: efficient shared execution of relational joins on modern hardware publication-title: VLDB J. doi: 10.1007/s00778-017-0475-4 – ident: CR69 – volume: 27 start-page: 617 issue: 5 year: 2018 end-page: 641 ident: CR25 article-title: Efficient generation of query plans containing group-by, join, and groupjoin publication-title: VLDB J. doi: 10.1007/s00778-017-0476-3 – volume: 4 start-page: 539 issue: 9 year: 2011 end-page: 550 ident: CR60 article-title: Efficiently compiling efficient query plans for modern hardware publication-title: Proc. VLDB Endow. doi: 10.14778/2002938.2002940 – ident: CR44 – ident: CR48 – ident: CR73 – volume: 25 start-page: 43 issue: 1 year: 2000 end-page: 82 ident: CR43 article-title: Iterative dynamic programming: a new class of query optimization algorithms publication-title: ACM Trans. Database Syst. doi: 10.1145/352958.352982 – ident: CR65 – ident: CR3 – volume: 2 start-page: 1366 issue: 2 year: 2009 end-page: 1377 ident: CR6 article-title: Enhanced subquery optimizations in Oracle publication-title: Proc. VLDB Endow. doi: 10.14778/1687553.1687563 – ident: CR17 – ident: CR31 – ident: CR13 – volume: 27 start-page: 643 issue: 5 year: 2018 end-page: 668 ident: CR49 article-title: Query optimization through the looking glass, and what we found running the join order benchmark publication-title: VLDB J. doi: 10.1007/s00778-017-0480-7 – ident: CR34 – ident: CR55 – ident: CR7 – volume: 4 start-page: 843 issue: 11 year: 2011 end-page: 851 ident: CR56 article-title: Accelerating queries with group-by and join by groupjoin publication-title: PVLDB – ident: CR59 – ident: CR76 – ident: CR28 – ident: CR41 – ident: CR62 – ident: CR24 – ident: CR20 – ident: 765_CR20 doi: 10.1145/2463676.2463710 – ident: 765_CR75 – ident: 765_CR22 doi: 10.1145/3329785.3329918 – ident: 765_CR27 doi: 10.1145/1247480.1247598 – ident: 765_CR79 – ident: 765_CR8 doi: 10.1145/1379022.1375591 – ident: 765_CR42 doi: 10.1145/3448016.3457288 – ident: 765_CR14 – ident: 765_CR15 doi: 10.14236/ewic/DBPL1995.6 – ident: 765_CR37 – ident: 765_CR33 – ident: 765_CR46 doi: 10.1145/2588555.2610507 – volume: 2 start-page: 1306 issue: 2 year: 2009 ident: 765_CR26 publication-title: Proc. VLDB Endow. doi: 10.14778/1687553.1687556 – ident: 765_CR55 doi: 10.1109/ICDE.2008.4497579 – volume: 12 start-page: 292 issue: 3 year: 2018 ident: 765_CR51 publication-title: Proc. VLDB Endow. doi: 10.14778/3291264.3291273 – volume: 11 start-page: 1 issue: 1 year: 2017 ident: 765_CR54 publication-title: Proc. VLDB Endow. doi: 10.14778/3151113.3151114 – volume: 27 start-page: 617 issue: 5 year: 2018 ident: 765_CR25 publication-title: VLDB J. doi: 10.1007/s00778-017-0476-3 – volume: 12 start-page: 1044 issue: 9 year: 2019 ident: 765_CR23 publication-title: Proc. VLDB Endow. doi: 10.14778/3329772.3329780 – ident: 765_CR12 doi: 10.1109/ICDE.2001.914866 – ident: 765_CR30 doi: 10.1109/ICDE.2011.5767956 – ident: 765_CR61 – volume-title: Extreme Value Theory: An Introduction year: 2007 ident: 765_CR19 – volume: 7 start-page: 443 issue: 3 year: 1982 ident: 765_CR39 publication-title: ACM Trans. Database Syst. doi: 10.1145/319732.319745 – ident: 765_CR71 doi: 10.1145/2882903.2882917 – ident: 765_CR28 – ident: 765_CR64 doi: 10.1145/3183713.3183733 – ident: 765_CR7 doi: 10.1145/3399666.3399924 – volume: 2 start-page: 982 issue: 1 year: 2009 ident: 765_CR57 publication-title: Proc. VLDB Endow. doi: 10.14778/1687627.1687738 – ident: 765_CR17 doi: 10.1145/2882903.2903741 – ident: 765_CR59 – ident: 765_CR13 – ident: 765_CR16 doi: 10.1109/ICDE48307.2020.00114 – ident: 765_CR18 – volume: 2 start-page: 1378 issue: 2 year: 2009 ident: 765_CR38 publication-title: Proc. VLDB Endow. doi: 10.14778/1687553.1687564 – ident: 765_CR53 doi: 10.1007/11547273_12 – ident: 765_CR5 doi: 10.1145/3447786.3456254 – volume: 2 start-page: 1366 issue: 2 year: 2009 ident: 765_CR6 publication-title: Proc. VLDB Endow. doi: 10.14778/1687553.1687563 – volume-title: The Skew-Normal and Related Families year: 2013 ident: 765_CR2 doi: 10.1017/CBO9781139248891 – ident: 765_CR29 doi: 10.1145/376284.375748 – ident: 765_CR67 doi: 10.1145/2485278.2485284 – ident: 765_CR34 doi: 10.1145/3299869.3320211 – ident: 765_CR77 doi: 10.1145/3209950.3209952 – volume: 9 start-page: 204 issue: 3 year: 2015 ident: 765_CR47 publication-title: Proc. VLDB Endow. doi: 10.14778/2850583.2850594 – volume: 25 start-page: 43 issue: 1 year: 2000 ident: 765_CR43 publication-title: ACM Trans. Database Syst. doi: 10.1145/352958.352982 – ident: 765_CR45 – ident: 765_CR62 – ident: 765_CR76 doi: 10.1145/16856.16888 – ident: 765_CR4 doi: 10.21236/AD0712079 – ident: 765_CR24 – ident: 765_CR41 – volume: 4 start-page: 539 issue: 9 year: 2011 ident: 765_CR60 publication-title: Proc. VLDB Endow. doi: 10.14778/2002938.2002940 – ident: 765_CR9 doi: 10.1007/978-3-319-72401-0_8 – volume: 27 start-page: 859 issue: 7 year: 2000 ident: 765_CR66 publication-title: J. Appl. Stat. doi: 10.1080/02664760050120542 – ident: 765_CR58 – ident: 765_CR31 doi: 10.1145/191839.191886 – ident: 765_CR65 doi: 10.1145/2987443.2987489 – volume: 13 start-page: 1206 issue: 8 year: 2020 ident: 765_CR21 publication-title: Proc. VLDB Endow. doi: 10.14778/3389133.3389138 – volume: 27 start-page: 643 issue: 5 year: 2018 ident: 765_CR49 publication-title: VLDB J. doi: 10.1007/s00778-017-0480-7 – ident: 765_CR70 doi: 10.1145/3299869.3324961 – ident: 765_CR63 – ident: 765_CR40 – volume: 12 start-page: 171 year: 1985 ident: 765_CR1 publication-title: Scand. J. Stat. – ident: 765_CR32 doi: 10.1109/ICDE.1994.283002 – volume: 27 start-page: 669 issue: 5 year: 2018 ident: 765_CR52 publication-title: VLDB J. doi: 10.1007/s00778-017-0475-4 – ident: 765_CR78 – ident: 765_CR80 – ident: 765_CR72 doi: 10.1145/582095.582099 – volume: 4 start-page: 843 issue: 11 year: 2011 ident: 765_CR56 publication-title: PVLDB – ident: 765_CR11 – ident: 765_CR73 doi: 10.1145/235968.233360 – ident: 765_CR48 doi: 10.1109/ICDE.2013.6544812 – ident: 765_CR74 – ident: 765_CR69 doi: 10.14778/2536222.2536233 – ident: 765_CR36 – ident: 765_CR3 doi: 10.1145/3448016.3452831 – ident: 765_CR68 – ident: 765_CR35 doi: 10.1145/2882903.2915241 – ident: 765_CR44 doi: 10.1145/2882903.2882925 – ident: 765_CR10 doi: 10.1007/978-3-319-04936-6_5 – ident: 765_CR50 doi: 10.1145/2933349.2933352
SSID	ssj0002225
Score	2.4042282
Snippet	Groupjoins combine execution of a join and a subsequent group-by . They are common in analytical queries and occur in about of the queries in TPC-H and TPC-DS.... Groupjoins combine execution of a join and a subsequent group-by . They are common in analytical queries and occur in about "Equation missing" of the queries... Groupjoins combine execution of a join and a subsequent group-by. They are common in analytical queries and occur in about of the queries in TPC-H and TPC-DS....
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	1165
SubjectTerms	Aggregates Algorithms Computer Science Database Management Estimates Optimization Queries Semantics Special Issue Paper
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6hwsBCeYpCQR7YwFKT-BGPqKJiQBXiUXWLHD9QGdKqaVF_PraTtALBALMtK_l857vz-b4DuEpjzVSSa8x07gKUiBgs8phjHmtlRZRLHciqRw98OEzHY_FYF4WVzWv3JiUZTup1sZtnnkmxf33u00cUO89x25m71DdseHoerc9fH8GEHCdj2MV3aV0q8_MaX83Rxsf8lhYN1mbQ_t937sNe7V2i20ocDmDLFIfQbjo3oFqRj6Bf0RS5_UGzumsRkoVGZmVUkEQ0tSgUfLxPJ0UYKsLFKJJvLkD3V2_lMbwO7l7697hup4BVEpEFVsxSa2SiYxlFRkqZaimE5iInKlc8EspQziWxkTA9oZwuC-P0n1hGrU6cm3MCrWJamFNA7g8NlYllinjCNS01kb2caqKooDqRHbhuUM1mFWtGtuZHDvhkDp8s4JOtOtBtgM9qDSqzxPli3EfQrAM3DdCb4d9XO_vb9HPY9R3kq_LCLrQW86W5gB31sZiU88sgWZ8JBMpC priority: 102 providerName: Springer Nature
Title	Practical planning and execution of groupjoin and nested aggregates
URI	https://link.springer.com/article/10.1007/s00778-022-00765-x https://www.proquest.com/docview/3256771336
Volume	32
WOSCitedRecordID	wos000871177600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 0949-877X dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0002225 issn: 1066-8888 databaseCode: P5Z dateStart: 20230101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 0949-877X dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0002225 issn: 1066-8888 databaseCode: K7- dateStart: 20230101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 0949-877X dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0002225 issn: 1066-8888 databaseCode: BENPR dateStart: 20230101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 0949-877X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002225 issn: 1066-8888 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LTwIxEJ4IePAiPiOKpAdv2sg-ut2ejBKMiYYQVEK8bLpt1-BhFwENP9-2dCGa6MXLXpo0m5npdB6d7wM4i30ZiSCVOJKpTlC8UGGW-hRTX4qMeSmXFqx6-EB7vXg0Yn1XcJu5Z5WlT7SOWhbC1MgvA303U5NRRVeTd2xYo0x31VFoVKBmUBIMdUOfvKw8scllbLczirDO9GI3NGNH5wyOTYzNW3bTjCJ48f1iWkebPxqk9t65rf_3j3dg20Wc6HppIruwofI9qJdsDsgd7n3oLKGLtM7QxDEZIZ5LpBZKWOtERYbsEMhbMc7tUm6LpYi_6qTdlONmB_B8233q3GFHsYBF4IVzLKKMZIoH0ueepzjnseSMScrSUKSCekwoQikPM4-pNhP6fDOlfUKYRSSTgQ59DqGaF7k6AqTlqQgPskiEBoRNchnydkpkKAgjMuANOC_lm0yWSBrJCjPZaiPR2kisNpJFA5qlUBN3qmbJWqINuCjVsl7-fbfjv3c7gS3DIr8cMWxCdT79UKewKT7n49m0BbWbbq8_aEHlnuKWtTD9HTwOvwCw-NcM
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwED6VggQL5SkKBTzABBZN4sTxgBAqVEUtFUNBbMGxHQRDWtoC5U_xG7GdhAok2BiYLZ2UfPf0-b4D2AtdGQgvljiQsS5QHKIwi12KqStFwpyYS0tWfdOh3W54e8uuSvBezMKYZ5WFT7SOWvaFuSM_8nRspqaiCk4GT9hsjTLd1WKFRqYWbfX2qku20fHFmcZ333Wb571GC-dbBbDwHDLGIkj8RHFPutxxFOc8lJwxSVlMRCyow4TyKeUkcZiqM6FVmiltBiQJ_ER6OtpruTMwS7yQGrtqU_zp-U3tZLurQYB1ZRnmQzp2VM_w5oTYvJ03zS8fT74Gwml2-60ha-Ncs_Lf_tASLOYZNTrNTGAZSipdgUqxrQLlzmsVGhk1k9ZJNMg3NSGeSqQmSljrQ_0E2SGXx_5Dao9SexmM-P39UJnrxtEaXP_Jp6xDOe2nagOQxk_53EsCQQzJnOSS8HrsSyJ85kuPV-GgwDMaZEwh0ScntEU_0uhHFv1oUoVaAWKUe41RNEWwCoeFGkyPf5a2-bu0XZhv9S47Ueei296CBVfnadk4ZQ3K4-Gz2oY58TJ-GA13rD4juPtr9fgAiKwySw
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA5SRbxYn1itmoM3De3u5rE5SrUollJQS29LNg-ph21pV-nPN8nutip6EM9ZQnYyk8xk5vsGgIs4VFRGqUJUpTZACbBGPA0ZYqGShgepUJ6sethj_X48GvHBJxS_r3avUpIFpsGxNGV5a6pMawl8cyw0MXKV6C6VRJD1ItexK6R38frjcHkWu2jG5zspRTbWi0vYzM9zfL2aVv7mtxSpv3m69f-veQdsl14nvC7UZBes6WwP1KuODrA08H3QKeiL7L7BadnNCIpMQb3Q0msonBjogSCvk3HmhzL_YArFiw3c3ZPc_AA8d2-fOneobLOAZBTgHElqiNEiUqEIAi2EiJXgXDGeYplKFnCpCWMCm4DrNpfWxrm25wI2lBgVWffnENSySaaPALR_qImIDJXYEbEpobBop0RhSThRkWiAy0rCybRg00iWvMlePomVT-LlkywaoFltQlJa1jyJrI_GXGRNG-CqEvpq-PfZjv_2-TnYHNx0k959_-EEbLkm8wUCsQlq-exNn4IN-Z6P57Mzr3AfwiXWCg
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Practical+planning+and+execution+of+groupjoin+and+nested+aggregates&rft.jtitle=The+VLDB+journal&rft.au=Fent%2C+Philipp&rft.au=Birler%2C+Altan&rft.au=Neumann%2C+Thomas&rft.date=2023-11-01&rft.pub=Springer+Nature+B.V&rft.issn=1066-8888&rft.eissn=0949-877X&rft.volume=32&rft.issue=6&rft.spage=1165&rft.epage=1190&rft_id=info:doi/10.1007%2Fs00778-022-00765-x
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1066-8888&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1066-8888&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1066-8888&client=summon