2 papers
cs.DB2024
Learned Graph Rewriting with Equality Saturation: A New Paradigm in Relational Query Rewrite and Beyond
George-Octavian Bărbulescu, Taiyi Wang, Zak Singh +1
Query rewrite systems perform graph substitutions using rewrite rules to generate optimal SQL query plans. Rewriting logical and physical relational query plans is proven to be an…
cs.AI2023
MCTS-GEB: Monte Carlo Tree Search is a Good E-graph Builder
Guoliang He, Zak Singh, Eiko Yoneki
Rewrite systems [6, 10, 12] have been widely employing equality saturation [9], which is an optimisation methodology that uses a saturated e-graph to represent all possible sequenc…