Year: 2016
Type: conference-paper
Abstract: As declarative query processing techniques expand to the Web, data streams, network routers, and cloud platforms, there is an increasing need to re-plan execution in the presence of unanticipated performance changes. New runtime information may affect which query plan we prefer to run. Adaptive techniques require innovation both in terms of the algorithms used to estimate costs, and in terms of the search algorithm that finds the best plan. We investigate how to build a cost-based optimizer that recomputes the optimal plan incrementally given new cost information, much as a stream engine constantly updates its outputs given new data. Our implementation especially shows benefits for stream processing workloads. It lays the foundations upon which a variety of novel adaptive optimization algorithms can be built. We start by leveraging 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 further show that the lessons learned in the declarative implementation can be equally applied to more traditional optimizer implementations.
Authors: Mengmeng Liu, Zachary G. Ives, Boon Thau Loo
Institution: University of Pennsylvania
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Awards: NeTS: Small: Routing Design and Analysis with Incomplete Information, III: Distributed Stream Integration, CICI: Data Provenance: Provenance-Based Trust Management for Collaborative Data Curation, CAREER: Towards a Unified Declarative Platform for Composable Verifiable Networks, Approximating and Reasoning about Data Provenance, III: EAGER: Data Integration as a Dialogue with the User, NeTS: Medium: Collaborative Research: DEFIND: DEclarative Formal Interative Network Design
OpenAlex ID: W2396268601
