Jul 2026· Proceedings of the VLDB Endowment· Vol abs/2607.20630· 0 citations· 12 references
Computer Science
TL;DR
GenDB, a generative query engine that shifts query processing from manually engineered systems to query processing code generation driven by Large Language Models (LLMs), is demonstrated and the current limitations of GenDB are discussed to inform future extensions.
Abstract
Traditional query processing engines require continuous development and extensions to support new techniques and user requirements, and in some cases, entirely new systems must be built from scratch. However, these engines are difficult to extend due to their internal complexity, and building new systems demands significant engineering effort and cost. To address this, we demonstrate GenDB, a generative query engine that shifts query processing from manually engineered systems to query processing code generation driven by Large Language Models (LLMs). An early prototype of GenDB uses LLM agents to generate instance-optimized query execution code tailored to specific data, workloads, and hardware resources. This prototype suits offline code generation for repetitive, templated queries, since the upfront generation cost amortizes over many executions and correctness can be ensured through extensive fuzz testing and manual inspection. For ad-hoc queries, GenDB can work with a traditional DBMS in a hybrid architecture: the DBMS handles one-off queries, while GenDB speeds up frequent SQL templates. We also discuss the current limitations of GenDB, such as high generation cost and the lack of correctness guarantees, to inform future extensions. Our demonstration allows users to (1) visually and interactively explore how GenDB analyzes workloads, profiles hardware resources and underlying data, produces query plans, generates code based on them, and finally uses an optimizer to iteratively achieve a correct and efficient implementation; (2) use visual inspection and analysis to gain qualitative insights into why GenDB produces code that achieves significantly better performance than state-of-the-art query engines on two benchmarks: TPC-H and a newly constructed benchmark designed to reduce potential data leakage from LLM training data; and (3) upload their own data and queries to explore GenDB with different LLMs and query patterns. A live demo is available at https://solidlao.github.io/GenDB/demo/.
An LLM-based query tuning tool for Microsoft SQL Server that takes as input a query, tuning constraints such as minimum required improvement and time budget, and automatically recommends semantically equivalent query rewrites that improve the execution time of the query.
Kukjin Lee, Anshuman Dutt, Vivek R. Narasayya et al.· Proceedings of the VLDB Endo...· 0 citations
DBcover is proposed, an LLM-driven database test generation framework that performs white-box, code-aware SQL test generation through contextual reasoning, and substantially outperforms existing fuzzers.
Yan-Kai Rong, Shuang Liu, Jin-Hao Dong et al.· Proceedings of the 2026 IEEE...· 0 citations
This work presents AutoSQL, a system that reconstructs SQL templates from Go ORM code that constructs a Code Index, a directed graph that captures structural dependencies between functions, types, and global variables as navigable edges and synthesizes SQL templates.
Jun-Song Pu, Yi-Chen Li, Zhuang-Bin Chen et al.· Proceedings of the 41st IEEE...· 0 citations
The Domain-Oriented Tooling Pattern is proposed: instead of generating SQL at query time, the model selects from a small set of domain-aligned tools whose parameterized queries encapsulate schema navigation, joins and business rules on the server side.
A low-latency MLIR compilation backend based on TPDE that by-passes the LLVM lowering and compilation pipeline is introduced and techniques that reduce MLIR’s intrinsic overhead are proposed.
Jonas Ladner, Lukas Döllerer, Alexis Engelke et al.· 0 citations