{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:19:12Z","timestamp":1752549552257},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589075"},{"type":"electronic","value":"9783540491361"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58907-4_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:53:02Z","timestamp":1330257182000},"page":"280-293","source":"Crossref","is-referenced-by-count":3,"title":["Uniformly-distributed random generation of join orders"],"prefix":"10.1007","author":[{"given":"C\u00e9sar A.","family":"Galindo-Legaria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjan","family":"Pellenkoft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin L.","family":"Kersten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30(3):479\u2013513, July 1983.","journal-title":"Journal of the ACM"},{"key":"22_CR2","volume-title":"Distributed Databases: Principles and Systems","author":"S. Ceri","year":"1985","unstructured":"S. Ceri and G. Pelagatti. Distributed Databases: Principles and Systems. McGraw-Hill, New York, 1985."},{"unstructured":"C. A. Galindo-Legaria, A. Pellenkoft, and M. L. Kersten. Fast, randomized join-order selection \u2014Why use transformations? In Proceedings of the Twentieth International Conference on Very Large Databases, Santiago, 1994. Also CWI Technical Report CS-R9416.","key":"22_CR3"},{"doi-asserted-by":"crossref","unstructured":"U. Gupta, D. T. Lee, and C. K. Wong. Ranking and unranking of 2\u20133 trees. SIAM Journal of Computation, pages 582\u2013590, August 1982.","key":"22_CR4","DOI":"10.1137\/0211049"},{"issue":"2","key":"22_CR5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G. Graefe","year":"1993","unstructured":"G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73\u2013170, June 1993.","journal-title":"ACM Computing Surveys"},{"doi-asserted-by":"crossref","unstructured":"F. Harary and E. M. Palmer. Graphical Enumeration. Academic Press, 1973.","key":"22_CR6","DOI":"10.1016\/B978-0-12-324245-7.50005-8"},{"doi-asserted-by":"crossref","unstructured":"Y. E. Ioannidis and Y. C. Kang. Randomized algorithms for optimizing large join queries. Proc. of the ACM-SIGMOD Conference on Management of Data, pages 312\u2013321, 1990.","key":"22_CR7","DOI":"10.1145\/93597.98740"},{"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. Proc. of the ACM-SIGMOD Conference on Management of Data, pages 168\u2013177, 1991.","key":"22_CR8","DOI":"10.1145\/115790.115813"},{"unstructured":"Y. C. Kang. Randomized Algorithms for Query Optimization. PhD thesis, University of Wisconsin-Madison, 1991. Technical report #1053.","key":"22_CR9"},{"unstructured":"D. E. Knuth. The Art of Computer Programming, volume 1: Fundamental Algorithms. Addison-Wesley, 1968. Second edition, 1973.","key":"22_CR10"},{"volume-title":"Query processing in database systems","year":"1985","unstructured":"W. Kim, D. S. Reiner, and D. S. Batory, editors. Query processing in database systems. Springer, Berlin, 1985.","key":"22_CR11"},{"doi-asserted-by":"crossref","unstructured":"R. S. G. Lanzelotte, P. Valduriez, and M. Za\u00eft. On the effectiveness of optimization search strategies for parallel execution spaces. Proc. of the 19th VLDB Conference, Dublin, Ireland, pages 493\u2013504, 1993.","key":"22_CR12","DOI":"10.1016\/0306-4379(94)90017-5"},{"unstructured":"K. Ono and G. M. Lohman. Measuring the complexity of join enumeration in query optimization. Proc. of the 16th VLDB Conference, Brisbane, Australia, pages 314\u2013325, 1990.","key":"22_CR13"},{"issue":"4","key":"22_CR14","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/0206055","volume":"6","author":"F. Ruskey","year":"1977","unstructured":"F. Ruskey and T. C. Hu. Generating binary trees lexicographically. SIAM journal of Computation, 6(4):745\u2013758, December 1977.","journal-title":"SIAM journal of Computation"},{"doi-asserted-by":"crossref","unstructured":"A. N. Swami and A. Gupta. Optimization of large join queries. Proc. of the ACM-SIGMOD Conference on Management of Data, pages 8\u201317, 1988.","key":"22_CR15","DOI":"10.1145\/50202.50203"},{"unstructured":"A. N. Swami. Optimization of Large Join Queries. PhD thesis, Stanford University, 1989. Technical report STAN-CS-89-1262.","key":"22_CR16"},{"doi-asserted-by":"crossref","unstructured":"A. N. Swami. Optimization of large join queries: Combining heuristics and combinatorial techniques. Proc. of the ACM-SIGMOD Conference on Management of Data, pages 367\u2013376, 1989.","key":"22_CR17","DOI":"10.1145\/67544.66961"},{"key":"22_CR18","volume-title":"Technical Report RJ 7908","author":"A. N. Swami","year":"1991","unstructured":"A. N. Swami. Distribution of query plan costs for large join queries. Technical Report RJ 7908, IBM Research Division, Almaden, 1991."},{"key":"22_CR19","volume-title":"Principles of Database Systems","author":"J. D. Ullman","year":"1982","unstructured":"J. D. Ullman. Principles of Database Systems. Computer Science Press, Rockville, MD, 2nd edition, 1982.","edition":"2nd edition"},{"doi-asserted-by":"crossref","unstructured":"J. S. Vitter and Ph. Flajolet. Analysis of algorithms and data structures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 9, pages 431\u2013524. North Holland, 1990.","key":"22_CR20","DOI":"10.1016\/B978-0-444-88071-0.50014-X"},{"doi-asserted-by":"crossref","unstructured":"J. van Leeuwen. Graph algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 10, pages 525\u2013631. North Holland, 1990.","key":"22_CR21","DOI":"10.1016\/B978-0-444-88071-0.50015-1"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58907-4_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:49:09Z","timestamp":1687272549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58907-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589075","9783540491361"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58907-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}