Aug 2026· Proceedings of the VLDB Endowment· 0 citations· 9 references
TL;DR
AQPHub is presented, an extensible framework for plan-based AQP that decouples AQP strategies from specific engines by providing a middleware that leverages a SQL-based interface, requiring minimal effort to port to a new DBMS.
Abstract
Inaccurate cardinality estimation is a major performance bottleneck for many database management systems (DBMS). Plan-based adaptive query processing (AQP) has been widely studied to address this issue, but existing solutions are tightly coupled to specific database engines, making them difficult to reuse or extend. This paper presents
AQPHub
, an extensible framework for plan-based AQP that decouples AQP strategies from specific engines. This is achieved by providing a middleware that leverages a SQL-based interface, requiring minimal effort to port to a new DBMS. Users can easily extend AQPHub by integrating different DBMSs and/or designing different AQP strategies. AQPHub shows negligible overhead while preserving the benefits of the state-of-the-art plan-based AQP methods. Our demonstration scenarios enable attendees to interact through a web interface and explore five database systems on four different AQP strategies and integration levels.
This work adapts Balsa to DuckDB, a vectorized analytical database that lacks both plan hinting and statement-level timeout support, and introduces lightweight portability mechanisms based on SQL-level plan forcing and timeout management for safe exploration.
The results show how established optimization principles can be applied across conceptual, mapping, data-model, and DBMS boundaries in decomposition-based multi-model query processing.
Jáchym Bártík, Filip Štrobl, Irena Holubová· 0 citations
Modern web applications are increasingly reliant on Object-Relational Mapper (ORM) frameworks to bridge the gap between high-level application logic and relational databases. However, in standard Create, Read, Update, and Delete (CRUD) architectures, the use of a unified data model often leads to significant performanc...
Justin Evan Surya, Kenny Jingga· International Conferences on...· 0 citations
DBRepro is presented, an automated end-to-end framework that formulates database generation as a constrained distribution synthesis problem that reproduces the execution performance of complex slow queries with high fidelity on a nearly 1 TB real-world dataset.
Zhao-Yang Zhang, Shuang Liu, Deng-Feng Xu et al.· Proceedings of the 41st IEEE...· 0 citations
This paper presents a structured algorithmic framework for automated physical design tuning in SQL-based relational databases that intelligently parses SQL workloads, identifies syntactically relevant and workload-significant table subsets and column groups, and iteratively refines candidate physical design structures...
Sheshukumar Vangala· International Journal of Int...· 1 citation
It is found that although the queries triggering slow planning are largely DBMS-specific, recurring pathologies involving correlated subqueries, CTE expansion, repeated subquery expressions, disjunctive joins, and constant folding affect multiple systems.
Geoffrey X. Yu, Ryan Marcus, Tim Kraska· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.