SkinnerDB: Regret-bounded Query Evaluation via Reinforcement Learning.
Uloženo v:
| Název: | SkinnerDB: Regret-bounded Query Evaluation via Reinforcement Learning. |
|---|---|
| Autoři: | TRUMMER, IMMANUEL, JUNXIONG WANG, ZIYUN WEI, MARAM, DEEPAK, MOSELEY, SAMUEL, JO, SAEHAN, ANTONAKAKIS, JOSEPH, RAYABHARI, ANKUSH |
| Zdroj: | ACM Transactions on Database Systems; Sep2021, Vol. 46 Issue 3, p1-45, 45p |
| Témata: | REINFORCEMENT learning, DATABASES, DATA structures, INFORMATION storage & retrieval systems, NEWSVENDOR model |
| Abstrakt: | SkinnerDB uses reinforcement learning for reliable join ordering, exploiting an adaptive processing engine with specialized join algorithms and data structures. It maintains no data statistics and uses no cost or cardinality models. Also, it uses no training workloads nor does it try to link the current query to seemingly similar queries in the past. Instead, it uses reinforcement learning to learn optimal join orders from scratch during the execution of the current query. To that purpose, it divides the execution of a query intomany small time slices. Different join orders are tried in different time slices. SkinnerDB merges result tuples generated according to different join orders until a complete query result is obtained. By measuring execution progress per time slice, it identifies promising join orders as execution proceeds. Along with SkinnerDB, we introduce a new quality criterion for query execution strategies. We upperbound expected execution cost regret, i.e., the expected amount of execution cost wasted due to sub-optimal join order choices. SkinnerDB features multiple execution strategies that are optimized for that criterion. Some of them can be executed on top of existing database systems. For maximal performance, we introduce a customized execution engine, facilitating fast join order switching via specialized multi-way join algorithms and tuple representations. We experimentally compare SkinnerDB's performance against various baselines, including MonetDB, Postgres, and adaptive processing methods.We consider various benchmarks, including the join order benchmark, TPC-H, and JCC-H, as well as benchmark variants with user-defined functions. Overall, the overheads of reliable join ordering are negligible compared to the performance impact of the occasional, catastrophic join order choice. CCS Concepts: * Information systems → Query optimization; Query planning; Join algorithms; [ABSTRACT FROM AUTHOR] |
| Copyright of ACM Transactions on Database Systems is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Databáze: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!