{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:23:42Z","timestamp":1773512622811,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540677437","type":"print"},{"value":"9783540450337","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45033-5_5","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T01:12:19Z","timestamp":1191719539000},"page":"51-67","source":"Crossref","is-referenced-by-count":11,"title":["Join Order Selection ( Good Enough Is Easy )"],"prefix":"10.1007","author":[{"given":"Florian","family":"Waas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjan","family":"Pellenkoft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,11,11]]},"reference":[{"key":"5_CR1","volume-title":"Fundamentals of Database Sytems","author":"E. Elmasri","year":"1994","unstructured":"E. Elmasri and S. B. Navathe. Fundamentals of Database Sytems. Benjamin\/Cummings, Redwood City, CA, USA, 2nd edition, 1994.","edition":"2nd edition"},{"key":"5_CR2","unstructured":"C. A. Galindo-Legaria, A. Pellenkoft, and M. L. Kersten. Fast, Randomized Join-Order Selection \u2014 Why Use Transformations? In Proc. of the Int\u2019l. Conf. on Very Large Data Bases, pages 85\u201395, Santiago, Chile, September 1994."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"C. A. Galindo-Legaria, A. Pellenkoft, and M. L. Kersten. Uniformly-distributed Random Generation of Join Orders. In Proc. of the Int\u2019l. Conf. on Database Theory, pages 280\u2013293, Prague, Czech Republic, January 1995.","DOI":"10.1007\/3-540-58907-4_22"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Y. E. Ioannidis and S. Christodoulakis. On the Propagation of Errors in the Size of Join Results. In Proc. of the ACM SIGMOD Int\u2019l. Conf. on Management of Data, pages 268\u2013277, Denver, CO, USA, May 1991.","DOI":"10.1145\/115790.115835"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Y. E. Ioannidis and Y. C. Kang. Left-Deep vs. Bushy Trees: An Analysis of Strategy Spaces and its Implications for Query Optimization. In Proc. of the ACM SIGMOD Int\u2019l. Conf. on Management of Data, pages 168\u2013177, Denver, CO, USA, May 1991.","DOI":"10.1145\/119995.115813"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Y. E. Ioannidis and E. Wong. Query Optimization by Simulated Annealing. In Proc. of the ACM SIGMOD Int\u2019l. Conf. on Management of Data, pages 9\u201322, San Francisco, CA, USA, May 1987.","DOI":"10.1145\/38713.38722"},{"key":"5_CR7","unstructured":"R. Krishnamurthy, H. Boral, and C. Zaniolo. Optimization of Nonrecursive Queries. In Proc. of the Int\u2019l. Conf. on Very Large Data Bases, pages 128\u2013137, Kyoto, Japan, August 1986."},{"key":"5_CR8","volume-title":"Database Systems Concepts","author":"H. Korth","year":"1991","unstructured":"H. Korth and A. Silberschatz. Database Systems Concepts. McGraw-Hill, Inc., New York, San Francisco, Washington, DC, USA, 1991."},{"key":"5_CR9","unstructured":"R. S. G. Lanzelotte, P. Valduriez, and M. Za\u00eft. On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces. In Proc. of the Int\u2019l. Conf. on Very Large Data Bases, pages 493\u2013504, Dublin, Ireland, August 1993."},{"key":"5_CR10","volume-title":"Probabilistic and Transformation based Query Optimization","author":"A. Pellenkoft","year":"1997","unstructured":"A. Pellenkoft. Probabilistic and Transformation based Query Optimization. PhD thesis, Universiteit van Amsterdam, Amsterdam, The Netherlands, 1997."},{"key":"5_CR11","unstructured":"A. Pellenkoft, C. A. Galindo-Legaria, and M. L. Kersten. The Complexity of Transformation-Based Join Enumeration. In Proc. of the Int\u2019l. Conf. on Very Large Data Bases, pages 306\u2013315, Athens, Greece, September 1997."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"[SAC+79]_P. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access Path Selection in a Relational Database Management System. In Proc. of the ACM SIGMOD Int\u2019l. Conf. on Management of Data, pages 23\u201334, Boston, MA, USA, May 1979.","DOI":"10.1145\/582095.582099"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"A. Swami and A. Gupta. Optimizing Large Join Queries. In Proc. of the ACM SIGMOD Int\u2019l. Conf. on Management of Data, pages 8\u201317, Chicago, IL, USA, June 1988.","DOI":"10.1145\/971701.50203"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"A. Swami and B. R. Iyer. A Polynomial Time Algorithm for Optimizing Join Queries. In Proc. of the IEEE Int\u2019l. Conf. on Data Engineering, pages 345\u2013354, Vienna, Austria, April 1993.","DOI":"10.1109\/ICDE.1993.344047"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"W. Scheufele and G. Moerkotte. On the Complexity of Generating Optimal Plans with Cross Products. In Proc. of the ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, pages 238\u2013248, Tucson, AZ, USA, May 1997.","DOI":"10.1145\/263661.263687"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s007780050040","volume":"6","author":"M. Steinbrunn","year":"1997","unstructured":"M. Steinbrunn, G. Moerkotte, and A. Kemper. Heuristic and Randomized Optimization for the Join Ordering Problem. The VLDB Journal, 6(3):191\u2013208, August 1997.","journal-title":"The VLDB Journal"},{"key":"5_CR17","unstructured":"M. Steinbrunn. Heuristic and Randomised Optimisation Techniques in Object-Oriented Database. DISDBIS. infix, Sankt Augustin, Germany, 1996."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"A. Swami. Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques. In Proc. of the ACM SIGMOD Int\u2019l. Conf. on Management of Data, pages 367\u2013376, Portland, OR, USA, June 1989.","DOI":"10.1145\/67544.66961"},{"key":"5_CR19","unstructured":"Transaction Processing Performance Council, San Jose, CA, USA. TPC Benchmark D (Decision Support), Revision 1.3.1, 1998."},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0196-6774(88)90005-3","volume":"9","author":"J. S. Turner","year":"1988","unstructured":"J. S. Turner. Almost All k-Colorable Graphs are Easy to Color. Journal of Algorithms, 9(1):63\u201382, March 1988.","journal-title":"Journal of Algorithms"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"B. Vance and D. Maier. Rapid Bushy Join-order Optimization with Cartesian Products. In Proc. of the ACM SIGMOD Int\u2019l. Conf. on Management of Data, pages 35\u201346, Montreal, Canada, June 1996.","DOI":"10.1145\/233269.233317"},{"key":"5_CR22","series-title":"Technical Report","volume-title":"Cost Distributions in Symmetric Euclidean Traveling Salesman Problems-A Supplement to TSPLIB","author":"F. Waas","year":"1999","unstructured":"F. Waas. Cost Distributions in Symmetric Euclidean Traveling Salesman Problems-A Supplement to TSPLIB. Technical Report INS-R9911, CWI, Amsterdam, The Netherlands, September 1999."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"F. Waas and C. A. Galindo-Legaria. Counting, Enumerating and Sampling of Execution Plans in a Cost-Based Query Optimizer. In Proc. of the ACM SIGMOD Int\u2019l. Conf. on Management of Data, Dallas, TX, USA, May 2000. Accepted for publication.","DOI":"10.1145\/342009.335451"},{"key":"5_CR24","series-title":"Technical Report","volume-title":"Exploiting Cost Distributions for Query Optimization","author":"F. Waas","year":"1998","unstructured":"F. Waas and A. Pellenkoft. Exploiting Cost Distributions for Query Optimization. Technical Report INS-R9811, CWI, Amsterdam, The Netherlands, October 1998."}],"container-title":["Lecture Notes in Computer Science","Advances in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45033-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:40:57Z","timestamp":1556898057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45033-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677437","9783540450337"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45033-5_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}