ReSequel uses LLMs guided by metadata-derived templates and sampling-based verification to rewrite SQL queries, delivering up to 16x workload speedups over native DBMSs and 22x over prior LLM baselines across eight benchmarks and three systems.
InProceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pages 1–10, 1995
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.DB 3years
2026 3representative citing papers
TOKI types four common contradiction-resolution heuristics as bitemporal operators on a dual-row schema, supplies soundness theorems, and shows via a verdict matrix that it alone avoids three write-time anomalies while retaining a language-model judge.
The paper introduces certified virtual cuts and proves per-key replay equality for wellformed DBLog runs, with all proofs machine-checked in Isabelle/HOL.
citing papers explorer
-
ReSequel: Robust LLM-assisted Query Rewriting and Optimization using Templatization and Sampling
ReSequel uses LLMs guided by metadata-derived templates and sampling-based verification to rewrite SQL queries, delivering up to 16x workload speedups over native DBMSs and 22x over prior LLM baselines across eight benchmarks and three systems.
-
TOKI: A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memory
TOKI types four common contradiction-resolution heuristics as bitemporal operators on a dual-row schema, supplies soundness theorems, and shows via a verdict matrix that it alone avoids three write-time anomalies while retaining a language-model judge.
-
A Theoretical Study of DBLog: Certified Virtual Cuts for a Snapshot-Equivalent Replay of Live Databases
The paper introduces certified virtual cuts and proves per-key replay equality for wellformed DBLog runs, with all proofs machine-checked in Isabelle/HOL.