<h2>LIPIcs, Volume 155, ICDT 2020</h2>
<ul>
<li>
<span class="authors">Carsten Lutz and Jean Christoph Jung</span>
<span class="title">LIPIcs, Vol. 155, ICDT 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020">10.4230/LIPIcs.ICDT.2020</a>
</li>
<li>
<span class="authors">Carsten Lutz and Jean Christoph Jung</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.0">10.4230/LIPIcs.ICDT.2020.0</a>
</li>
<li>
<span class="authors">Benny Kimelfeld</span>
<span class="title">Facets of Probabilistic Databases (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.1">10.4230/LIPIcs.ICDT.2020.1</a>
</li>
<li>
<span class="authors">Jerzy Marcinkowski</span>
<span class="title">What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.2">10.4230/LIPIcs.ICDT.2020.2</a>
</li>
<li>
<span class="authors">Juan L. Reutter</span>
<span class="title">Current Challenges in Graph Databases (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.3">10.4230/LIPIcs.ICDT.2020.3</a>
</li>
<li>
<span class="authors">Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, and Jan Van den Bussche</span>
<span class="title">Executable First-Order Queries in the Logic of Information Flows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.4">10.4230/LIPIcs.ICDT.2020.4</a>
</li>
<li>
<span class="authors">Antoine Amarilli and İsmail İlkan Ceylan</span>
<span class="title">A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.5">10.4230/LIPIcs.ICDT.2020.5</a>
</li>
<li>
<span class="authors">Pablo Barceló, Nelson Higuera, Jorge Pérez, and Bernardo Subercaseaux</span>
<span class="title">On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.6">10.4230/LIPIcs.ICDT.2020.6</a>
</li>
<li>
<span class="authors">Yu Chen and Ke Yi</span>
<span class="title">Random Sampling and Size Estimation Over Cyclic Joins</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.7">10.4230/LIPIcs.ICDT.2020.7</a>
</li>
<li>
<span class="authors">Johannes Doleschal, Benny Kimelfeld, Wim Martens, and Liat Peterfreund</span>
<span class="title">Weight Annotation in Information Extraction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.8">10.4230/LIPIcs.ICDT.2020.8</a>
</li>
<li>
<span class="authors">Diego Figueira</span>
<span class="title">Containment of UC2RPQ: The Hard and Easy Cases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.9">10.4230/LIPIcs.ICDT.2020.9</a>
</li>
<li>
<span class="authors">Henrik Forssell, Evgeny Kharlamov, and Evgenij Thorstensen</span>
<span class="title">On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.10">10.4230/LIPIcs.ICDT.2020.10</a>
</li>
<li>
<span class="authors">Dominik D. Freydenberger and Sam M. Thompson</span>
<span class="title">Dynamic Complexity of Document Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.11">10.4230/LIPIcs.ICDT.2020.11</a>
</li>
<li>
<span class="authors">Floris Geerts</span>
<span class="title">When Can Matrix Query Languages Discern Matrices?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.12">10.4230/LIPIcs.ICDT.2020.12</a>
</li>
<li>
<span class="authors">Gaetano Geck, Frank Neven, and Thomas Schwentick</span>
<span class="title">Distribution Constraints: The Chase for Distributed Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.13">10.4230/LIPIcs.ICDT.2020.13</a>
</li>
<li>
<span class="authors">Alejandro Grez and Cristian Riveros</span>
<span class="title">Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.14">10.4230/LIPIcs.ICDT.2020.14</a>
</li>
<li>
<span class="authors">Alejandro Grez, Cristian Riveros, Martín Ugarte, and Stijn Vansummeren</span>
<span class="title">On the Expressiveness of Languages for Complex Event Recognition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.15">10.4230/LIPIcs.ICDT.2020.15</a>
</li>
<li>
<span class="authors">Martin Grohe and Peter Lindner</span>
<span class="title">Infinite Probabilistic Databases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.16">10.4230/LIPIcs.ICDT.2020.16</a>
</li>
<li>
<span class="authors">Jelle Hellings and Mohammad Sadoghi</span>
<span class="title">Coordination-Free Byzantine Replication with Minimal Communication Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.17">10.4230/LIPIcs.ICDT.2020.17</a>
</li>
<li>
<span class="authors">Batya Kenig and Dan Suciu</span>
<span class="title">Integrity Constraints Revisited: From Exact to Approximate Implication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.18">10.4230/LIPIcs.ICDT.2020.18</a>
</li>
<li>
<span class="authors">Bas Ketsman and Christoph Koch</span>
<span class="title">Datalog with Negation and Monotonicity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.19">10.4230/LIPIcs.ICDT.2020.19</a>
</li>
<li>
<span class="authors">Ester Livshits, Leopoldo Bertossi, Benny Kimelfeld, and Moshe Sebag</span>
<span class="title">The Shapley Value of Tuples in Query Answering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.20">10.4230/LIPIcs.ICDT.2020.20</a>
</li>
<li>
<span class="authors">Gonzalo Navarro, Juan L. Reutter, and Javiel Rojas-Ledesma</span>
<span class="title">Optimal Joins Using Compact Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.21">10.4230/LIPIcs.ICDT.2020.21</a>
</li>
<li>
<span class="authors">Rasmus Pagh and Johan Sivertsen</span>
<span class="title">The Space Complexity of Inner Product Filters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.22">10.4230/LIPIcs.ICDT.2020.22</a>
</li>
<li>
<span class="authors">Cristian Riveros and Jorge Salas</span>
<span class="title">A Family of Centrality Measures for Graph Data Based on Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.23">10.4230/LIPIcs.ICDT.2020.23</a>
</li>
<li>
<span class="authors">Michael Simpson, Venkatesh Srinivasan, and Alex Thomo</span>
<span class="title">Reverse Prevention Sampling for Misinformation Mitigation in Social Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.24">10.4230/LIPIcs.ICDT.2020.24</a>
</li>
<li>
<span class="authors">Yufei Tao</span>
<span class="title">A Simple Parallel Algorithm for Natural Joins on Binary Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2020.25">10.4230/LIPIcs.ICDT.2020.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