<h2>LIPIcs, Volume 328, ICDT 2025</h2>
<ul>
<li>
<span class="authors">Sudeepa Roy and Ahmet Kara</span>
<span class="title">LIPIcs, Volume 328, ICDT 2025, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025">10.4230/LIPIcs.ICDT.2025</a>
</li>
<li>
<span class="authors">Sudeepa Roy and Ahmet Kara</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.0">10.4230/LIPIcs.ICDT.2025.0</a>
</li>
<li>
<span class="authors">Paraschos Koutris, Shaleen Deep, Austen Fan, and Hangdong Zhao</span>
<span class="title">The Quest for Faster Join Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.1">10.4230/LIPIcs.ICDT.2025.1</a>
</li>
<li>
<span class="authors">Alexandra Meliou, Azza Abouzied, Peter J. Haas, Riddho R. Haque, Anh Mai, and Vasileios Vittis</span>
<span class="title">Data Management Perspectives on Prescriptive Analytics (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.2">10.4230/LIPIcs.ICDT.2025.2</a>
</li>
<li>
<span class="authors">Szymon Toruńczyk</span>
<span class="title">Evaluating First-Order Formulas in Structured Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.3">10.4230/LIPIcs.ICDT.2025.3</a>
</li>
<li>
<span class="authors">Steffen van Bergerem and Nicole Schweikardt</span>
<span class="title">Learning Aggregate Queries Defined by First-Order Logic with Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.4">10.4230/LIPIcs.ICDT.2025.4</a>
</li>
<li>
<span class="authors">George Konstantinidis and Fabio Mogavero</span>
<span class="title">Bag Containment of Join-On-Free Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.5">10.4230/LIPIcs.ICDT.2025.5</a>
</li>
<li>
<span class="authors">Heba Aamer and Bas Ketsman</span>
<span class="title">PAC: Computing Join Queries with Semi-Covers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.6">10.4230/LIPIcs.ICDT.2025.6</a>
</li>
<li>
<span class="authors">Junhao Gan, Anthony Wirth, and Zhuo Zhang</span>
<span class="title">O(1)-Round MPC Algorithms for Multi-Dimensional Grid Graph Connectivity, Euclidean MST and DBSCAN</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.7">10.4230/LIPIcs.ICDT.2025.7</a>
</li>
<li>
<span class="authors">Batya Kenig and Dan Shlomo Mizrahi</span>
<span class="title">Enumeration of Minimal Hitting Sets Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.8">10.4230/LIPIcs.ICDT.2025.8</a>
</li>
<li>
<span class="authors">Martin Grohe, Christoph Standke, Juno Steegmans, and Jan Van den Bussche</span>
<span class="title">Query Languages for Neural Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.9">10.4230/LIPIcs.ICDT.2025.9</a>
</li>
<li>
<span class="authors">Yufei Tao</span>
<span class="title">Maximizing the Optimality Streak of Deferred Data Structuring (a.k.a. Database Cracking)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.10">10.4230/LIPIcs.ICDT.2025.10</a>
</li>
<li>
<span class="authors">Dan Suciu, Yisu Remy Wang, and Yihong Zhang</span>
<span class="title">Semantic Foundations of Equality Saturation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.11">10.4230/LIPIcs.ICDT.2025.11</a>
</li>
<li>
<span class="authors">Ahmet Kara, Zheng Luo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang</span>
<span class="title">Tractable Conjunctive Queries over Static and Dynamic Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.12">10.4230/LIPIcs.ICDT.2025.12</a>
</li>
<li>
<span class="authors">Manuel Bodirsky and Florian Starke</span>
<span class="title">Symmetric Linear Arc Monadic Datalog and Gadget Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.13">10.4230/LIPIcs.ICDT.2025.13</a>
</li>
<li>
<span class="authors">Youri Kaminsky, Benny Kimelfeld, Ester Livshits, Felix Naumann, and David Wajc</span>
<span class="title">Repairing Databases over Metric Spaces with Coincidence Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.14">10.4230/LIPIcs.ICDT.2025.14</a>
</li>
<li>
<span class="authors">Balder ten Cate, Phokion G. Kolaitis, and Carsten Lutz</span>
<span class="title">Query Repairs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.15">10.4230/LIPIcs.ICDT.2025.15</a>
</li>
<li>
<span class="authors">Qin Zhang and Mohsen Heidari</span>
<span class="title">Quantum Data Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.16">10.4230/LIPIcs.ICDT.2025.16</a>
</li>
<li>
<span class="authors">Kyle Deeds and Timo Camillo Merkl</span>
<span class="title">Partition Constraints for Conjunctive Queries: Bounds and Worst-Case Optimal Joins</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.17">10.4230/LIPIcs.ICDT.2025.17</a>
</li>
<li>
<span class="authors">Cristian Riveros, Markus L. Schmid, and Nicole Schweikardt</span>
<span class="title">A Framework for Extraction and Transformation of Documents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.18">10.4230/LIPIcs.ICDT.2025.18</a>
</li>
<li>
<span class="authors">Luis Alberto Croquevielle, Guang Yang, Liang Liang, Ali Hadian, and Thomas Heinis</span>
<span class="title">Beyond Logarithmic Bounds: Querying in Constant Expected Time with Learned Indexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.19">10.4230/LIPIcs.ICDT.2025.19</a>
</li>
<li>
<span class="authors">Benny Kimelfeld, Wim Martens, and Matthias Niewerth</span>
<span class="title">A Formal Language Perspective on Factorized Representations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.20">10.4230/LIPIcs.ICDT.2025.20</a>
</li>
<li>
<span class="authors">Vasileios Nakos, Hung Q. Ngo, and Charalampos E. Tsourakakis</span>
<span class="title">Targeted Least Cardinality Candidate Key for Relational Databases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.21">10.4230/LIPIcs.ICDT.2025.21</a>
</li>
<li>
<span class="authors">Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, and Cristina Sirangelo</span>
<span class="title">Queries with External Predicates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.22">10.4230/LIPIcs.ICDT.2025.22</a>
</li>
<li>
<span class="authors">Florent Capelli, Oliver Irwin, and Sylvain Salvati</span>
<span class="title">A Simple Algorithm for Worst Case Optimal Join and Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.23">10.4230/LIPIcs.ICDT.2025.23</a>
</li>
<li>
<span class="authors">Daniel Neider, Leif Sabellek, Johannes Schmidt, Fabian Vehlken, and Thomas Zeume</span>
<span class="title">Learning Tree Pattern Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.24">10.4230/LIPIcs.ICDT.2025.24</a>
</li>
<li>
<span class="authors">Xiao Hu and Zhiang Wu</span>
<span class="title">Optimal Oblivious Algorithms for Multi-Way Joins</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.25">10.4230/LIPIcs.ICDT.2025.25</a>
</li>
<li>
<span class="authors">Pierre Bourhis, Florent Capelli, Stefan Mengel, and Cristian Riveros</span>
<span class="title">Dynamic Direct Access of MSO Query Evaluation over Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.26">10.4230/LIPIcs.ICDT.2025.26</a>
</li>
<li>
<span class="authors">Simon Frisk and Paraschos Koutris</span>
<span class="title">Parallel Query Processing with Heterogeneous Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.27">10.4230/LIPIcs.ICDT.2025.27</a>
</li>
<li>
<span class="authors">Paraschos Koutris</span>
<span class="title">Generalized Covers for Conjunctive Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.28">10.4230/LIPIcs.ICDT.2025.28</a>
</li>
<li>
<span class="authors">Owen M. Bell, Joel D. Day, and Dominik D. Freydenberger</span>
<span class="title">FC-Datalog as a Framework for Efficient String Querying</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.29">10.4230/LIPIcs.ICDT.2025.29</a>
</li>
<li>
<span class="authors">Kuldeep S. Meel and Alexis de Colnet</span>
<span class="title">An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.30">10.4230/LIPIcs.ICDT.2025.30</a>
</li>
<li>
<span class="authors">Alessandro Artale, Anton Gnatenko, Vladislav Ryzhikov, and Michael Zakharyaschev</span>
<span class="title">On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.31">10.4230/LIPIcs.ICDT.2025.31</a>
</li>
<li>
<span class="authors">Conor Power, Paraschos Koutris, and Joseph M. Hellerstein</span>
<span class="title">The Free Termination Property of Queries over Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.32">10.4230/LIPIcs.ICDT.2025.32</a>
</li>
<li>
<span class="authors">Silviu Maniu and Pierre Senellart</span>
<span class="title">Database Theory in Action: Making Provenance and Probabilistic Database Theory Work in Practice (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.33">10.4230/LIPIcs.ICDT.2025.33</a>
</li>
<li>
<span class="authors">Yihong Zhang, Dan Suciu, Yisu Remy Wang, and Max Willsey</span>
<span class="title">Database Theory in Action: Search-Based Program Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.34">10.4230/LIPIcs.ICDT.2025.34</a>
</li>
<li>
<span class="authors">Eugene Wu</span>
<span class="title">Database Theory in Action: Database Visualization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.35">10.4230/LIPIcs.ICDT.2025.35</a>
</li>
<li>
<span class="authors">Amélie Gheerbrant, Leonid Libkin, Liat Peterfreund, and Alexandra Rogova</span>
<span class="title">Database Theory in Action: Cypher, GQL, and Regular Path Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2025.36">10.4230/LIPIcs.ICDT.2025.36</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing