{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:18:13Z","timestamp":1725495493734},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001300"},{"type":"electronic","value":"9783540361282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36128-6_34","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T22:20:41Z","timestamp":1194992441000},"page":"544-554","source":"Crossref","is-referenced-by-count":0,"title":["Multi Query Optimization Using Query Pack Trees"],"prefix":"10.1007","author":[{"given":"Stijn","family":"Dekeyser","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"L. Brunie and H. Kosch. ModParOpt: A Modular Query Optimizer for Multi-Query Parallel Databases. In ADBIS 1997, pages 97\u2013106.","DOI":"10.14236\/ewic\/ADBIS1997.7"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"H. Blockeel, L. Dehaspe, B. Demoen, G. Janssens, J. Ramon, and H. Vandecasteele. Executing query packs in ILP. In Proc. of the 10th International Conference on Inductive Logic Programming, Lecture Notes in Artificial Intelligence, vol. 1866, pages 60\u201377, London, UK, July 2000.","DOI":"10.1007\/3-540-44960-4_4"},{"key":"34_CR3","unstructured":"S. Dekeyser and J. Paredaens. Query Pack Trees for Multi Query Optimization. Technical Report 01-04, University of Antwerp, 2001. ftp:\/\/wins.uia.ac.be\/pub\/dekeyser\/qpt.ps"},{"key":"34_CR4","unstructured":"S. Dekeyser and J. Paredaens. A Sound and Complete Set of Axioms for the Deduction of Comparison Formulas. Technical Report 01-05, University of Antwerp, 2001. ftp:\/\/wins.uia.ac.be\/pub\/dekeyser\/axioms.ps"},{"key":"34_CR5","unstructured":"C. Galindo-Legaria, A. Pellenkoft, and M. Kersten. Fast, Randomized Join-Order Selection. In Proc. of the Int\u2019l. Conf. on Very Large Databases, pages 95\u201395, Santiago, Chile, 1994."},{"key":"34_CR6","unstructured":"Y. Ioannidis. Query Optimization. In The Computer Science and Engineering Handbook 1997, pages 1038\u20131057."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Y. Ioannidis and Y. Kang. Randomized Algorithms for Optimizing Large Join Queries. In Proc. of the ACM Int\u2019l. Conf. on Management of Data, pages 312\u2013321, Atlantic City, 1990.","DOI":"10.1145\/93597.98740"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"M. Jarke. Common Subexpression Isolation in Multiple Query Optimization. In Query Processing in Database Systems, pages 191\u2013205, 1985.","DOI":"10.1007\/978-3-642-82375-6_11"},{"key":"34_CR9","unstructured":"M. Jeusfeld and M. Staudt Query Optimization in Deductive Object Bases. In Dagstuhl Query Processing Workshop, pages 145\u2013176, 1991."},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"D. Kountanis and H. Xue A Better Approximation Algorithm for the Query Optimization Problem. In ACM Conference on Computer Science, pages 15\u201321, 1994.","DOI":"10.1145\/197530.197551"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"S. Manegold, A. Pellenkoft, and M. Kersten. A Multi-query Optimizer for Monet. In BNCOD 2000, pages 36\u201350.","DOI":"10.1007\/3-540-45033-5_4"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price. Access Path Selection in a Relational Database Management System. In Proc. of the ACM Int\u2019l. Conf. on Management of Data, pages 23\u201334, Boston, 1979.","DOI":"10.1145\/582095.582099"},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"T. Sellis","year":"1988","unstructured":"T. Sellis. Multiple-Query Optimization. In TODS 13(1): 23\u201352, 1988.","journal-title":"TODS"},{"key":"34_CR14","first-page":"885","volume-title":"Principles of Database and Knowledge-base Systems","author":"J. Ullman","year":"1989","unstructured":"J. Ullman. Principles of Database and Knowledge-base Systems \u2014Volume II, pages 885\u2013889. Computer Science Press, Rockville, MD, 1989."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"B. Vance and D. Maier. Rapid Bushy Join-order Optimization with Cartesian Products. In Proc. of the ACM Int\u2019l. Conf. on Management of Data, pages 35\u201346, Montreal, 1996.","DOI":"10.1145\/233269.233317"}],"container-title":["Lecture Notes in Computer Science","XML-Based Data Management and Multimedia Engineering \u2014 EDBT 2002 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36128-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T02:56:38Z","timestamp":1588042598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36128-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001300","9783540361282"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36128-6_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}