Sub-optimal Join Order Identification with L1-error
Abstract
References
Index Terms
- Sub-optimal Join Order Identification with L1-error
Recommendations
Query optimization through the looking glass, and what we found running the Join Order Benchmark
Finding a good join order is crucial for query performance. In this paper, we introduce the Join Order Benchmark that works on real-life data riddled with correlations and introduces 113 complex join queries. We experimentally revisit the main ...
Index-Based Join Size Estimation Using Adaptive Sampling
SIGMOD '21: Proceedings of the 2021 International Conference on Management of DataCost-based query optimizers rely on cardinality estimates of intermediate results to avoid suboptimal query execution plans. However, when confronted with ad-hoc queries on big data, said optimizers can produce large estimation errors, resulting in ...
Deep Reinforcement Learning for Join Order Enumeration
aiDM'18: Proceedings of the First International Workshop on Exploiting Artificial Intelligence Techniques for Data ManagementJoin order selection plays a significant role in query performance. However, modern query optimizers typically employ static join order enumeration algorithms that do not incorporate feedback about the quality of the resulting plan. Hence, optimizers ...
Comments
Information & Contributors
Information
Published In
![cover image Proceedings of the ACM on Management of Data](/cms/asset/5efd8460-328c-428c-bffb-ccc00010f106/3654807.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSF
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 238Total Downloads
- Downloads (Last 12 months)238
- Downloads (Last 6 weeks)44
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in