{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:18:03Z","timestamp":1757575083097,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439059"},{"type":"electronic","value":"9783540454953"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45495-0_2","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T02:15:47Z","timestamp":1179281747000},"page":"11-25","source":"Crossref","is-referenced-by-count":19,"title":["Adaptive Query Processing: A Survey"],"prefix":"10.1007","author":[{"given":"Anastasios","family":"Gounaris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norman W.","family":"Paton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alvaro A. A.","family":"Fernandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rizos","family":"Sakellariou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1008646115473","volume":"6","author":"L. Amsaleg","year":"1998","unstructured":"L. Amsaleg, M. Franklin, and A. Tomasic. Dynamic query operator scheduling for wide-area remote access. Distributed and Parallel Databases, 6(3):217\u2013246, 1998.","journal-title":"Distributed and Parallel Databases"},{"doi-asserted-by":"crossref","unstructured":"L. Amsaleg, M. Franklin, A. Tomasic, and T. Urhan. Scrambling query plans to cope with unexpected delays. In Proc. of the Fourth International Conference on Parallel and Distributed Information Systems, pages 208\u2013219. IEEE Computer Society, 1996.","key":"2_CR2","DOI":"10.1109\/PDIS.1996.568681"},{"doi-asserted-by":"crossref","unstructured":"R. Arpaci-Dusseau, E. Anderson, N. Treuhaft, D. Culler, J. Hellerstein, D. Patterson, and K. Yelick. Cluster I\/O with River: Making the fast case common. In Proceedings of the Sixth Workshop on Input\/Output in Parallel and Distributed Systems, pages 10\u201322, Atlanta, GA, 1999. ACM Press.","key":"2_CR3","DOI":"10.1145\/301816.301823"},{"key":"2_CR4","volume-title":"Technical Report CSD-99-1078","author":"R. Avnur","year":"1999","unstructured":"R. Avnur and J. Hellerstein. Continuous query optimization. Technical Report CSD-99-1078, University of California, Berkeley, 1999."},{"doi-asserted-by":"crossref","unstructured":"R. Avnur and J. Hellerstein. Eddies: Continuously adaptive query processing. In Proc. of ACMSIGMOD 2000, pages 261\u2013272, 2000.","key":"2_CR5","DOI":"10.1145\/342009.335420"},{"issue":"2","key":"2_CR6","first-page":"42","volume":"23","author":"L. Bouganim","year":"2000","unstructured":"L. Bouganim, F. Fabret, C. Mohan, and P. Valduriez. A dynamic query processing architecture for data integration systems. IEEE Data Engineering Bulletin, 23(2):42\u201348, 2000.","journal-title":"IEEE Data Engineering Bulletin"},{"doi-asserted-by":"crossref","unstructured":"L. Bouganim, F. Fabret, C. Mohan, and P. Valduriez. Dynamic query scheduling in data integration systems. In Proc. of ICDE 2000, pages 425\u2013434, 2000.","key":"2_CR7","DOI":"10.1109\/ICDE.2000.839442"},{"unstructured":"I. Foster and C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers Inc., 1999.","key":"2_CR8"},{"doi-asserted-by":"crossref","unstructured":"P. Haas and J. Hellerstein. Ripple joins for online aggregation. In Proc. of ACM SIGMOD 1999, pages 287\u2013298, 1999.","key":"2_CR9","DOI":"10.1145\/304182.304208"},{"doi-asserted-by":"crossref","unstructured":"A. Hameurlain and F. Morvan. An overview of parallel query optimization in relational databases. In 11th International Workshop on Database and Expert Systems Application (DEXA 2000). IEEE Computer Society, 2000.","key":"2_CR10","DOI":"10.1109\/DEXA.2000.875090"},{"issue":"2","key":"2_CR11","first-page":"7","volume":"23","author":"J. Hellerstein","year":"2000","unstructured":"J. Hellerstein, M. Franklin, S. Chandrasekaran, A. Deshpande, K. Hildrum, S. Madden, V. Raman, and M. Shah. Adaptive query processing: Technology in evolution. IEEE Data Engineering Bulletin, 23(2):7\u201318, 2000.","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/234313.234367","volume":"28","author":"Y. Ioannidis","year":"1996","unstructured":"Y. Ioannidis. Query optimization. ACM Computing Surveys, 28(1):121\u2013123, 1996.","journal-title":"ACM Computing Surveys"},{"doi-asserted-by":"crossref","unstructured":"Z. Ives, D. Florescu, M. Friedman, A. Levy, and D. Weld. An adaptive query execution system for data integration. In Proc. of ACM SIGMOD, pages 299\u2013310, 1999.","key":"2_CR13","DOI":"10.1145\/304182.304209"},{"issue":"2","key":"2_CR14","first-page":"19","volume":"23","author":"Z. Ives","year":"2000","unstructured":"Z. Ives, A. Levy, D. Weld, D. Florescu, and M. Friedman. Adaptive query processing for internet applications. IEEE Data Engineering Bulletin, 23(2):19\u201326, 2000.","journal-title":"IEEE Data Engineering Bulletin"},{"doi-asserted-by":"crossref","unstructured":"N. Kabra and D. DeWitt. Efficient mid-query re-optimization of sub-optimal query execution plans. In Proc. of ACM SIGMOD 1998, pages 106\u2013117, 1998.","key":"2_CR15","DOI":"10.1145\/276304.276315"},{"unstructured":"K. Ng, Z. Wang, and R. Muntz. Dynamic reconfiguration of sub-optimal parallel query execution plans. Technical Report CSD-980033, UCLA, 1998.","key":"2_CR16"},{"doi-asserted-by":"crossref","unstructured":"K. Ng, Z. Wang, R. Muntz, and S. Nittel. Dynamic query re-optimization. In Proc. of 11th International Conference on Statistical and Scientific Database Management, pages 264\u2013273. IEEE Computer Society, 1999.","key":"2_CR17","DOI":"10.1109\/SSDM.1999.787642"},{"issue":"3","key":"2_CR18","first-page":"38","volume":"20","author":"F. Ozcan","year":"1997","unstructured":"F. Ozcan, S. Nural, P. Koksal, C. Evrendilek, and A. Dogac. Dynamic query optimization in multidatabases. Data Engineering Bulletin, 20(3):38\u201345, 1997.","journal-title":"Data Engineering Bulletin"},{"unstructured":"H. Pang, M. Carey, and M. Livny. Memory-adaptive external sorting. The VLDB Journal, pages 618\u2013629, 1993.","key":"2_CR19"},{"doi-asserted-by":"crossref","unstructured":"H. Pang, M. Carey, and M. Livny. Partially preemptible hash joins. In Proc. of ACM SIGMOD 1993, pages 59\u201368, 1993.","key":"2_CR20","DOI":"10.1145\/170035.170051"},{"doi-asserted-by":"crossref","unstructured":"B. Plale and K. Schwan. dquob: Managing large data flows using dynamic embedded queries. In IEEE International High Performance Distributed Computing (HPDC), pages 263\u2013270, 2000.","key":"2_CR21","DOI":"10.1109\/HPDC.2000.868658"},{"doi-asserted-by":"crossref","unstructured":"B. Plale and K. Schwan. Optimizations enabled by a relational data model view to querying data streams. In IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2001.","key":"2_CR22","DOI":"10.1109\/IPDPS.2001.924953"},{"doi-asserted-by":"crossref","unstructured":"V. Raman, B. Raman, and J. Hellerstein. Online dynamic reordering. The VLDB Journal, pages 247\u2013260, 2000.","key":"2_CR23","DOI":"10.1007\/s007780000032"},{"issue":"2","key":"2_CR24","first-page":"27","volume":"23","author":"T. Urhan","year":"2000","unstructured":"T. Urhan and M. Franklin. XJoin: A reactively-scheduled pipelined join operator. IEEE Data Engineering Bulletin, 23(2):27\u201333, 2000.","journal-title":"IEEE Data Engineering Bulletin"},{"unstructured":"T. Urhan and M. Franklin. Dynamic pipeline scheduling for improving interactive query performance. The VLDB Journal, pages 501\u2013510, 2001.","key":"2_CR25"},{"doi-asserted-by":"crossref","unstructured":"T. Urhan, M. Franklin, and Laurent Amsaleg. Cost-based query scrambling for initial delays. In Proc. of ACMSIGMOD 1998, pages 130\u2013141, 1998.","key":"2_CR26","DOI":"10.1145\/276305.276317"},{"unstructured":"W. Zhang and P. Larson. Dynamic memory adjustment for external mergesort. The VLDB Journal, pages 376\u2013385, 1997.","key":"2_CR27"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45495-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T09:15:27Z","timestamp":1737018927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45495-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439059","9783540454953"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45495-0_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}