VerdictDB: Universalizing Approximate Query Processing

Abstract

Despite 25 years of research in academia, approximate query processing (AQP) has had little industrial adoption. One of the major causes of this slow adoption is the reluctance of traditional vendors to make radical changes to their legacy codebases, and the preoccupation of newer vendors (e.g., SQL-on-Hadoop products) with implementing standard features. Additionally, the few AQP engines that are available are each tied to a specific platform and require users to completely abandon their existing databases---an unrealistic expectation given the infancy of the AQP technology. Therefore, we argue that a universal solution is needed: a database-agnostic approximation engine that will widen the reach of this emerging technology across various platforms. Our proposal, called VerdictDB, uses a middleware architecture that requires no changes to the backend database, and thus, can work with all off-the-shelf engines. Operating at the driver-level, VerdictDB intercepts analytical queries issued to the database and rewrites them into another query that, if executed by any standard relational engine, will yield sufficient information for computing an approximate answer. VerdictDB uses the returned result set to compute an approximate answer and error estimates, which are then passed on to the user or application. However, lack of access to the query execution layer introduces significant challenges in terms of generality, correctness, and efficiency. This paper shows how VerdictDB overcomes these challenges and delivers up to 171$\times$ speedup (18.45$\times$ on average) for a variety of existing engines, such as Impala, Spark SQL, and Amazon Redshift, while incurring less than 2.6% relative error. VerdictDB is open-sourced under Apache License.

arXiv commentExtended technical report of the paper that appeared in Proceedings of the 2018 International Conference on Management of Data, pp. 1461-1476. ACM, 2018

References in corpus (1)

• Database Learning: Toward a Database that Becomes Smarter Every Time

Cited by in corpus (9)

• Are We Ready For Learned Cardinality Estimation?
• Physical Representation-based Predicate Optimization for a Visual Analytics Database
• BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guarantees
• Learning to Sample: Counting with Complex Queries
• Electra: Conditional Generative Model based Predicate-Aware Query Approximation
• Adaptive Learning of Aggregate Analytics under Dynamic Workloads
• Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases
• PairwiseHist: Fast, Accurate and Space-Efficient Approximate Query Processing with Data Compression
• PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees (Technical Report)