<h2>LIPIcs, Volume 127, ICDT 2019</h2>
<ul>
<li>
<span class="authors">Pablo Barcelo and Marco Calautti</span>
<span class="title">LIPIcs, Volume 127, ICDT'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019">10.4230/LIPIcs.ICDT.2019</a>
</li>
<li>
<span class="authors">Pablo Barcelo and Marco Calautti</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.0">10.4230/LIPIcs.ICDT.2019.0</a>
</li>
<li>
<span class="authors">Dan Olteanu</span>
<span class="title">Learning Models over Relational Databases (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.1">10.4230/LIPIcs.ICDT.2019.1</a>
</li>
<li>
<span class="authors">Lise Getoor</span>
<span class="title">The Power of Relational Learning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.2">10.4230/LIPIcs.ICDT.2019.2</a>
</li>
<li>
<span class="authors">Markus Krötzsch, Maximilian Marx, and Sebastian Rudolph</span>
<span class="title">The Power of the Terminating Chase (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.3">10.4230/LIPIcs.ICDT.2019.3</a>
</li>
<li>
<span class="authors">Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang</span>
<span class="title">Counting Triangles under Updates in Worst-Case Optimal Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.4">10.4230/LIPIcs.ICDT.2019.4</a>
</li>
<li>
<span class="authors">Alejandro Grez, Cristian Riveros, and Martín Ugarte</span>
<span class="title">A Formal Framework for Complex Event Processing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.5">10.4230/LIPIcs.ICDT.2019.5</a>
</li>
<li>
<span class="authors">Christopher De Sa, Ihab F. Ilyas, Benny Kimelfeld, Christopher Ré, and Theodoros Rekatsinas</span>
<span class="title">A Formal Framework for Probabilistic Unclean Databases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.6">10.4230/LIPIcs.ICDT.2019.6</a>
</li>
<li>
<span class="authors">Floris Geerts</span>
<span class="title">On the Expressive Power of Linear Algebra on Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.7">10.4230/LIPIcs.ICDT.2019.7</a>
</li>
<li>
<span class="authors">Marco Console, Paolo Guagliardo, and Leonid Libkin</span>
<span class="title">Fragments of Bag Relational Algebra: Expressiveness and Certain Answers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.8">10.4230/LIPIcs.ICDT.2019.8</a>
</li>
<li>
<span class="authors">Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, and Sharma V. Thankachan</span>
<span class="title">Categorical Range Reporting with Frequencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.9">10.4230/LIPIcs.ICDT.2019.9</a>
</li>
<li>
<span class="authors">Nirman Kumar, Benjamin Raichel, Stavros Sintos, and Gregory Van Buskirk</span>
<span class="title">Approximating Distance Measures for the Skyline</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.10">10.4230/LIPIcs.ICDT.2019.10</a>
</li>
<li>
<span class="authors">Yuliang Li, Jianguo Wang, Benjamin Pullman, Nuno Bandeira, and Yannis Papakonstantinou</span>
<span class="title">Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.11">10.4230/LIPIcs.ICDT.2019.11</a>
</li>
<li>
<span class="authors">Silviu Maniu, Pierre Senellart, and Suraj Jog</span>
<span class="title">An Experimental Study of the Treewidth of Real-World Graph Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.12">10.4230/LIPIcs.ICDT.2019.12</a>
</li>
<li>
<span class="authors">Liat Peterfreund, Balder ten Cate, Ronald Fagin, and Benny Kimelfeld</span>
<span class="title">Recursive Programs for Document Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.13">10.4230/LIPIcs.ICDT.2019.13</a>
</li>
<li>
<span class="authors">Frank Neven, Thomas Schwentick, Christopher Spinrath, and Brecht Vandevoort</span>
<span class="title">Parallel-Correctness and Parallel-Boundedness for Datalog Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.14">10.4230/LIPIcs.ICDT.2019.14</a>
</li>
<li>
<span class="authors">Grzegorz Głuch, Jerzy Marcinkowski, and Piotr Ostropolski-Nalewaja</span>
<span class="title">The First Order Truth Behind Undecidability of Regular Path Queries Determinacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.15">10.4230/LIPIcs.ICDT.2019.15</a>
</li>
<li>
<span class="authors">Leopoldo Bertossi, Georg Gottlob, and Reinhard Pichler</span>
<span class="title">Datalog: Bag Semantics via Set Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.16">10.4230/LIPIcs.ICDT.2019.16</a>
</li>
<li>
<span class="authors">Marco Calautti and Andreas Pieris</span>
<span class="title">Oblivious Chase Termination: The Sticky Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.17">10.4230/LIPIcs.ICDT.2019.17</a>
</li>
<li>
<span class="authors">Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo, and Federico Ulliana</span>
<span class="title">A Single Approach to Decide Chase Termination on Linear Existential Rules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.18">10.4230/LIPIcs.ICDT.2019.18</a>
</li>
<li>
<span class="authors">Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx, and Jan Van den Bussche</span>
<span class="title">Additive First-Order Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.19">10.4230/LIPIcs.ICDT.2019.19</a>
</li>
<li>
<span class="authors">Stefan Mengel and Sebastian Skritek</span>
<span class="title">Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.20">10.4230/LIPIcs.ICDT.2019.20</a>
</li>
<li>
<span class="authors">Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, and Dan Suciu</span>
<span class="title">Boolean Tensor Decomposition for Conjunctive Queries with Negation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.21">10.4230/LIPIcs.ICDT.2019.21</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth</span>
<span class="title">Constant-Delay Enumeration for Nondeterministic Document Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.22">10.4230/LIPIcs.ICDT.2019.22</a>
</li>
<li>
<span class="authors">Paraschos Koutris and Jef Wijsen</span>
<span class="title">Consistent Query Answering for Primary Keys in Logspace</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.23">10.4230/LIPIcs.ICDT.2019.23</a>
</li>
<li>
<span class="authors">Emilie Grienenberger and Martin Ritzert</span>
<span class="title">Learning Definable Hypotheses on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2019.24">10.4230/LIPIcs.ICDT.2019.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