<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Conference Paper</dc:product_type><dc:title>Database Theory in Action: Search-Based Program Optimization</dc:title><dc:creator>Zhang, Yihong; Suciu, Dan; Wang, Yisu Remy; Willsey, Max</dc:creator><dc:corporate_author/><dc:editor>Roy, Sudeepa; Kara, Ahmet</dc:editor><dc:description>Recent work in programming languages developed an approach to term rewritings based on equality saturation (EqSat), which, instead of applying destructively the rewrite rules, maintains all equivalent expressions in a structure called an E-graph. This paper describes two surprising connections between EqSat and databases, going both ways. On one hand equality saturation can be viewed as a query evaluation problem, with great benefits. On the other hand, most sophisticated SQL query optimizers are based on the Volcano/Cascades framework which, we explain, is a variant of EqSat.</dc:description><dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher><dc:date>2025-01-01</dc:date><dc:nsf_par_id>10627114</dc:nsf_par_id><dc:journal_name/><dc:journal_volume>328</dc:journal_volume><dc:journal_issue/><dc:page_range_or_elocation>34:1-34:6</dc:page_range_or_elocation><dc:issn>1868-8969</dc:issn><dc:isbn>978-3-95977-364-5</dc:isbn><dc:doi>https://doi.org/10.4230/LIPICS.ICDT.2025.34</dc:doi><dcq:identifierAwardId>2312195</dcq:identifierAwardId><dc:subject>Query optimization</dc:subject><dc:subject>program optimization</dc:subject><dc:subject>Cascades framework</dc:subject><dc:subject>equality saturation</dc:subject><dc:subject>Datalog</dc:subject><dc:subject>Theory of computation → Equational logic and rewriting</dc:subject><dc:subject>Theory of computation → Database query processing and optimization (theory)</dc:subject><dc:size>6 pages</dc:size><dc:size>793211 bytes</dc:size><dc:format>application/pdf</dc:format><dc:version_number/><dc:location/><dc:rights>Creative Commons Attribution 4.0 International license; info:eu-repo/semantics/openAccess</dc:rights><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>