@Proceedings{barcelo_et_al:LIPIcs.ICDT.2019,
title = {{LIPIcs, Volume 127, ICDT'19, Complete Volume}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019},
URN = {urn:nbn:de:0030-drops-103630},
doi = {10.4230/LIPIcs.ICDT.2019},
annote = {Keywords: Computing Methodologies, Knowledge Representation and Reasoning, Theory of computation, Data modeling, Incomplete, inconsistent and uncertain database Information systems, Data management systems, Data streams, Database query processing, Incomplete data, Inconsistent data, Relational database model}
}
@InProceedings{barcelo_et_al:LIPIcs.ICDT.2019.0,
author = {Barcelo, Pablo and Calautti, Marco},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.0},
URN = {urn:nbn:de:0030-drops-103020},
doi = {10.4230/LIPIcs.ICDT.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{olteanu:LIPIcs.ICDT.2019.1,
author = {Olteanu, Dan},
title = {{Learning Models over Relational Databases}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.1},
URN = {urn:nbn:de:0030-drops-103034},
doi = {10.4230/LIPIcs.ICDT.2019.1},
annote = {Keywords: In-database analytics, Data complexity, Feature extraction queries, Database dependencies, Model reparameterization}
}
@InProceedings{getoor:LIPIcs.ICDT.2019.2,
author = {Getoor, Lise},
title = {{The Power of Relational Learning}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.2},
URN = {urn:nbn:de:0030-drops-103048},
doi = {10.4230/LIPIcs.ICDT.2019.2},
annote = {Keywords: Machine learning, Probabilistic soft logic, Relational model}
}
@InProceedings{krotzsch_et_al:LIPIcs.ICDT.2019.3,
author = {Kr\"{o}tzsch, Markus and Marx, Maximilian and Rudolph, Sebastian},
title = {{The Power of the Terminating Chase}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {3:1--3:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.3},
URN = {urn:nbn:de:0030-drops-103057},
doi = {10.4230/LIPIcs.ICDT.2019.3},
annote = {Keywords: Existential rules, Tuple-generating dependencies, all-instances chase termination, expressive power, data complexity}
}
@InProceedings{kara_et_al:LIPIcs.ICDT.2019.4,
author = {Kara, Ahmet and Ngo, Hung Q. and Nikolic, Milos and Olteanu, Dan and Zhang, Haozhe},
title = {{Counting Triangles under Updates in Worst-Case Optimal Time}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.4},
URN = {urn:nbn:de:0030-drops-103068},
doi = {10.4230/LIPIcs.ICDT.2019.4},
annote = {Keywords: incremental view maintenance, amortized analysis, data skew}
}
@InProceedings{grez_et_al:LIPIcs.ICDT.2019.5,
author = {Grez, Alejandro and Riveros, Cristian and Ugarte, Mart{\'\i}n},
title = {{A Formal Framework for Complex Event Processing}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.5},
URN = {urn:nbn:de:0030-drops-103079},
doi = {10.4230/LIPIcs.ICDT.2019.5},
annote = {Keywords: Complex event processing, streaming evaluation, constant delay enumeration}
}
@InProceedings{desa_et_al:LIPIcs.ICDT.2019.6,
author = {De Sa, Christopher and Ilyas, Ihab F. and Kimelfeld, Benny and R\'{e}, Christopher and Rekatsinas, Theodoros},
title = {{A Formal Framework for Probabilistic Unclean Databases}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {6:1--6:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.6},
URN = {urn:nbn:de:0030-drops-103083},
doi = {10.4230/LIPIcs.ICDT.2019.6},
annote = {Keywords: Unclean databases, data cleaning, probabilistic databases, noisy channel}
}
@InProceedings{geerts:LIPIcs.ICDT.2019.7,
author = {Geerts, Floris},
title = {{On the Expressive Power of Linear Algebra on Graphs}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {7:1--7:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.7},
URN = {urn:nbn:de:0030-drops-103093},
doi = {10.4230/LIPIcs.ICDT.2019.7},
annote = {Keywords: matrix query languages, graph queries, graph theory, logics}
}
@InProceedings{console_et_al:LIPIcs.ICDT.2019.8,
author = {Console, Marco and Guagliardo, Paolo and Libkin, Leonid},
title = {{Fragments of Bag Relational Algebra: Expressiveness and Certain Answers}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.8},
URN = {urn:nbn:de:0030-drops-103106},
doi = {10.4230/LIPIcs.ICDT.2019.8},
annote = {Keywords: bag semantics, relational algebra, expressivity, certain answers, complexity}
}
@InProceedings{ganguly_et_al:LIPIcs.ICDT.2019.9,
author = {Ganguly, Arnab and Munro, J. Ian and Nekrich, Yakov and Shah, Rahul and Thankachan, Sharma V.},
title = {{Categorical Range Reporting with Frequencies}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {9:1--9:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.9},
URN = {urn:nbn:de:0030-drops-103115},
doi = {10.4230/LIPIcs.ICDT.2019.9},
annote = {Keywords: Data Structures, Range Reporting, Range Counting, Categorical Range Reporting, Orthogonal Range Query}
}
@InProceedings{kumar_et_al:LIPIcs.ICDT.2019.10,
author = {Kumar, Nirman and Raichel, Benjamin and Sintos, Stavros and Van Buskirk, Gregory},
title = {{Approximating Distance Measures for the Skyline}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.10},
URN = {urn:nbn:de:0030-drops-103125},
doi = {10.4230/LIPIcs.ICDT.2019.10},
annote = {Keywords: Skyline, Pareto optimal, Approximation, Hardness, Multi-criteria decision making}
}
@InProceedings{li_et_al:LIPIcs.ICDT.2019.11,
author = {Li, Yuliang and Wang, Jianguo and Pullman, Benjamin and Bandeira, Nuno and Papakonstantinou, Yannis},
title = {{Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.11},
URN = {urn:nbn:de:0030-drops-103135},
doi = {10.4230/LIPIcs.ICDT.2019.11},
annote = {Keywords: Vector databases, Similarity search, Cosine, Threshold Algorithm}
}
@InProceedings{maniu_et_al:LIPIcs.ICDT.2019.12,
author = {Maniu, Silviu and Senellart, Pierre and Jog, Suraj},
title = {{An Experimental Study of the Treewidth of Real-World Graph Data}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {12:1--12:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.12},
URN = {urn:nbn:de:0030-drops-103147},
doi = {10.4230/LIPIcs.ICDT.2019.12},
annote = {Keywords: Treewidth, Graph decompositions, Experiments, Query processing}
}
@InProceedings{peterfreund_et_al:LIPIcs.ICDT.2019.13,
author = {Peterfreund, Liat and Cate, Balder ten and Fagin, Ronald and Kimelfeld, Benny},
title = {{Recursive Programs for Document Spanners}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.13},
URN = {urn:nbn:de:0030-drops-103155},
doi = {10.4230/LIPIcs.ICDT.2019.13},
annote = {Keywords: Information Extraction, Document Spanners, Polynomial Time, Recursion, Regular Expressions, Datalog}
}
@InProceedings{neven_et_al:LIPIcs.ICDT.2019.14,
author = {Neven, Frank and Schwentick, Thomas and Spinrath, Christopher and Vandevoort, Brecht},
title = {{Parallel-Correctness and Parallel-Boundedness for Datalog Programs}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {14:1--14:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.14},
URN = {urn:nbn:de:0030-drops-103165},
doi = {10.4230/LIPIcs.ICDT.2019.14},
annote = {Keywords: Datalog, distributed databases, distributed evaluation, decision problems, complexity}
}
@InProceedings{gluch_et_al:LIPIcs.ICDT.2019.15,
author = {G{\l}uch, Grzegorz and Marcinkowski, Jerzy and Ostropolski-Nalewaja, Piotr},
title = {{The First Order Truth Behind Undecidability of Regular Path Queries Determinacy}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {15:1--15:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.15},
URN = {urn:nbn:de:0030-drops-103175},
doi = {10.4230/LIPIcs.ICDT.2019.15},
annote = {Keywords: database theory, query, view, determinacy, recursive path queries}
}
@InProceedings{bertossi_et_al:LIPIcs.ICDT.2019.16,
author = {Bertossi, Leopoldo and Gottlob, Georg and Pichler, Reinhard},
title = {{Datalog: Bag Semantics via Set Semantics}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {16:1--16:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.16},
URN = {urn:nbn:de:0030-drops-103188},
doi = {10.4230/LIPIcs.ICDT.2019.16},
annote = {Keywords: Datalog, duplicates, multisets, query answering, chase, Datalog+/-}
}
@InProceedings{calautti_et_al:LIPIcs.ICDT.2019.17,
author = {Calautti, Marco and Pieris, Andreas},
title = {{Oblivious Chase Termination: The Sticky Case}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {17:1--17:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.17},
URN = {urn:nbn:de:0030-drops-103197},
doi = {10.4230/LIPIcs.ICDT.2019.17},
annote = {Keywords: Chase procedure, tuple-generating dependencies, stickiness, termination, computational complexity}
}
@InProceedings{leclere_et_al:LIPIcs.ICDT.2019.18,
author = {Lecl\`{e}re, Michel and Mugnier, Marie-Laure and Thomazo, Micha\"{e}l and Ulliana, Federico},
title = {{A Single Approach to Decide Chase Termination on Linear Existential Rules}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {18:1--18:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.18},
URN = {urn:nbn:de:0030-drops-103200},
doi = {10.4230/LIPIcs.ICDT.2019.18},
annote = {Keywords: Chase, Tuple Generating Dependencies, Existential rules, Decidability}
}
@InProceedings{berger_et_al:LIPIcs.ICDT.2019.19,
author = {Berger, Gerald and Otto, Martin and Pieris, Andreas and Surinx, Dimitri and Van den Bussche, Jan},
title = {{Additive First-Order Queries}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.19},
URN = {urn:nbn:de:0030-drops-103217},
doi = {10.4230/LIPIcs.ICDT.2019.19},
annote = {Keywords: Expressive power}
}
@InProceedings{mengel_et_al:LIPIcs.ICDT.2019.20,
author = {Mengel, Stefan and Skritek, Sebastian},
title = {{Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.20},
URN = {urn:nbn:de:0030-drops-103220},
doi = {10.4230/LIPIcs.ICDT.2019.20},
annote = {Keywords: SPARQL, well-designed pattern trees, query evaluation, FPT, characterizing tractable classes}
}
@InProceedings{abokhamis_et_al:LIPIcs.ICDT.2019.21,
author = {Abo Khamis, Mahmoud and Ngo, Hung Q. and Olteanu, Dan and Suciu, Dan},
title = {{Boolean Tensor Decomposition for Conjunctive Queries with Negation}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {21:1--21:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.21},
URN = {urn:nbn:de:0030-drops-103236},
doi = {10.4230/LIPIcs.ICDT.2019.21},
annote = {Keywords: color-coding, combined complexity, negation, query evaluation}
}
@InProceedings{amarilli_et_al:LIPIcs.ICDT.2019.22,
author = {Amarilli, Antoine and Bourhis, Pierre and Mengel, Stefan and Niewerth, Matthias},
title = {{Constant-Delay Enumeration for Nondeterministic Document Spanners}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {22:1--22:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.22},
URN = {urn:nbn:de:0030-drops-103246},
doi = {10.4230/LIPIcs.ICDT.2019.22},
annote = {Keywords: enumeration, spanners, automata}
}
@InProceedings{koutris_et_al:LIPIcs.ICDT.2019.23,
author = {Koutris, Paraschos and Wijsen, Jef},
title = {{Consistent Query Answering for Primary Keys in Logspace}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {23:1--23:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.23},
URN = {urn:nbn:de:0030-drops-103252},
doi = {10.4230/LIPIcs.ICDT.2019.23},
annote = {Keywords: conjunctive queries, consistent query answering, Datalog, primary keys}
}
@InProceedings{grienenberger_et_al:LIPIcs.ICDT.2019.24,
author = {Grienenberger, Emilie and Ritzert, Martin},
title = {{Learning Definable Hypotheses on Trees}},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-101-6},
ISSN = {1868-8969},
year = {2019},
volume = {127},
editor = {Barcelo, Pablo and Calautti, Marco},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.24},
URN = {urn:nbn:de:0030-drops-103261},
doi = {10.4230/LIPIcs.ICDT.2019.24},
annote = {Keywords: monadic second-order logic, trees, query learning}
}
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