<h2>LIPIcs, Volume 290, ICDT 2024</h2>
<ul>
<li>
<span class="authors">Graham Cormode and Michael Shekelyan</span>
<span class="title">LIPIcs, Volume 290, ICDT 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024">10.4230/LIPIcs.ICDT.2024</a>
</li>
<li>
<span class="authors">Graham Cormode and Michael Shekelyan</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.0">10.4230/LIPIcs.ICDT.2024.0</a>
</li>
<li>
<span class="authors">Georgia Koutrika</span>
<span class="title">Natural Language Data Interfaces: A Data Access Odyssey (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.1">10.4230/LIPIcs.ICDT.2024.1</a>
</li>
<li>
<span class="authors">Sudeepa Roy, Amir Gilad, Yihao Hu, Hanze Meng, Zhengjie Miao, Kristin Stephens-Martinez, and Jun Yang</span>
<span class="title">How Database Theory Helps Teach Relational Queries in Database Education (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.2">10.4230/LIPIcs.ICDT.2024.2</a>
</li>
<li>
<span class="authors">Andreas Pieris</span>
<span class="title">Rule-Based Ontologies: From Semantics to Syntax (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.3">10.4230/LIPIcs.ICDT.2024.3</a>
</li>
<li>
<span class="authors">Idan Eldar, Nofar Carmeli, and Benny Kimelfeld</span>
<span class="title">Direct Access for Answers to Conjunctive Queries with Aggregation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.4">10.4230/LIPIcs.ICDT.2024.4</a>
</li>
<li>
<span class="authors">Tamara Cucumides and Juan Reutter</span>
<span class="title">Communication Cost of Joins over Federated Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.5">10.4230/LIPIcs.ICDT.2024.5</a>
</li>
<li>
<span class="authors">Sanjay Krishnan and Stavros Sintos</span>
<span class="title">Range Entropy Queries and Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.6">10.4230/LIPIcs.ICDT.2024.6</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, and Stefan Mengel</span>
<span class="title">Skyline Operators for Document Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.7">10.4230/LIPIcs.ICDT.2024.7</a>
</li>
<li>
<span class="authors">Balder ten Cate, Victor Dalmau, Phokion G. Kolaitis, and Wei-Lin Wu</span>
<span class="title">When Do Homomorphism Counts Help in Query Algorithms?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.8">10.4230/LIPIcs.ICDT.2024.8</a>
</li>
<li>
<span class="authors">Zhewei Wei, Ji-Rong Wen, and Mingji Yang</span>
<span class="title">Approximating Single-Source Personalized PageRank with Absolute Error Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.9">10.4230/LIPIcs.ICDT.2024.9</a>
</li>
<li>
<span class="authors">Balder ten Cate, Víctor Dalmau, and Jakub Opršal</span>
<span class="title">Right-Adjoints for Datalog Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.10">10.4230/LIPIcs.ICDT.2024.10</a>
</li>
<li>
<span class="authors">Sungjin Im, Benjamin Moseley, Hung Ngo, and Kirk Pruhs</span>
<span class="title">On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.11">10.4230/LIPIcs.ICDT.2024.11</a>
</li>
<li>
<span class="authors">Thomas Muñoz Serrano, Cristian Riveros, and Stijn Vansummeren</span>
<span class="title">Enumeration and Updates for Conjunctive Linear Algebra Queries Through Expressibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.12">10.4230/LIPIcs.ICDT.2024.12</a>
</li>
<li>
<span class="authors">Florent Capelli and Oliver Irwin</span>
<span class="title">Direct Access for Conjunctive Queries with Negations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.13">10.4230/LIPIcs.ICDT.2024.13</a>
</li>
<li>
<span class="authors">Martin Grohe, Benny Kimelfeld, Peter Lindner, and Christoph Standke</span>
<span class="title">The Importance of Parameters in Database Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.14">10.4230/LIPIcs.ICDT.2024.14</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Timothy van Bremen, and Kuldeep S. Meel</span>
<span class="title">Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.15">10.4230/LIPIcs.ICDT.2024.15</a>
</li>
<li>
<span class="authors">Hubie Chen and Stefan Mengel</span>
<span class="title">Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.16">10.4230/LIPIcs.ICDT.2024.16</a>
</li>
<li>
<span class="authors">Sylvain Salvati and Sophie Tison</span>
<span class="title">Containment of Regular Path Queries Under Path Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.17">10.4230/LIPIcs.ICDT.2024.17</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Rahul Raychaudhury, Stavros Sintos, and Jun Yang</span>
<span class="title">Computing Data Distribution from Query Selectivities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.18">10.4230/LIPIcs.ICDT.2024.18</a>
</li>
<li>
<span class="authors">Miika Hannula</span>
<span class="title">Information Inequality Problem over Set Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.19">10.4230/LIPIcs.ICDT.2024.19</a>
</li>
<li>
<span class="authors">Miika Hannula</span>
<span class="title">Conditional Independence on Semiring Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.20">10.4230/LIPIcs.ICDT.2024.20</a>
</li>
<li>
<span class="authors">Shiyuan Deng and Yufei Tao</span>
<span class="title">Subgraph Enumeration in Optimal I/O Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.21">10.4230/LIPIcs.ICDT.2024.21</a>
</li>
<li>
<span class="authors">Cristina Feier, Tomasz Gogacz, and Filip Murlak</span>
<span class="title">Evaluating Graph Queries Using Semantic Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.22">10.4230/LIPIcs.ICDT.2024.22</a>
</li>
<li>
<span class="authors">Ru Wang and Yufei Tao</span>
<span class="title">Join Sampling Under Acyclic Degree Constraints and (Cyclic) Subgraph Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.23">10.4230/LIPIcs.ICDT.2024.23</a>
</li>
<li>
<span class="authors">Xiao Hu and Stavros Sintos</span>
<span class="title">Finding Smallest Witnesses for Conjunctive Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.24">10.4230/LIPIcs.ICDT.2024.24</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Pierre Bourhis, Florent Capelli, and Mikaël Monet</span>
<span class="title">Ranked Enumeration for MSO on Trees via Knowledge Compilation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2024.25">10.4230/LIPIcs.ICDT.2024.25</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