@Proceedings{olteanu_et_al:LIPIcs.ICDT.2022,
title = {{LIPIcs, Volume 220, ICDT 2022, Complete Volume}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {1--354},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022},
URN = {urn:nbn:de:0030-drops-158737},
doi = {10.4230/LIPIcs.ICDT.2022},
annote = {Keywords: LIPIcs, Volume 220, ICDT 2022, Complete Volume}
}
@InProceedings{olteanu_et_al:LIPIcs.ICDT.2022.0,
author = {Olteanu, Dan and Vortmeier, Nils},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.0},
URN = {urn:nbn:de:0030-drops-158745},
doi = {10.4230/LIPIcs.ICDT.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{ngo:LIPIcs.ICDT.2022.1,
author = {Ngo, Hung Q.},
title = {{On an Information Theoretic Approach to Cardinality Estimation}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {1:1--1:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.1},
URN = {urn:nbn:de:0030-drops-158750},
doi = {10.4230/LIPIcs.ICDT.2022.1},
annote = {Keywords: Cardinality Estimation, Information Theory, Polymatroid Bound, Worst-case Optimal Join}
}
@InProceedings{arenas:LIPIcs.ICDT.2022.2,
author = {Arenas, Marcelo},
title = {{Counting the Solutions to a Query}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.2},
URN = {urn:nbn:de:0030-drops-158763},
doi = {10.4230/LIPIcs.ICDT.2022.2},
annote = {Keywords: Counting, query answering, fully polynomial-time randomized approximation scheme}
}
@InProceedings{carmeli:LIPIcs.ICDT.2022.3,
author = {Carmeli, Nofar},
title = {{Answering Unions of Conjunctive Queries with Ideal Time Guarantees}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.3},
URN = {urn:nbn:de:0030-drops-158771},
doi = {10.4230/LIPIcs.ICDT.2022.3},
annote = {Keywords: query evaluation, enumeration, fine-grained complexity, constant delay, union of conjunctive queries}
}
@InProceedings{gershtein_et_al:LIPIcs.ICDT.2022.4,
author = {Gershtein, Shay and Avron, Uri and Guy, Ido and Milo, Tova and Novgorodov, Slava},
title = {{On the Hardness of Category Tree Construction}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.4},
URN = {urn:nbn:de:0030-drops-158785},
doi = {10.4230/LIPIcs.ICDT.2022.4},
annote = {Keywords: maximum independent set, approximation algorithms, approximation hardness bounds, taxonomy construction, category tree construction}
}
@InProceedings{capelli_et_al:LIPIcs.ICDT.2022.5,
author = {Capelli, Florent and Crosetti, Nicolas and Niehren, Joachim and Ramon, Jan},
title = {{Linear Programs with Conjunctive Queries}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {5:1--5:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.5},
URN = {urn:nbn:de:0030-drops-158796},
doi = {10.4230/LIPIcs.ICDT.2022.5},
annote = {Keywords: Database queries, linear programming, hypergraph decomposition}
}
@InProceedings{fan_et_al:LIPIcs.ICDT.2022.6,
author = {Fan, Austen Z. and Koutris, Paraschos},
title = {{Certifiable Robustness for Nearest Neighbor Classifiers}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {6:1--6:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.6},
URN = {urn:nbn:de:0030-drops-158809},
doi = {10.4230/LIPIcs.ICDT.2022.6},
annote = {Keywords: Inconsistent databases, k-NN classification, certifiable robustness}
}
@InProceedings{addanki_et_al:LIPIcs.ICDT.2022.7,
author = {Addanki, Raghavendra and McGregor, Andrew and Meliou, Alexandra and Moumoulidou, Zafeiria},
title = {{Improved Approximation and Scalability for Fair Max-Min Diversification}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {7:1--7:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.7},
URN = {urn:nbn:de:0030-drops-158812},
doi = {10.4230/LIPIcs.ICDT.2022.7},
annote = {Keywords: algorithmic fairness, diversity maximization, data selection, approximation algorithms}
}
@InProceedings{geck_et_al:LIPIcs.ICDT.2022.8,
author = {Geck, Gaetano and Keppeler, Jens and Schwentick, Thomas and Spinrath, Christopher},
title = {{Rewriting with Acyclic Queries: Mind Your Head}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {8:1--8:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.8},
URN = {urn:nbn:de:0030-drops-158829},
doi = {10.4230/LIPIcs.ICDT.2022.8},
annote = {Keywords: rewriting, acyclic rewriting, acyclic conjunctive queries, free-connex queries, hierarchical queries, NP-hardness}
}
@InProceedings{tao:LIPIcs.ICDT.2022.9,
author = {Tao, Yufei},
title = {{Parallel Acyclic Joins with Canonical Edge Covers}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {9:1--9:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.9},
URN = {urn:nbn:de:0030-drops-158838},
doi = {10.4230/LIPIcs.ICDT.2022.9},
annote = {Keywords: Joins, Conjunctive Queries, MPC Algorithms, Parallel Computing}
}
@InProceedings{freydenberger_et_al:LIPIcs.ICDT.2022.10,
author = {Freydenberger, Dominik D. and Thompson, Sam M.},
title = {{Splitting Spanner Atoms: A Tool for Acyclic Core Spanners}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {10:1--10:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.10},
URN = {urn:nbn:de:0030-drops-158843},
doi = {10.4230/LIPIcs.ICDT.2022.10},
annote = {Keywords: Document spanners, information extraction, conjunctive queries}
}
@InProceedings{raszyk_et_al:LIPIcs.ICDT.2022.11,
author = {Raszyk, Martin and Basin, David and Krsti\'{c}, Sr{\d}an and Traytel, Dmitriy},
title = {{Practical Relational Calculus Query Evaluation}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {11:1--11:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.11},
URN = {urn:nbn:de:0030-drops-158857},
doi = {10.4230/LIPIcs.ICDT.2022.11},
annote = {Keywords: Relational calculus, relative safety, safe-range, query translation}
}
@InProceedings{feier:LIPIcs.ICDT.2022.12,
author = {Feier, Cristina},
title = {{Characterising Fixed Parameter Tractability for Query Evaluation over Guarded TGDs}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.12},
URN = {urn:nbn:de:0030-drops-158869},
doi = {10.4230/LIPIcs.ICDT.2022.12},
annote = {Keywords: omq, fpt evaluation, guarded tgds, unbounded arity, submodular width}
}
@InProceedings{marx_et_al:LIPIcs.ICDT.2022.13,
author = {Marx, Maximilian and Kr\"{o}tzsch, Markus},
title = {{Tuple-Generating Dependencies Capture Complex Values}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {13:1--13:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.13},
URN = {urn:nbn:de:0030-drops-158876},
doi = {10.4230/LIPIcs.ICDT.2022.13},
annote = {Keywords: terminating standard chase, existential rules, Datalog, complexity}
}
@InProceedings{groz_et_al:LIPIcs.ICDT.2022.14,
author = {Groz, Beno\^{i}t and Lemay, Aur\'{e}lien and Staworko, S{\l}awek and Wieczorek, Piotr},
title = {{Inference of Shape Graphs for Graph Databases}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.14},
URN = {urn:nbn:de:0030-drops-158889},
doi = {10.4230/LIPIcs.ICDT.2022.14},
annote = {Keywords: RDF, Schema, Inference, Learning, Fitting, Minimality, Containment}
}
@InProceedings{bogaerts_et_al:LIPIcs.ICDT.2022.15,
author = {Bogaerts, Bart and Jakubowski, Maxime and Van den Bussche, Jan},
title = {{Expressiveness of SHACL Features}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.15},
URN = {urn:nbn:de:0030-drops-158890},
doi = {10.4230/LIPIcs.ICDT.2022.15},
annote = {Keywords: Expressive power, schema languages}
}
@InProceedings{vandevoort_et_al:LIPIcs.ICDT.2022.16,
author = {Vandevoort, Brecht and Ketsman, Bas and Koch, Christoph and Neven, Frank},
title = {{Robustness Against Read Committed for Transaction Templates with Functional Constraints}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.16},
URN = {urn:nbn:de:0030-drops-158905},
doi = {10.4230/LIPIcs.ICDT.2022.16},
annote = {Keywords: concurrency control, robustness, complexity}
}
@InProceedings{meng_et_al:LIPIcs.ICDT.2022.17,
author = {Meng, Jingfan and Wang, Huayi and Xu, Jun and Ogihara, Mitsunori},
title = {{A Dyadic Simulation Approach to Efficient Range-Summability}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {17:1--17:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.17},
URN = {urn:nbn:de:0030-drops-158915},
doi = {10.4230/LIPIcs.ICDT.2022.17},
annote = {Keywords: fast range-summation, locality-sensitive hashing, rejection sampling}
}
@InProceedings{kleestmeiner_et_al:LIPIcs.ICDT.2022.18,
author = {Kleest-Mei{\ss}ner, Sarah and Sattler, Rebecca and Schmid, Markus L. and Schweikardt, Nicole and Weidlich, Matthias},
title = {{Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {18:1--18:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.18},
URN = {urn:nbn:de:0030-drops-158922},
doi = {10.4230/LIPIcs.ICDT.2022.18},
annote = {Keywords: event queries on traces, pattern queries on strings, learning descriptive queries, complexity of query evaluation and query learning}
}
@InProceedings{munoz_et_al:LIPIcs.ICDT.2022.19,
author = {Mu\~{n}oz, Mart{\'\i}n and Riveros, Cristian},
title = {{Streaming Enumeration on Nested Documents}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.19},
URN = {urn:nbn:de:0030-drops-158935},
doi = {10.4230/LIPIcs.ICDT.2022.19},
annote = {Keywords: Streaming, nested documents, query evaluation, enumeration algorithms}
}
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