<h2>LIPIcs, Volume 98, ICDT 2018</h2>
<ul>
<li>
<span class="authors">Benny Kimelfeld and Yael Amsterdamer</span>
<span class="title">LIPIcs, Volume 98, ICDT'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018">10.4230/LIPIcs.ICDT.2018</a>
</li>
<li>
<span class="authors">Benny Kimelfeld and Yael Amsterdamer</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.0">10.4230/LIPIcs.ICDT.2018.0</a>
</li>
<li>
<span class="authors">Virginia Vassilevska Williams</span>
<span class="title">Fine-grained Algorithms and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.1">10.4230/LIPIcs.ICDT.2018.1</a>
</li>
<li>
<span class="authors">Ke Yi</span>
<span class="title">Join Algorithms: From External Memory to the BSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.2">10.4230/LIPIcs.ICDT.2018.2</a>
</li>
<li>
<span class="authors">Thomas Zeume</span>
<span class="title">An Update on Dynamic Complexity Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.3">10.4230/LIPIcs.ICDT.2018.3</a>
</li>
<li>
<span class="authors">Shqiponja Ahmetaj, Magdalena Ortiz, and Mantas Simkus</span>
<span class="title">Rewriting Guarded Existential Rules into Small Datalog Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.4">10.4230/LIPIcs.ICDT.2018.4</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Pierre Bourhis, and Stefan Mengel</span>
<span class="title">Enumeration on Trees under Relabelings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.5">10.4230/LIPIcs.ICDT.2018.5</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Mikaël Monet, and Pierre Senellart</span>
<span class="title">Connecting Width and Structure in Knowledge Compilation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.6">10.4230/LIPIcs.ICDT.2018.6</a>
</li>
<li>
<span class="authors">Pablo Barceló, Miguel Romero, and Thomas Zeume</span>
<span class="title">A More General Theory of Static Approximations for Conjunctive Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.7">10.4230/LIPIcs.ICDT.2018.7</a>
</li>
<li>
<span class="authors">Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt</span>
<span class="title">Answering UCQs under Updates and in the Presence of Integrity Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.8">10.4230/LIPIcs.ICDT.2018.8</a>
</li>
<li>
<span class="authors">Elena Botoeva, Diego Calvanese, Benjamin Cogrel, and Guohui Xiao</span>
<span class="title">Expressivity and Complexity of MongoDB Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.9">10.4230/LIPIcs.ICDT.2018.9</a>
</li>
<li>
<span class="authors">Robert Brijder, Floris Geerts, Jan Van den Bussche, and Timmy Weerwag</span>
<span class="title">On the Expressive Power of Query Languages for Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.10">10.4230/LIPIcs.ICDT.2018.10</a>
</li>
<li>
<span class="authors">Nofar Carmeli and Markus Kröll</span>
<span class="title">Enumeration Complexity of Conjunctive Queries with Functional Dependencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.11">10.4230/LIPIcs.ICDT.2018.11</a>
</li>
<li>
<span class="authors">David Carral, Markus Krötzsch, Maximilian Marx, Ana Ozaki, and Sebastian Rudolph</span>
<span class="title">Preserving Constraints with the Stable Chase</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.12">10.4230/LIPIcs.ICDT.2018.12</a>
</li>
<li>
<span class="authors">Graham Cormode and Jacques Dark</span>
<span class="title">Fast Sketch-based Recovery of Correlation Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.13">10.4230/LIPIcs.ICDT.2018.13</a>
</li>
<li>
<span class="authors">Johannes Doleschal, Wim Martens, Frank Neven, and Adam Witkowski</span>
<span class="title">Satisfiability for SCULPT-Schemas for CSV-Like Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.14">10.4230/LIPIcs.ICDT.2018.14</a>
</li>
<li>
<span class="authors">Jean Christoph Jung, Carsten Lutz, Mauricio Martel, and Thomas Schneider</span>
<span class="title">Querying the Unary Negation Fragment with Regular Path Expressions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.15">10.4230/LIPIcs.ICDT.2018.15</a>
</li>
<li>
<span class="authors">Ahmet Kara and Dan Olteanu</span>
<span class="title">Covers of Query Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.16">10.4230/LIPIcs.ICDT.2018.16</a>
</li>
<li>
<span class="authors">Bas Ketsman, Aws Albarghouthi, and Paraschos Koutris</span>
<span class="title">Distribution Policies for Datalog</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.17">10.4230/LIPIcs.ICDT.2018.17</a>
</li>
<li>
<span class="authors">Bas Ketsman, Frank Neven, and Brecht Vandevoort</span>
<span class="title">Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.18">10.4230/LIPIcs.ICDT.2018.18</a>
</li>
<li>
<span class="authors">Wim Martens and Tina Trautner</span>
<span class="title">Evaluation and Enumeration Problems for Regular Path Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.19">10.4230/LIPIcs.ICDT.2018.19</a>
</li>
<li>
<span class="authors">Yufei Tao</span>
<span class="title">Massively Parallel Entity Matching with Linear Classification in Low Dimensional Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2018.20">10.4230/LIPIcs.ICDT.2018.20</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