{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T13:52:48Z","timestamp":1679493168222},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,6]]},"abstract":"<jats:p>\n            In the published version of EnumerateCmp in the Section 3.3 on Page 936 [1], see also Algorithm 1, a small error is included in Line 5. In the first call of EnumerateCsgRec, too many nodes (\n            <jats:italic>X<\/jats:italic>\n            \u222a\n            <jats:italic>N<\/jats:italic>\n            ) will be excluded for the emission of complements, leading to the fact that, in general, not all complements will be emitted correctly.\n          <\/jats:p>","DOI":"10.14778\/3231751.3231756","type":"journal-article","created":{"date-parts":[[2018,7,27]],"date-time":"2018-07-27T12:21:07Z","timestamp":1532694067000},"page":"1069-1070","source":"Crossref","is-referenced-by-count":1,"title":["Errata for \"Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products\""],"prefix":"10.14778","volume":"11","author":[{"given":"Andreas","family":"Meister","sequence":"first","affiliation":[{"name":"University Magdeburg, Germany"}]},{"given":"Guido","family":"Moerkotte","sequence":"additional","affiliation":[{"name":"University Mannheim, Germany"}]},{"given":"Gunter","family":"Saake","sequence":"additional","affiliation":[{"name":"University Magdeburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,6]]},"reference":[{"key":"e_1_2_1_1_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 Join Trees Without Cross Products . VLDB , pages 930 -- 941 . VLDB End. , 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. VLDB, pages 930--941. VLDB End., 2006."},{"key":"e_1_2_1_2_1","first-page":"314","volume-title":"Measuring the Complexity of Join Enumeration in Query Optimization. VLDB","author":"Ono K.","year":"1990","unstructured":"K. Ono and G. M. Lohman . Measuring the Complexity of Join Enumeration in Query Optimization. VLDB , pages 314 -- 325 . Morgan Kaufmann , 1990 . K. Ono and G. M. Lohman. Measuring the Complexity of Join Enumeration in Query Optimization. VLDB, pages 314--325. Morgan Kaufmann, 1990."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3231751.3231756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:38:39Z","timestamp":1672223919000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3231751.3231756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":2,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["10.14778\/3231751.3231756"],"URL":"https:\/\/doi.org\/10.14778\/3231751.3231756","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}