<h2>LIPIcs, Volume 255, ICDT 2023</h2>
<ul>
<li>
<span class="authors">Floris Geerts and Brecht Vandevoort</span>
<span class="title">LIPIcs, Volume 255, ICDT 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023">10.4230/LIPIcs.ICDT.2023</a>
</li>
<li>
<span class="authors">Floris Geerts and Brecht Vandevoort</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.0">10.4230/LIPIcs.ICDT.2023.0</a>
</li>
<li>
<span class="authors">Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, and Domagoj Vrgoč</span>
<span class="title">A Researcher’s Digest of GQL (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.1">10.4230/LIPIcs.ICDT.2023.1</a>
</li>
<li>
<span class="authors">Gonzalo Navarro</span>
<span class="title">Compact Data Structures Meet Databases (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.2">10.4230/LIPIcs.ICDT.2023.2</a>
</li>
<li>
<span class="authors">C. Seshadhri</span>
<span class="title">Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.3">10.4230/LIPIcs.ICDT.2023.3</a>
</li>
<li>
<span class="authors">Shiyuan Deng, Francesco Silvestri, and Yufei Tao</span>
<span class="title">Enumerating Subgraphs of Constant Sizes in External Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.4">10.4230/LIPIcs.ICDT.2023.4</a>
</li>
<li>
<span class="authors">Pavel Raykov</span>
<span class="title">An Optimal Algorithm for Sliding Window Order Statistics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.5">10.4230/LIPIcs.ICDT.2023.5</a>
</li>
<li>
<span class="authors">Shiyuan Deng, Shangqi Lu, and Yufei Tao</span>
<span class="title">Space-Query Tradeoffs in Range Subgraph Counting and Listing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.6">10.4230/LIPIcs.ICDT.2023.6</a>
</li>
<li>
<span class="authors">Martín Muñoz and Cristian Riveros</span>
<span class="title">Constant-Delay Enumeration for SLP-Compressed Documents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.7">10.4230/LIPIcs.ICDT.2023.7</a>
</li>
<li>
<span class="authors">Kyle Deeds, Dan Suciu, Magda Balazinska, and Walter Cai</span>
<span class="title">Degree Sequence Bound for Join Cardinality Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.8">10.4230/LIPIcs.ICDT.2023.8</a>
</li>
<li>
<span class="authors">Andreas Pieris and Jorge Salas</span>
<span class="title">Absolute Expressiveness of Subgraph-Based Centrality Measures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.9">10.4230/LIPIcs.ICDT.2023.9</a>
</li>
<li>
<span class="authors">Timo Camillo Merkl, Reinhard Pichler, and Sebastian Skritek</span>
<span class="title">Diversity of Answers to Conjunctive Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.10">10.4230/LIPIcs.ICDT.2023.10</a>
</li>
<li>
<span class="authors">Majd Khalil and Benny Kimelfeld</span>
<span class="title">The Complexity of the Shapley Value for Regular Path Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.11">10.4230/LIPIcs.ICDT.2023.11</a>
</li>
<li>
<span class="authors">Cristian Riveros, Jorge Salas, and Oskar Skibski</span>
<span class="title">How Do Centrality Measures Choose the Root of Trees?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.12">10.4230/LIPIcs.ICDT.2023.12</a>
</li>
<li>
<span class="authors">Tamara Cucumides, Juan Reutter, and Domagoj Vrgoč</span>
<span class="title">Size Bounds and Algorithms for Conjunctive Regular Path Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.13">10.4230/LIPIcs.ICDT.2023.13</a>
</li>
<li>
<span class="authors">Antoine Amarilli</span>
<span class="title">Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.14">10.4230/LIPIcs.ICDT.2023.14</a>
</li>
<li>
<span class="authors">Diego Figueira and Rémi Morvan</span>
<span class="title">Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.15">10.4230/LIPIcs.ICDT.2023.15</a>
</li>
<li>
<span class="authors">Jens Keppeler, Thomas Schwentick, and Christopher Spinrath</span>
<span class="title">Work-Efficient Query Evaluation with PRAMs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.16">10.4230/LIPIcs.ICDT.2023.16</a>
</li>
<li>
<span class="authors">Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang</span>
<span class="title">Conjunctive Queries with Free Access Patterns Under Updates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.17">10.4230/LIPIcs.ICDT.2023.17</a>
</li>
<li>
<span class="authors">Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, and Sebastian Rudolph</span>
<span class="title">Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.18">10.4230/LIPIcs.ICDT.2023.18</a>
</li>
<li>
<span class="authors">Sepehr Assadi, Nirmit Joshi, Milind Prabhu, and Vihan Shah</span>
<span class="title">Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.19">10.4230/LIPIcs.ICDT.2023.19</a>
</li>
<li>
<span class="authors">Martin Grohe, Peter Lindner, and Christoph Standke</span>
<span class="title">Probabilistic Query Evaluation with Bag Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.20">10.4230/LIPIcs.ICDT.2023.20</a>
</li>
<li>
<span class="authors">Jingfan Meng, Huayi Wang, Jun Xu, and Mitsunori Ogihara</span>
<span class="title">On Efficient Range-Summability of IID Random Variables in Two or Higher Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.21">10.4230/LIPIcs.ICDT.2023.21</a>
</li>
<li>
<span class="authors">Amir Gilad, Aviram Imber, and Benny Kimelfeld</span>
<span class="title">The Consistency of Probabilistic Databases with Independent Cells</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.22">10.4230/LIPIcs.ICDT.2023.22</a>
</li>
<li>
<span class="authors">Aziz Amezian El Khalfioui and Jef Wijsen</span>
<span class="title">Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.23">10.4230/LIPIcs.ICDT.2023.23</a>
</li>
<li>
<span class="authors">Diego Figueira, Anantha Padmanabha, Luc Segoufin, and Cristina Sirangelo</span>
<span class="title">A Simple Algorithm for Consistent Query Answering Under Primary Keys</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2023.24">10.4230/LIPIcs.ICDT.2023.24</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