SkinnerMT: Parallelizing for Efficiency and Robustness in Adaptive Query Processing on Multicore Platforms
Ziyun Wei, Immanuel Trummer
Abstract
SkinnerMT is an adaptive query processing engine, specialized for multi-core platforms. SkinnerMT features different strategies for parallel processing that allow users to trade between average run time and performance robustness. First, SkinnerMT supports execution strategies that execute multiple query plans in parallel, thereby reducing the risk to find near-optimal plans late and improving robustness. Second, SkinnerMT supports data-parallel processing strategies. Its parallel multi-way join algorithm is sensitive to the assignment from tuples to threads. Here, SkinnerMT uses a cost-based optimization strategy, based on runtime feedback. Finally, SkinnerMT supports hybrid processing methods, mixing parallel search with data-parallel processing. The experiments show that parallel search increases robustness while parallel processing increases average-case performance. The hybrid approach combines advantages from both. Compared to traditional database systems, SkinnerMT is preferable for benchmarks where query optimization is hard. Compared to prior adaptive processing baselines, SkinnerMT exploits parallelism better.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ab96f342-1ffd-4a79-9be9-960026c2b2f4Cited by top-tier papers3
- POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least ResistanceDavid Justen, Daniel Ritter, Campbell Fraser, Andrew Lamb et al.VLDB 2024 · 11 citations
- ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement LearningJunxiong Wang, Immanuel Trummer, Ahmet Kara, Dan OlteanuVLDB 2023 · 10 citations
- Themis: A GPU-accelerated Relational Query Execution EngineKijae Hong, Kyoungmin Kim, Young-Koo Lee, Yang-Sae Moon et al.VLDB 2025 · 5 citations
Builds on3
- Bao: Making Learned Query Optimization PracticalRyan Marcus, Parimarjan Negi, Hongzi Mao, Nesime Tatbul et al.SIGMOD 2021 · 242 citations
- Learning a Partitioning Advisor for Cloud DatabasesBenjamin Hilprecht, Carsten Binnig, Uwe RöhmSIGMOD 2020 · 64 citations
- Permutable Compiled Queries: Dynamically Adapting Compiled Queries without RecompilingPrashanth Menon, Amadou Ngom, Todd C. Mowry, Andrew Pavlo et al.VLDB 2021 · 26 citations
Related papers
- ROME: Robust Query Optimization via Parallel Multi-Plan ExecutionZiyun Wei, Immanuel TrummerSIGMOD 2024 · 4 citations
- Scalable Multi-Query Execution using Reinforcement LearningPanagiotis Sioulas, Anastasia AilamakiSIGMOD 2021 · 18 citations
- Adaptive Recursive Query OptimizationAnna Herlihy, Guillaume Martres, Anastasia Ailamaki, Martin OderskyICDE 2024 · 5 citations
- A Scalable and Generic Approach to Range JoinsMaximilian Reif, Thomas NeumannVLDB 2022 · 6 citations
- ADAMANT: A Query Executor with Plug-In Interfaces for Easy Co-processor IntegrationBala Gurumurthy, David Broneske, Gabriel Campero Durand, Thilo Pionteck et al.ICDE 2023 · 1 citation
