A bisimulation-invariant synthesis framework for optimal predicate pushdown in fold-based UDFs produces correct transformations that speed up 150 real pipelines by 2.4x on average.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
baseline 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Co-evolving LLM-generated solutions with their evaluators enables discovery of novel database algorithms that outperform state-of-the-art baselines, including a query rewrite policy with up to 6.8x lower latency.
citing papers explorer
-
Optimal Predicate Pushdown Synthesis
A bisimulation-invariant synthesis framework for optimal predicate pushdown in fold-based UDFs produces correct transformations that speed up 150 real pipelines by 2.4x on average.
-
AI-Driven Research for Databases
Co-evolving LLM-generated solutions with their evaluators enables discovery of novel database algorithms that outperform state-of-the-art baselines, including a query rewrite policy with up to 6.8x lower latency.