{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:23:09Z","timestamp":1725470589866},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540378716"},{"type":"electronic","value":"9783540378723"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11827405_34","type":"book-chapter","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T15:44:55Z","timestamp":1158594295000},"page":"348-357","source":"Crossref","is-referenced-by-count":9,"title":["Recursive SQL Query Optimization with k-Iteration Lookahead"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Ghazal","sequence":"first","affiliation":[]},{"given":"Alain","family":"Crolotte","sequence":"additional","affiliation":[]},{"given":"Dawit","family":"Seid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/191843.191874","volume":"23","author":"C.M. Chen","year":"1994","unstructured":"Chen, C.M., Roussopoulos, N.: Adaptive Selectivity Estimation Using Query Feedback. ACM SIGMOD Record\u00a023(2), 161\u2013172 (1994)","journal-title":"ACM SIGMOD Record"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Brueining, D., Garnett, T., Amarasinghe, S.: An Infrastructure for Adaptive Dynamic Optimization. In: Int. Symp. on Code Generation and Optimization, pp. 265\u2013275 (2003)","DOI":"10.1109\/CGO.2003.1191551"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Kabra, N., DeWitt, D.J.: Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, pp. 106\u2013117 (1998)","DOI":"10.1145\/276304.276315"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Derr, M.: Adaptive Query Optimization in a Deductive Database System. In: Proc. of the 2nd Int. Conf. on Information and Knowledge Management, pp. 206\u2013215 (1993)","DOI":"10.1145\/170088.170134"},{"key":"34_CR5","volume-title":"Advanced Database Systems","author":"C. Zaniolo","year":"1997","unstructured":"Zaniolo, C., et al.: Advanced Database Systems. Morgan Kauffman, San Francisco (1997)"},{"key":"34_CR6","unstructured":"Lipton, R.J., Naughton, J.F.: Estimating the size of generalized transitive closures. In: VLDB, pp. 315\u2013326 (1989)"},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/jcss.1995.1050","volume":"51","author":"R.J. Lipton","year":"1995","unstructured":"Lipton, R.J.: Query size estimation by adaptive sampling. J. of Computer and System Sciences\u00a051(1), 18\u201325 (1995)","journal-title":"J. of Computer and System Sciences"},{"issue":"3","key":"34_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. of Computer and System Sciences\u00a055(3), 441\u2013453 (1997)","journal-title":"J. of Computer and System Sciences"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Ordonez, C.: Optimizing recursive queries in SQL. In: SIGMOD 2005, pp. 834\u2013839 (2005)","DOI":"10.1145\/1066157.1066260"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Markl, V., et al.: Robust query processing through progressive optimization. In: SIGMOD 2004, pp. 659\u2013670 (2004)","DOI":"10.1145\/1007568.1007642"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Babu, S., Bizarro, P., DeWitt, D.: Proactive re-optimization. In: SIGMOD 2005, pp. 107\u2013118 (2005)","DOI":"10.1145\/1066157.1066171"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Zurek, T., Thanisch, P.: Optimization Strategies for Parallel Linear Recursive Query Processing, CSG Technical Report ECS-CSG-16-95 (July 1995)","DOI":"10.1007\/3-540-60365-4_129"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Sellis, T.: Multiple Query Optimization. ACM Transactions on Database Systems, 23\u201352 (1988)","DOI":"10.1145\/42201.42203"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Roy, P., Seshadri, S., Sudarshan, S., Bhobhe, S.: Efficient and extensible algorithms for multi-query optimization. In: SIGMOD, pp. 249\u2013260 (2000)","DOI":"10.1145\/342009.335419"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Dalvi, N.N., et al.: Pipelining in multi-query optimization. In: PODS, pp. 59\u201370 (2001)","DOI":"10.1145\/375551.375561"},{"issue":"4","key":"34_CR16","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1145\/169725.169708","volume":"18","author":"Y. Ionnidis","year":"1993","unstructured":"Ionnidis, Y., Christodoulakis, S.: Optimal histograms for limiting worst-case error propagation in the size of join results. ACM TODS\u00a018(4), 709\u2013748 (1993)","journal-title":"ACM TODS"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11827405_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:56Z","timestamp":1605644276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11827405_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540378716","9783540378723"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11827405_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}