{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T11:44:41Z","timestamp":1747309481384},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p>It has been a recognized fact for many years that query execution can benefit from pushing group-by operators down in the operator tree and applying them before a join. This so-called eager aggregation reduces the size(s) of the join argument(s), making join evaluation faster. Lately, the idea enjoyed a revival when it was applied to outer joins for the first time and incorporated in a state-of-the-art plan generator. However, this recent approach is highly dependent on the use of heuristics because of the exponential growth of the search space that goes along with eager aggregation. Finding an optimal solution for larger queries calls for effective optimality preserving pruning mechanisms to reduce the search space size as far as possible. By a more thorough investigation of functional dependencies and keys, we provide a set of new pruning criteria and evaluate their effectiveness with respect to the runtime and memory consumption of the resulting plan generator.<\/jats:p>","DOI":"10.14778\/2977797.2977802","type":"journal-article","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T12:34:02Z","timestamp":1470400442000},"page":"756-767","source":"Crossref","is-referenced-by-count":7,"title":["Faster plan generation through consideration of functional dependencies and keys"],"prefix":"10.14778","volume":"9","author":[{"given":"Marius","family":"Eich","sequence":"first","affiliation":[{"name":"University of Mannheim"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pit","family":"Fender","sequence":"additional","affiliation":[{"name":"Oracle Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Moerkotte","sequence":"additional","affiliation":[{"name":"University of Mannheim"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"354","volume-title":"Proc. Int. Conf. on Very Large Data Bases (VLDB)","author":"Chaudhuri S.","year":"1994","unstructured":"S. Chaudhuri and K. Shim . Including group-by in query optimization . In Proc. Int. Conf. on Very Large Data Bases (VLDB) , pages 354 -- 366 , 1994 . S. Chaudhuri and K. Shim. Including group-by in query optimization. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 354--366, 1994."},{"key":"e_1_2_1_2_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press , 3 rd edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 3rd edition, 2009.","edition":"3"},{"key":"e_1_2_1_3_1","volume-title":"Faster plan generation through consideration of functional dependencies and keys. Technical report","author":"Eich M.","year":"2016","unstructured":"M. Eich , P. Fender , and G. Moerkotte . Faster plan generation through consideration of functional dependencies and keys. Technical report , University of Mannheim , 2016 . M. Eich, P. Fender, and G. Moerkotte. Faster plan generation through consideration of functional dependencies and keys. Technical report, University of Mannheim, 2016."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113343"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/244810.244812"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465314"},{"key":"e_1_2_1_7_1","first-page":"930","volume-title":"Proc. Int. Conf. on Very Large Data Bases (VLDB)","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 Proc. Int. Conf. on Very Large Data Bases (VLDB) , pages 930 -- 941 , 2006 . 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 Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 930--941, 2006."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376672"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/74120.74123"},{"key":"e_1_2_1_13_1","first-page":"89","volume-title":"Proc. IEEE Conference on Data Engineering","author":"Yan W.","year":"1994","unstructured":"W. Yan and P.-A. Larson . Performing group-by before join . In Proc. IEEE Conference on Data Engineering , pages 89 -- 100 , 1994 . W. Yan and P.-A. Larson. Performing group-by before join. In Proc. IEEE Conference on Data Engineering, pages 89--100, 1994."},{"key":"e_1_2_1_14_1","first-page":"345","volume-title":"Proc. Int. Conf. on Very Large Data Bases (VLDB)","author":"Yan W.","year":"1995","unstructured":"W. Yan and P.-A. Larson . Eager aggregation and lazy aggregation . In Proc. Int. Conf. on Very Large Data Bases (VLDB) , pages 345 -- 357 , 1995 . W. Yan and P.-A. Larson. Eager aggregation and lazy aggregation. In Proc. Int. Conf. on Very Large Data Bases (VLDB), 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\/2977797.2977802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:54:10Z","timestamp":1672221250000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2977797.2977802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":11,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.14778\/2977797.2977802"],"URL":"https:\/\/doi.org\/10.14778\/2977797.2977802","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}