HTML Export for ICDT 2022

Copy to Clipboard Download

<h2>LIPIcs, Volume 220, ICDT 2022</h2>
<ul>
<li>
    <span class="authors">Dan Olteanu and Nils Vortmeier</span>
    <span class="title">LIPIcs, Volume 220, ICDT 2022, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022">10.4230/LIPIcs.ICDT.2022</a>
</li>
<li>
    <span class="authors">Dan Olteanu and Nils Vortmeier</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.0">10.4230/LIPIcs.ICDT.2022.0</a>
</li>
<li>
    <span class="authors">Hung Q. Ngo</span>
    <span class="title">On an Information Theoretic Approach to Cardinality Estimation (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.1">10.4230/LIPIcs.ICDT.2022.1</a>
</li>
<li>
    <span class="authors">Marcelo Arenas</span>
    <span class="title">Counting the Solutions to a Query (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.2">10.4230/LIPIcs.ICDT.2022.2</a>
</li>
<li>
    <span class="authors">Nofar Carmeli</span>
    <span class="title">Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.3">10.4230/LIPIcs.ICDT.2022.3</a>
</li>
<li>
    <span class="authors">Shay Gershtein, Uri Avron, Ido Guy, Tova Milo, and Slava Novgorodov</span>
    <span class="title">On the Hardness of Category Tree Construction</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.4">10.4230/LIPIcs.ICDT.2022.4</a>
</li>
<li>
    <span class="authors">Florent Capelli, Nicolas Crosetti, Joachim Niehren, and Jan Ramon</span>
    <span class="title">Linear Programs with Conjunctive Queries</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.5">10.4230/LIPIcs.ICDT.2022.5</a>
</li>
<li>
    <span class="authors">Austen Z. Fan and Paraschos Koutris</span>
    <span class="title">Certifiable Robustness for Nearest Neighbor Classifiers</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.6">10.4230/LIPIcs.ICDT.2022.6</a>
</li>
<li>
    <span class="authors">Raghavendra Addanki, Andrew McGregor, Alexandra Meliou, and Zafeiria Moumoulidou</span>
    <span class="title">Improved Approximation and Scalability for Fair Max-Min Diversification</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.7">10.4230/LIPIcs.ICDT.2022.7</a>
</li>
<li>
    <span class="authors">Gaetano Geck, Jens Keppeler, Thomas Schwentick, and Christopher Spinrath</span>
    <span class="title">Rewriting with Acyclic Queries: Mind Your Head</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.8">10.4230/LIPIcs.ICDT.2022.8</a>
</li>
<li>
    <span class="authors">Yufei Tao</span>
    <span class="title">Parallel Acyclic Joins with Canonical Edge Covers</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.9">10.4230/LIPIcs.ICDT.2022.9</a>
</li>
<li>
    <span class="authors">Dominik D. Freydenberger and Sam M. Thompson</span>
    <span class="title">Splitting Spanner Atoms: A Tool for Acyclic Core Spanners</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.10">10.4230/LIPIcs.ICDT.2022.10</a>
</li>
<li>
    <span class="authors">Martin Raszyk, David Basin, Srđan Krstić, and Dmitriy Traytel</span>
    <span class="title">Practical Relational Calculus Query Evaluation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.11">10.4230/LIPIcs.ICDT.2022.11</a>
</li>
<li>
    <span class="authors">Cristina Feier</span>
    <span class="title">Characterising Fixed Parameter Tractability for Query Evaluation over Guarded TGDs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.12">10.4230/LIPIcs.ICDT.2022.12</a>
</li>
<li>
    <span class="authors">Maximilian Marx and Markus Krötzsch</span>
    <span class="title">Tuple-Generating Dependencies Capture Complex Values</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.13">10.4230/LIPIcs.ICDT.2022.13</a>
</li>
<li>
    <span class="authors">Benoît Groz, Aurélien Lemay, Sławek Staworko, and Piotr Wieczorek</span>
    <span class="title">Inference of Shape Graphs for Graph Databases</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.14">10.4230/LIPIcs.ICDT.2022.14</a>
</li>
<li>
    <span class="authors">Bart Bogaerts, Maxime Jakubowski, and Jan Van den Bussche</span>
    <span class="title">Expressiveness of SHACL Features</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.15">10.4230/LIPIcs.ICDT.2022.15</a>
</li>
<li>
    <span class="authors">Brecht Vandevoort, Bas Ketsman, Christoph Koch, and Frank Neven</span>
    <span class="title">Robustness Against Read Committed for Transaction Templates with Functional Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.16">10.4230/LIPIcs.ICDT.2022.16</a>
</li>
<li>
    <span class="authors">Jingfan Meng, Huayi Wang, Jun Xu, and Mitsunori Ogihara</span>
    <span class="title">A Dyadic Simulation Approach to Efficient Range-Summability</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.17">10.4230/LIPIcs.ICDT.2022.17</a>
</li>
<li>
    <span class="authors">Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, and Matthias Weidlich</span>
    <span class="title">Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.18">10.4230/LIPIcs.ICDT.2022.18</a>
</li>
<li>
    <span class="authors">Martín Muñoz and Cristian Riveros</span>
    <span class="title">Streaming Enumeration on Nested Documents</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2022.19">10.4230/LIPIcs.ICDT.2022.19</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