preprint · arXiv (Cornell University) · 2014
Enabling Incremental Query Re-Optimization
Mengmeng Liu, Zachary G. Ives, Boon Thau Loo
Cited by 1Open access
Abstract
As declarative query processing techniques expand in scope --- to the Web, data streams, network routers, and cloud platforms --- there is an increasing need for adaptive query processing techniques that can re-plan in the presence of failures or unanticipated performance changes. A status update on the data distributions or the compute nodes may have significant repercussions on the choice of which query plan should be running. Ideally, new system architectures would be able to make cost-based decisions about reallocating work, migrating data, etc., and react quickly as real-time status information becomes available. Existing cost-based query optimizers are not incremental in nature, and must be run "from scratch" upon each status or cost update. Hence, they generally result in adaptive schemes that can only react slowly to updates. An open question has been whether it is possible to build a cost-based re-optimization architecture for adaptive query processing in a streaming or repeated query execution environment, e.g., by incrementally updating optimizer state given new cost information. We show that this can be achieved beneficially, especially for stream processing workloads. Our techniques build upon the recently proposed approach of formulating query plan enumeration as a set of recursive datalog queries; we develop a variety of novel optimization approaches to ensure effective pruning in both static and incremental cases. We implement our solution within an existing research query processing system, and show that it effectively supports cost-based initial optimization as well as frequent adaptivity.
Cite this paper
Liu, M., Ives, Z. G., & Loo, B. T. (2014). Enabling Incremental Query Re-Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1409.6288
Liu, Mengmeng, et al. “Enabling Incremental Query Re-Optimization.” arXiv (Cornell University), 2014, https://doi.org/10.48550/arxiv.1409.6288.
Liu, Mengmeng, Zachary G. Ives, and Boon Thau Loo. 2014. “Enabling Incremental Query Re-Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1409.6288.
Liu, M., Ives, Z.G. and Loo, B.T. (2014) ‘Enabling Incremental Query Re-Optimization’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.1409.6288.
@misc{liu2014enabling,
title = {{Enabling Incremental Query Re-Optimization}},
author = {Liu, Mengmeng and Ives, Zachary G. and Loo, Boon Thau},
journal = {arXiv (Cornell University)},
year = {2014},
doi = {10.48550/arxiv.1409.6288}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Distributed Query Plan Generation using Ant Colony Optimization
T. V. Vijay Kumar, Rahul Singh, Amit Kumar · International Journal of Applied Metaheuristic Computing · 2015
Cited by 12
Generating Query Plans for Distributed Query Processing Using Genetic Algorithm
T. V. Vijay Kumar, Shina Panicker · Lecture notes in computer science · 2011
Cited by 4
A Data-Driven Query Processing Method for Stream Data
Meekyung Min · Journal of Digital Contents Society · 2007
Cited by 0
Analysis of Query Optimizers
Ramineni Sharath Kumar · Journal of Computer Engineering and Information Technology · 2021
Cited by 0
View-based Query Processing for Semistructured Data.
Diego Calvanese · Open Research (University of Surrey) · 2003
Cited by 0
Investigating and Influencing the Optimizer
Ken England, Gavin Powell · Elsevier eBooks · 2007
Cited by 0
Cost-Based Query Optimization in Centralized Relational Databases
Nawaraj Paudel, Jagdish Bhatta · Journal of Institute of Science and Technology · 2019
Cited by 3Open access
Learned Query Superoptimization
Ryan Marcus · arXiv (Cornell University) · 2023
Cited by 5Open access