Skip to content
Book Open access

DBRepro: Automated Database Synthesis via a Hybrid Constraint-Solving Approach for Reproducing Slow Queries

Aug 2026 · Proceedings of the 41st IEEE/ACM International Conference on Automated Software Engineering · 0 citations · 64 references
Computer Science

TL;DR

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.

Abstract

Slow queries frequently cause severe performance bottlenecks in Database Management Systems (DBMSs). Due to the severe risk of exacerbating online resource contention, diagnosing their root causes online is usually infeasible; offline diagnosis has thus become the de facto approach. However, strict data privacy regulations prohibit accessing original user data. Therefore, synthesizing a proxy database, one that induces the query optimizer to generate identical physical execution plans as in production, from non-intrusive metadata, is critical for reproducing and diagnosing slow queries offline. Achieving high-fidelity reproduction demands satisfying both global statistical distributions and exact local cardinality constraints. Existing works fundamentally fail to achieve both simultaneously: data-driven approaches cannot enforce strict local cardinalities, whereas workload-aware approaches severely distort the overall data distribution, misleading the optimizer into divergent execution plans. To bridge this gap, we introduce DBRepro, an automated end-to-end database synthesis framework that synergistically integrates data-driven and workload-aware methodologies. DBRepro formulates database generation as a constrained distribution synthesis problem. It initializes a global data distribution from lightweight column statistics, extracts execution constraints from the target queries, and progressively adjusts the distribution to satisfy these constraints, ensuring the global distribution is maximally preserved while exact local cardinalities are strictly enforced. Extensive evaluations on the TPC-H and SSB benchmarks demonstrate that DBRepro outperforms state-of-the-art baselines across comprehensive fidelity metrics. Compared to the data-driven baseline, it reduces cardinality error by up to 20.3% while maintaining identical plan consistency. Against a workload-aware baseline, it reproduces 15% more consistent execution plans and lowers the latency proportion error by 21.5%. Furthermore, we validate its industrial practicality on a nearly 1 TB real-world dataset from a specific industrial sector, managed by KingbaseES, successfully reproducing the execution performance of complex slow queries with high fidelity.

Read PDF

Similar papers

Open access Sep 2026

MimicDB: Runtime Defense against Wrong-Result Bugs in Database Query Optimizers via Query-Rewriting Diversity

These findings characterize the potential of single-engine diversity to detect wrong-result failures and select correct results, together with the execution costs and reference-validity constraints that shape its practical use.

Ze-Lin Wang, Ping Chen, Jin Wei et al. · 0 citations
Conference Aug 2026

Assessing the Impact of CQRS Pattern Implementation on Query Latency in .NET Blazor CRUD Systems

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 · 0 citations
Open access 2024

HYPERION-Q: A Graph-Guided Self-Validating and Hardware-Aware Framework for High-Performance Query Processing

Modern data management systems must simultaneously address three critical challenges: efficient query optimization for large queries, reliable detection of logical errors in database engines, and high-performance processing across heterogeneous hardware architectures. Traditional query optimizers rely on dynamic progra...

Praveen Kumar Kumbum, Ramachandra Reddy Vangala · 0 citations
Preprint Aug 2026

EXPLAIN Yourself! Finding Query Planner Stalls Across DBMSes

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
Preprint Sep 2026

Distribution-Aware Distributed Database Testing (Extended Version)

DAT (Distribution-Aware Testing) is proposed, a novel automated approach for detecting query-processing bugs related to distribution strategies and distributed optimizations in DDBMSs, by systematically leveraging distribution-aware information throughout the testing pipeline.

Zhou Zhou, Si Liu, Heng-Feng Wei et al. · 0 citations
Preprint Oct 2026

Prune First, Decide Fast: Scalable Semantic Query Processing with JEVDB

Semantic database systems extend SQL with foundation-model inference over unstructured data, but current engines rely heavily on autoregressive LLMs for discrete relational decisions, creating high latency and monetary cost. We present JEVDB, a scalable semantic database system that uses fast, typed decision models for...

Zheng-Le Wang, Han-Xu Yan, Fuheng Zhao et al. · 3 citations · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.