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.
How good are query optimizers, really?
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
iPDB adds a predict operator and semantic query optimizations to SQL so that LLM and ML calls run efficiently inside the database, delivering 2.5x average and up to 30x speedup over prior systems.
RELOAD achieves up to 2.4x higher robustness and 3.1x greater efficiency than prior RL-based query optimizers on Join Order Benchmark, TPC-DS, and Star Schema Benchmark.
Enzyme automates incremental maintenance of materialized views in Spark pipelines via cost-based optimization, achieving billions of daily CPU-second reductions across thousands of production workloads.
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.
-
iPDB -- Optimizing Semantic SQL Queries
iPDB adds a predict operator and semantic query optimizations to SQL so that LLM and ML calls run efficiently inside the database, delivering 2.5x average and up to 30x speedup over prior systems.
-
RELOAD: A Robust and Efficient Learned Query Optimizer for Database Systems
RELOAD achieves up to 2.4x higher robustness and 3.1x greater efficiency than prior RL-based query optimizers on Join Order Benchmark, TPC-DS, and Star Schema Benchmark.
-
Enzyme: Incremental View Maintenance for Data Engineering
Enzyme automates incremental maintenance of materialized views in Spark pipelines via cost-based optimization, achieving billions of daily CPU-second reductions across thousands of production workloads.