Pith. sign in

REVIEW 4 cited by

LLM-R2: A Large Language Model Enhanced Rule-based Rewrite System for Boosting Query Efficiency

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.12872 v1 pith:NVNDM6JK submitted 2024-04-19 cs.DB cs.CL

classification cs.DBcs.CL
keywords rewritequerymethodsrulesmethodmodelalwaysefficiency
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Query rewrite, which aims to generate more efficient queries by altering a SQL query's structure without changing the query result, has been an important research problem. In order to maintain equivalence between the rewritten query and the original one during rewriting, traditional query rewrite methods always rewrite the queries following certain rewrite rules. However, some problems still remain. Firstly, existing methods of finding the optimal choice or sequence of rewrite rules are still limited and the process always costs a lot of resources. Methods involving discovering new rewrite rules typically require complicated proofs of structural logic or extensive user interactions. Secondly, current query rewrite methods usually rely highly on DBMS cost estimators which are often not accurate. In this paper, we address these problems by proposing a novel method of query rewrite named LLM-R2, adopting a large language model (LLM) to propose possible rewrite rules for a database rewrite system. To further improve the inference ability of LLM in recommending rewrite rules, we train a contrastive model by curriculum to learn query representations and select effective query demonstrations for the LLM. Experimental results have shown that our method can significantly improve the query execution efficiency and outperform the baseline methods. In addition, our method enjoys high robustness across different datasets.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. IDSTune: A Multi-Agent Collaborative Framework for Integrated Database System Tuning

    cs.DB 2026-07 conditional novelty 6.0 of 10

    IDSTune jointly tunes knobs, indexes, and materialized views via coordinated LLM agents, reporting up to 38% latency gains and 57% faster tuning on benchmarks.

  2. When to Vote, When to Rewrite: Disagreement-Guided Strategy Routing for Test-Time Scaling

    cs.AI 2026-04 unverdicted novelty 6.0 of 10

    A disagreement-guided routing framework dynamically selects among resolution, voting, and rewriting strategies for test-time scaling, delivering 3-7% accuracy gains with lower sampling cost on mathematical benchmarks.

  3. MCTuner: Spatial Decomposition-Enhanced Database Tuning via LLM-Guided Exploration

    cs.DB 2025-09 reject novelty 5.0 of 10

    MCTuner reports up to 19.2% performance gains and roughly 1.4x faster discovery of good configurations by combining LLM knob selection with recursive space decomposition and Bayesian optimization.

  4. Training-Free Query Optimization via LLM-Based Plan Similarity

    cs.DB 2025-06 conditional novelty 5.0 of 10

    LLM-PM, a training-free system that transfers optimizer hints from nearest-neighbour LLM plan embeddings, reports a 21.1% total runtime reduction on JOB-CEB over openGauss.

Pith tools