{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:34:09Z","timestamp":1725557649881},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408062"},{"type":"electronic","value":"9783540452270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45227-0_73","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T23:57:53Z","timestamp":1277251073000},"page":"747-759","source":"Crossref","is-referenced-by-count":3,"title":["Exploiting Similarity of Subqueries for Complex Query Optimization"],"prefix":"10.1007","author":[{"given":"Yingying","family":"Tao","sequence":"first","affiliation":[]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Calisto","family":"Zuzarte","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"73_CR1","unstructured":"Bennett, K., Ferris, M.C., Ioannidis, Y.: A genetic algorithm for database query optimization. In: Proc. of Int\u2019l Conf. on Genetic Algorithms, pp. 400\u2013407 (1991)"},{"key":"73_CR2","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: An overview of query optimization in relational systems. In: Proc. of ACM PODS, pp. 34\u201343 (1998)","DOI":"10.1145\/275487.275492"},{"issue":"2","key":"73_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/152610.152611","volume":"25","author":"G. Graefe","year":"1993","unstructured":"Graefe, G.: Query Evaluation Techniques for Large Databases. ACM Comp. Surveys\u00a025(2), 111\u2013152 (1993)","journal-title":"ACM Comp. Surveys"},{"issue":"3","key":"73_CR4","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1145\/1270.1498","volume":"9","author":"T. Ibaraki","year":"1984","unstructured":"Ibaraki, T., Kameda, T.: On the optimal nesting order for computing N-relational joins. ACM Trans. on DB Syst.\u00a09(3), 482\u2013502 (1984)","journal-title":"ACM Trans. on DB Syst."},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E., Wong, E.: Query Optimization by Simulated Annealing. In: Proc. of ACM SIGMOD, pp. 9\u201322 (1987)","DOI":"10.1145\/38713.38722"},{"issue":"2","key":"73_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/356924.356928","volume":"16","author":"M. Jarke","year":"1984","unstructured":"Jarke, M., Koch, J.: Query Optimization in Database Systems. ACM Comp. Surveys\u00a016(2), 111\u2013152 (1984)","journal-title":"ACM Comp. Surveys"},{"key":"73_CR7","doi-asserted-by":"crossref","unstructured":"Matysiak, M.: Efficient Optimization of Large Join Queries Using Tabu Search. Infor. Sci.\u00a083(1-2) (1995)","DOI":"10.1016\/0020-0255(94)00094-R"},{"key":"73_CR8","doi-asserted-by":"crossref","unstructured":"Selinger, P.G., et al.: Access Path Selection in a Relational Database Management System. In: Proc. of ACM SIGMOD, pp. 23\u201334 (1979)","DOI":"10.1145\/582095.582099"},{"key":"73_CR9","doi-asserted-by":"crossref","unstructured":"Swami, A., Iyer, B.R.: A polynomial time algorithm for optimizing join queries. In: Proc. of IEEE ICDE, pp. 345\u2013354 (1993)","DOI":"10.1109\/ICDE.1993.344047"},{"key":"73_CR10","doi-asserted-by":"crossref","unstructured":"Swami, A., Gupta, A.: Optimization of Large Join Queries. In: Proc. of ACM SIGMOD, pp. 8\u201317 (1988)","DOI":"10.1145\/50202.50203"},{"key":"73_CR11","doi-asserted-by":"crossref","unstructured":"Tao, Y., Zhu, Q., Zuzarte, C.: Exploiting Common Subqueries for Complex Query Optimization. In: Proc. of CASCON, pp. 21\u201334 (2002)","DOI":"10.1007\/978-3-540-45227-0_73"},{"key":"73_CR12","unstructured":"Tao, Y., Zhu, Q., Zuzarte, C.: Optimizing Complex Queries by Exploiting Similarities of Subqueries. Technical Report CIS-TR-0301-03, CIS Dept, U. of Michigan, Dearborn, MI 48128, USA (March 2003)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45227-0_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T00:23:28Z","timestamp":1635553408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45227-0_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408062","9783540452270"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45227-0_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}