HTML Export for ICDT 2016

Copy to Clipboard Download

<h2>LIPIcs, Volume 48, ICDT 2016</h2>
<ul>
<li>
    <span class="authors">Wim Martens and Thomas Zeume</span>
    <span class="title">LIPIcs, Volume 48, ICDT&#039;16, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016">10.4230/LIPIcs.ICDT.2016</a>
</li>
<li>
    <span class="authors">Wim Martens and Thomas Zeume</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers, List of Authors</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.0">10.4230/LIPIcs.ICDT.2016.0</a>
</li>
<li>
    <span class="authors">Foto N. Afrati, Claire David, and Georg Gottlob</span>
    <span class="title">The ICDT 2016 Test of Time Award Announcement</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.1">10.4230/LIPIcs.ICDT.2016.1</a>
</li>
<li>
    <span class="authors">Floris Geerts</span>
    <span class="title">Scale Independence: Using Small Data to Answer Queries on Big Data (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.2">10.4230/LIPIcs.ICDT.2016.2</a>
</li>
<li>
    <span class="authors">Yufei Tao</span>
    <span class="title">Top-k Indexes Made Small and Sweet (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.3">10.4230/LIPIcs.ICDT.2016.3</a>
</li>
<li>
    <span class="authors">David P. Woodruff</span>
    <span class="title">New Algorithms for Heavy Hitters in Data Streams (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.4">10.4230/LIPIcs.ICDT.2016.4</a>
</li>
<li>
    <span class="authors">Mark Kaminski and Egor V. Kostylev</span>
    <span class="title">Beyond Well-designed SPARQL</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.5">10.4230/LIPIcs.ICDT.2016.5</a>
</li>
<li>
    <span class="authors">Anirban Dasgupta, Kevin J. Lang, Lee Rhodes, and Justin Thaler</span>
    <span class="title">A Framework for Estimating Stream Expression Cardinalities</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.6">10.4230/LIPIcs.ICDT.2016.6</a>
</li>
<li>
    <span class="authors">Vince Barany, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, and Zografoula Vagena</span>
    <span class="title">Declarative Probabilistic Programming with Datalog</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.7">10.4230/LIPIcs.ICDT.2016.7</a>
</li>
<li>
    <span class="authors">Paraschos Koutris, Paul Beame, and Dan Suciu</span>
    <span class="title">Worst-Case Optimal Algorithms for Parallel Query Processing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.8">10.4230/LIPIcs.ICDT.2016.8</a>
</li>
<li>
    <span class="authors">Gaetano Geck, Bas Ketsman, Frank Neven, and Thomas Schwentick</span>
    <span class="title">Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.9">10.4230/LIPIcs.ICDT.2016.9</a>
</li>
<li>
    <span class="authors">Serge Abiteboul, Pierre Bourhis, and Victor Vianu</span>
    <span class="title">A Formal Study of Collaborative Access Control in Distributed Datalog</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.10">10.4230/LIPIcs.ICDT.2016.10</a>
</li>
<li>
    <span class="authors">Manas R. Joglekar and Christopher M. Ré</span>
    <span class="title">It&#039;s All a Matter of Degree: Using Degree Information to Optimize Multiway Joins</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.11">10.4230/LIPIcs.ICDT.2016.11</a>
</li>
<li>
    <span class="authors">Benoit Groz, Ezra Levin, Isaac Meilijson, and Tova Milo</span>
    <span class="title">Filtering With the Crowd: CrowdScreen Revisited</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.12">10.4230/LIPIcs.ICDT.2016.12</a>
</li>
<li>
    <span class="authors">Christian Konrad</span>
    <span class="title">Streaming Partitioning of Sequences and Trees</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.13">10.4230/LIPIcs.ICDT.2016.13</a>
</li>
<li>
    <span class="authors">Pablo Muñoz, Nils Vortmeier, and Thomas Zeume</span>
    <span class="title">Dynamic Graph Queries</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.14">10.4230/LIPIcs.ICDT.2016.14</a>
</li>
<li>
    <span class="authors">Diego Calvanese, Magdalena Ortiz, and Mantas Šimkus</span>
    <span class="title">Verification of Evolving Graph-structured Data under Expressive Path Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.15">10.4230/LIPIcs.ICDT.2016.15</a>
</li>
<li>
    <span class="authors">Ognjen Savkovic, Elisa Marengo, and Werner Nutt</span>
    <span class="title">Query Stability in Monotonic Data-Aware Business Processes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.16">10.4230/LIPIcs.ICDT.2016.16</a>
</li>
<li>
    <span class="authors">Dominik D. Freydenberger and Mario Holldack</span>
    <span class="title">Document Spanners: From Expressive Power to Decision Problems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.17">10.4230/LIPIcs.ICDT.2016.17</a>
</li>
<li>
    <span class="authors">Sepehr Assadi, Sanjeev Khanna, Yang Li, and Val Tannen</span>
    <span class="title">Algorithms for Provisioning Queries and Analytics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.18">10.4230/LIPIcs.ICDT.2016.18</a>
</li>
<li>
    <span class="authors">Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, and Vadim Savenkov</span>
    <span class="title">Limits of Schema Mappings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.19">10.4230/LIPIcs.ICDT.2016.19</a>
</li>
<li>
    <span class="authors">Wojciech Czerwinski, Claire David, Filip Murlak, and Pawel Parys</span>
    <span class="title">Reasoning About Integrity Constraints for Tree-Structured Data</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.20">10.4230/LIPIcs.ICDT.2016.20</a>
</li>
<li>
    <span class="authors">Sebastian Arming, Reinhard Pichler, and Emanuel Sallinger</span>
    <span class="title">Complexity of Repair Checking and Consistent Query Answering</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.21">10.4230/LIPIcs.ICDT.2016.21</a>
</li>
<li>
    <span class="authors">Markus Kröll, Reinhard Pichler, and Sebastian Skritek</span>
    <span class="title">On the Complexity of Enumerating the Answers to Well-designed Pattern Trees</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.22">10.4230/LIPIcs.ICDT.2016.22</a>
</li>
<li>
    <span class="authors">Konstantin Golenberg and Yehoshua Sagiv</span>
    <span class="title">A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ICDT.2016.23">10.4230/LIPIcs.ICDT.2016.23</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