L. Amsaleg, M. Franklin, and A. Tomasic. Dynamic query operator scheduling for wide-area remote access. Distributed and Parallel Databases
, 6(3):217–246, 1998.CrossRefGoogle Scholar
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–219. IEEE Computer Society, 1996.
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–22, Atlanta, GA, 1999. ACM Press.
R. Avnur and J. Hellerstein. Continuous query optimization. Technical Report CSD-99-1078, University of California, Berkeley, 1999.Google Scholar
R. Avnur and J. Hellerstein. Eddies: Continuously adaptive query processing. In Proc. of ACMSIGMOD 2000, pages 261–272, 2000.
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–48, 2000.Google Scholar
L. Bouganim, F. Fabret, C. Mohan, and P. Valduriez. Dynamic query scheduling in data integration systems. In Proc. of ICDE 2000, pages 425–434, 2000.
I. Foster and C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers Inc., 1999.
P. Haas and J. Hellerstein. Ripple joins for online aggregation. In Proc. of ACM SIGMOD 1999, pages 287–298, 1999.
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.
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–18, 2000.Google Scholar
Y. Ioannidis. Query optimization. ACM Computing Surveys
, 28(1):121–123, 1996.CrossRefGoogle Scholar
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–310, 1999.
Z. Ives, A. Levy, D. Weld, D. Florescu, and M. Friedman. Adaptive query processing for internet applications. IEEE Data Engineering Bulletin
, 23(2):19–26, 2000.Google Scholar
N. Kabra and D. DeWitt. Efficient mid-query re-optimization of sub-optimal query execution plans. In Proc. of ACM SIGMOD 1998, pages 106–117, 1998.
K. Ng, Z. Wang, and R. Muntz. Dynamic reconfiguration of sub-optimal parallel query execution plans. Technical Report CSD-980033, UCLA, 1998.
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–273. IEEE Computer Society, 1999.
F. Ozcan, S. Nural, P. Koksal, C. Evrendilek, and A. Dogac. Dynamic query optimization in multidatabases. Data Engineering Bulletin
, 20(3):38–45, 1997.Google Scholar
H. Pang, M. Carey, and M. Livny. Memory-adaptive external sorting. The VLDB Journal, pages 618–629, 1993.
H. Pang, M. Carey, and M. Livny. Partially preemptible hash joins. In Proc. of ACM SIGMOD 1993, pages 59–68, 1993.
B. Plale and K. Schwan. dquob: Managing large data flows using dynamic embedded queries. In IEEE International High Performance Distributed Computing (HPDC), pages 263–270, 2000.
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.
V. Raman, B. Raman, and J. Hellerstein. Online dynamic reordering. The VLDB Journal, pages 247–260, 2000.
T. Urhan and M. Franklin. XJoin: A reactively-scheduled pipelined join operator. IEEE Data Engineering Bulletin
, 23(2):27–33, 2000.Google Scholar
T. Urhan and M. Franklin. Dynamic pipeline scheduling for improving interactive query performance. The VLDB Journal, pages 501–510, 2001.
T. Urhan, M. Franklin, and Laurent Amsaleg. Cost-based query scrambling for initial delays. In Proc. of ACMSIGMOD 1998, pages 130–141, 1998.
W. Zhang and P. Larson. Dynamic memory adjustment for external mergesort. The VLDB Journal, pages 376–385, 1997.