@Proceedings{kimelfeld_et_al:LIPIcs.ICDT.2018,
title = {{LIPIcs, Volume 98, ICDT'18, Complete Volume}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018},
URN = {urn:nbn:de:0030-drops-86795},
doi = {10.4230/LIPIcs.ICDT.2018},
annote = {Keywords: Information systems, Data management systems, Information systems, Database design and models, Information systems, Database query processing}
}
@InProceedings{kimelfeld_et_al:LIPIcs.ICDT.2018.0,
author = {Kimelfeld, Benny and Amsterdamer, Yael},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.0},
URN = {urn:nbn:de:0030-drops-85938},
doi = {10.4230/LIPIcs.ICDT.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{vassilevskawilliams:LIPIcs.ICDT.2018.1,
author = {Vassilevska Williams, Virginia},
title = {{Fine-grained Algorithms and Complexity}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.1},
URN = {urn:nbn:de:0030-drops-86135},
doi = {10.4230/LIPIcs.ICDT.2018.1},
annote = {Keywords: algorithms, complexity, fine-grained}
}
@InProceedings{yi:LIPIcs.ICDT.2018.2,
author = {Yi, Ke},
title = {{Join Algorithms: From External Memory to the BSP}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.2},
URN = {urn:nbn:de:0030-drops-86126},
doi = {10.4230/LIPIcs.ICDT.2018.2},
annote = {Keywords: External memory model, BSP, join algorithms}
}
@InProceedings{zeume:LIPIcs.ICDT.2018.3,
author = {Zeume, Thomas},
title = {{An Update on Dynamic Complexity Theory}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.3},
URN = {urn:nbn:de:0030-drops-86117},
doi = {10.4230/LIPIcs.ICDT.2018.3},
annote = {Keywords: Dynamic descriptive complexity, SQL updates, Reachability}
}
@InProceedings{ahmetaj_et_al:LIPIcs.ICDT.2018.4,
author = {Ahmetaj, Shqiponja and Ortiz, Magdalena and Simkus, Mantas},
title = {{Rewriting Guarded Existential Rules into Small Datalog Programs}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {4:1--4:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.4},
URN = {urn:nbn:de:0030-drops-85950},
doi = {10.4230/LIPIcs.ICDT.2018.4},
annote = {Keywords: Existential rules, Expressiveness, Descriptive Complexity, Query Rewriting}
}
@InProceedings{amarilli_et_al:LIPIcs.ICDT.2018.5,
author = {Amarilli, Antoine and Bourhis, Pierre and Mengel, Stefan},
title = {{Enumeration on Trees under Relabelings}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.5},
URN = {urn:nbn:de:0030-drops-86060},
doi = {10.4230/LIPIcs.ICDT.2018.5},
annote = {Keywords: enumeration, trees, updates, MSO, circuits, knowledge compilation}
}
@InProceedings{amarilli_et_al:LIPIcs.ICDT.2018.6,
author = {Amarilli, Antoine and Monet, Mika\"{e}l and Senellart, Pierre},
title = {{Connecting Width and Structure in Knowledge Compilation}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.6},
URN = {urn:nbn:de:0030-drops-86083},
doi = {10.4230/LIPIcs.ICDT.2018.6},
annote = {Keywords: knowledge compilation, probabilistic databases, treewidth, circuits}
}
@InProceedings{barcelo_et_al:LIPIcs.ICDT.2018.7,
author = {Barcel\'{o}, Pablo and Romero, Miguel and Zeume, Thomas},
title = {{A More General Theory of Static Approximations for Conjunctive Queries}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {7:1--7:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.7},
URN = {urn:nbn:de:0030-drops-86021},
doi = {10.4230/LIPIcs.ICDT.2018.7},
annote = {Keywords: conjunctive queries, hypertreewidth, approximations, pebble games}
}
@InProceedings{berkholz_et_al:LIPIcs.ICDT.2018.8,
author = {Berkholz, Christoph and Keppeler, Jens and Schweikardt, Nicole},
title = {{Answering UCQs under Updates and in the Presence of Integrity Constraints}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.8},
URN = {urn:nbn:de:0030-drops-85990},
doi = {10.4230/LIPIcs.ICDT.2018.8},
annote = {Keywords: dynamic query evaluation, union of conjunctive queries, constant-delay enumeration, counting problem, testing}
}
@InProceedings{botoeva_et_al:LIPIcs.ICDT.2018.9,
author = {Botoeva, Elena and Calvanese, Diego and Cogrel, Benjamin and Xiao, Guohui},
title = {{Expressivity and Complexity of MongoDB Queries}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {9:1--9:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.9},
URN = {urn:nbn:de:0030-drops-86074},
doi = {10.4230/LIPIcs.ICDT.2018.9},
annote = {Keywords: MongoDB, NoSQL, aggregation framework, expressivity}
}
@InProceedings{brijder_et_al:LIPIcs.ICDT.2018.10,
author = {Brijder, Robert and Geerts, Floris and Van den Bussche, Jan and Weerwag, Timmy},
title = {{On the Expressive Power of Query Languages for Matrices}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.10},
URN = {urn:nbn:de:0030-drops-86007},
doi = {10.4230/LIPIcs.ICDT.2018.10},
annote = {Keywords: matrix query languages, relational algebra with aggregates, query evaluation problem, graph queries}
}
@InProceedings{carmeli_et_al:LIPIcs.ICDT.2018.11,
author = {Carmeli, Nofar and Kr\"{o}ll, Markus},
title = {{Enumeration Complexity of Conjunctive Queries with Functional Dependencies}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.11},
URN = {urn:nbn:de:0030-drops-85988},
doi = {10.4230/LIPIcs.ICDT.2018.11},
annote = {Keywords: Enumeration, Complexity, CQs}
}
@InProceedings{carral_et_al:LIPIcs.ICDT.2018.12,
author = {Carral, David and Kr\"{o}tzsch, Markus and Marx, Maximilian and Ozaki, Ana and Rudolph, Sebastian},
title = {{Preserving Constraints with the Stable Chase}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {12:1--12:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.12},
URN = {urn:nbn:de:0030-drops-86015},
doi = {10.4230/LIPIcs.ICDT.2018.12},
annote = {Keywords: Incidental constraints, Tuple-generating dependencies, Infinite core chase, Universal Model, BCQ entailment}
}
@InProceedings{cormode_et_al:LIPIcs.ICDT.2018.13,
author = {Cormode, Graham and Dark, Jacques},
title = {{Fast Sketch-based Recovery of Correlation Outliers}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.13},
URN = {urn:nbn:de:0030-drops-86094},
doi = {10.4230/LIPIcs.ICDT.2018.13},
annote = {Keywords: correlation, sketching, streaming, dimensionality reduction}
}
@InProceedings{doleschal_et_al:LIPIcs.ICDT.2018.14,
author = {Doleschal, Johannes and Martens, Wim and Neven, Frank and Witkowski, Adam},
title = {{Satisfiability for SCULPT-Schemas for CSV-Like Data}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {14:1--14:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.14},
URN = {urn:nbn:de:0030-drops-85969},
doi = {10.4230/LIPIcs.ICDT.2018.14},
annote = {Keywords: CSV, schema languages, semi-structured data}
}
@InProceedings{jung_et_al:LIPIcs.ICDT.2018.15,
author = {Jung, Jean Christoph and Lutz, Carsten and Martel, Mauricio and Schneider, Thomas},
title = {{Querying the Unary Negation Fragment with Regular Path Expressions}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {15:1--15:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.15},
URN = {urn:nbn:de:0030-drops-85971},
doi = {10.4230/LIPIcs.ICDT.2018.15},
annote = {Keywords: Query Answering, Regular Path Queries, Decidable Fragments of First-Order Logic, Computational Complexity}
}
@InProceedings{kara_et_al:LIPIcs.ICDT.2018.16,
author = {Kara, Ahmet and Olteanu, Dan},
title = {{Covers of Query Results}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {16:1--16:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.16},
URN = {urn:nbn:de:0030-drops-86100},
doi = {10.4230/LIPIcs.ICDT.2018.16},
annote = {Keywords: factorized database, fractional hypertree decomposition, functional aggregate query, minimal edge cover, query plan}
}
@InProceedings{ketsman_et_al:LIPIcs.ICDT.2018.17,
author = {Ketsman, Bas and Albarghouthi, Aws and Koutris, Paraschos},
title = {{Distribution Policies for Datalog}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {17:1--17:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.17},
URN = {urn:nbn:de:0030-drops-86034},
doi = {10.4230/LIPIcs.ICDT.2018.17},
annote = {Keywords: Datalog queries, Distributed evaluation, Distribution policies}
}
@InProceedings{ketsman_et_al:LIPIcs.ICDT.2018.18,
author = {Ketsman, Bas and Neven, Frank and Vandevoort, Brecht},
title = {{Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.18},
URN = {urn:nbn:de:0030-drops-86040},
doi = {10.4230/LIPIcs.ICDT.2018.18},
annote = {Keywords: Conjunctive queries, distributed evaluation, bag semantics}
}
@InProceedings{martens_et_al:LIPIcs.ICDT.2018.19,
author = {Martens, Wim and Trautner, Tina},
title = {{Evaluation and Enumeration Problems for Regular Path Queries}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {19:1--19:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.19},
URN = {urn:nbn:de:0030-drops-85947},
doi = {10.4230/LIPIcs.ICDT.2018.19},
annote = {Keywords: graph databases, regular path queries, regular languages, parameterized complexity}
}
@InProceedings{tao:LIPIcs.ICDT.2018.20,
author = {Tao, Yufei},
title = {{Massively Parallel Entity Matching with Linear Classification in Low Dimensional Space}},
booktitle = {21st International Conference on Database Theory (ICDT 2018)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-063-7},
ISSN = {1868-8969},
year = {2018},
volume = {98},
editor = {Kimelfeld, Benny and Amsterdamer, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.20},
URN = {urn:nbn:de:0030-drops-86057},
doi = {10.4230/LIPIcs.ICDT.2018.20},
annote = {Keywords: Entity Matching, Linear Programming, Range Counting, Dominance Join, Massively Parallel Computation}
}
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