{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:05:28Z","timestamp":1758265528522,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463676.2465314","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"493-504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["On the correct and complete enumeration of the core search space"],"prefix":"10.1145","author":[{"given":"Guido","family":"Moerkotte","sequence":"first","affiliation":[{"name":"University of Mannheim, Mannheim, Germany"}]},{"given":"Pit","family":"Fender","sequence":"additional","affiliation":[{"name":"University of Mannheim, Mannheim, Germany"}]},{"given":"Marius","family":"Eich","sequence":"additional","affiliation":[{"name":"University of Mannheim, Mannheim, Germany"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223847"},{"key":"e_1_3_2_1_2_1","first-page":"226","volume-title":"DBPL","author":"Cluet S.","year":"1993","unstructured":"S. Cluet and G. Moerkotte . Nested queries in object bases . In DBPL , pages 226 -- 242 , 1993 . S. Cluet and G. Moerkotte. Nested queries in object bases. In DBPL, pages 226--242, 1993."},{"key":"e_1_3_2_1_4_1","first-page":"197","volume-title":"VLDB","author":"Dayal U.","year":"1987","unstructured":"U. Dayal . Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers . In VLDB , pages 197 -- 208 , 1987 . U. Dayal. Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In VLDB, pages 197--208, 1987."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247598"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767901"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544901"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375748"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645477.654654"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/244810.244812"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645478.757691"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0110-5"},{"key":"e_1_3_2_1_13_1","volume-title":"Ranking and unranking of lexicographically ordered words: An average-case analysis. J. of Automata, Languages, and Combinatorics, 2:227--268","author":"Liebehenschel J.","year":"1997","unstructured":"J. Liebehenschel . Ranking and unranking of lexicographically ordered words: An average-case analysis. J. of Automata, Languages, and Combinatorics, 2:227--268 , 1997 . J. Liebehenschel. Ranking and unranking of lexicographically ordered words: An average-case analysis. J. of Automata, Languages, and Combinatorics, 2:227--268, 1997."},{"key":"e_1_3_2_1_14_1","first-page":"930","volume-title":"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 trees without cross products . In 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 trees without cross products. In VLDB, pages 930--941, 2006."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376672"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402723"},{"key":"e_1_3_2_1_18_1","first-page":"306","volume-title":"VLDB","author":"Pellenkoft A.","year":"1997","unstructured":"A. Pellenkoft , C. Galindo-Legaria , and M. Kersten . The complexity of transformation-based join enumeration . In VLDB , pages 306 -- 315 , 1997 . A. Pellenkoft, C. Galindo-Legaria, and M. Kersten. The complexity of transformation-based join enumeration. In VLDB, pages 306--315, 1997."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646711.703167"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656548"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007643"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98738"},{"key":"e_1_3_2_1_24_1","first-page":"89","volume-title":"ICDE","author":"Yan W.","year":"1994","unstructured":"W. Yan and P.-A. Larson . Performing group-by before join . In ICDE , pages 89 -- 100 , 1994 . W. Yan and P.-A. Larson. Performing group-by before join. In ICDE, pages 89--100, 1994."},{"key":"e_1_3_2_1_25_1","first-page":"345","volume-title":"VLDB","author":"Yan W.","year":"1995","unstructured":"W. Yan and P.-A. Larson . Eager aggregation and lazy aggregation . In VLDB , pages 345 -- 357 , 1995 . W. Yan and P.-A. Larson. Eager aggregation and lazy aggregation. In VLDB, pages 345--357, 1995."}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"New York New York USA","acronym":"SIGMOD\/PODS'13"},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2465314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:05Z","timestamp":1750235945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":22,"alternative-id":["10.1145\/2463676.2465314","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2465314","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}