Adaptive Query Processing surveys the fundamental issues, techniques, costs, and benefits of adaptive query processing. It begins with a broad overview of the field, identifying the dimensions of adaptive techniques. It then looks at the spectrum of approaches available to adapt query execution at runtime - primarily in a non-streaming context. The emphasis is on simplifying and abstracting the key concepts of each technique, rather than reproducing the full details available in the papers. The authors identify the strengths and limitations of the different techniques, demonstrate when they are most useful, and suggest possible avenues of future research. Adaptive Query Processing serves as a valuable reference for students of databases, providing a thorough survey of the area. Database researchers will benefit from a more complete point of view, including a number of approaches which they may not have focused on within the scope of their own research.
Cited By
- Ding B, Chaudhuri S, Gehrke J and Narasayya V (2021). DSB, Proceedings of the VLDB Endowment, 14:13, (3376-3388), Online publication date: 1-Sep-2021.
- Alur R, Hilliard P, Ives Z, Kallas K, Mamouras K, Niksic F, Stanford C, Tannen V and Xue A Synchronization Schemas Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (1-18)
- Mhedhbi A, Kankanamge C and Salihoglu S (2021). Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins, ACM Transactions on Database Systems, 46:2, (1-45), Online publication date: 1-Jun-2021.
- Dutt A, Neelam S and Haritsa J (2014). QUEST, Proceedings of the VLDB Endowment, 7:13, (1585-1588), Online publication date: 1-Aug-2014.
- Dutt A and Haritsa J Plan bouquets Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, (1039-1050)
- Ng B and Prakash A Let the Right One in Proceedings of the 9th International Conference on Information Systems Security - Volume 8303, (297-313)
- Abhirama M, Bhaumik S, Dey A, Shrimal H and Haritsa J (2010). On the stability of plan costs and the costs of plan stability, Proceedings of the VLDB Endowment, 3:1-2, (1137-1148), Online publication date: 1-Sep-2010.
Recommendations
View-based query processing: On the relationship between rewriting, answering and losslessness
As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
Adaptive query processing
As the data management field has diversified to consider settings in which queries are increasingly complex, statistics are less available, or data is stored remotely, there has been an acknowledgment that the traditional optimize-then-execute paradigm ...