LIPIcs, Volume 127, ICDT 2019

• Pablo Barcelo and Marco Calautti LIPIcs, Volume 127, ICDT'19, Complete Volume 10.4230/LIPIcs.ICDT.2019
• Pablo Barcelo and Marco Calautti Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ICDT.2019.0
• Dan Olteanu Learning Models over Relational Databases (Invited Talk) 10.4230/LIPIcs.ICDT.2019.1
• Lise Getoor The Power of Relational Learning (Invited Talk) 10.4230/LIPIcs.ICDT.2019.2
• Markus Krötzsch, Maximilian Marx, and Sebastian Rudolph The Power of the Terminating Chase (Invited Talk) 10.4230/LIPIcs.ICDT.2019.3
• Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang Counting Triangles under Updates in Worst-Case Optimal Time 10.4230/LIPIcs.ICDT.2019.4
• Alejandro Grez, Cristian Riveros, and Martín Ugarte A Formal Framework for Complex Event Processing 10.4230/LIPIcs.ICDT.2019.5
• Christopher De Sa, Ihab F. Ilyas, Benny Kimelfeld, Christopher Ré, and Theodoros Rekatsinas A Formal Framework for Probabilistic Unclean Databases 10.4230/LIPIcs.ICDT.2019.6
• Floris Geerts On the Expressive Power of Linear Algebra on Graphs 10.4230/LIPIcs.ICDT.2019.7
• Marco Console, Paolo Guagliardo, and Leonid Libkin Fragments of Bag Relational Algebra: Expressiveness and Certain Answers 10.4230/LIPIcs.ICDT.2019.8
• Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, and Sharma V. Thankachan Categorical Range Reporting with Frequencies 10.4230/LIPIcs.ICDT.2019.9
• Nirman Kumar, Benjamin Raichel, Stavros Sintos, and Gregory Van Buskirk Approximating Distance Measures for the Skyline 10.4230/LIPIcs.ICDT.2019.10
• Yuliang Li, Jianguo Wang, Benjamin Pullman, Nuno Bandeira, and Yannis Papakonstantinou Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees 10.4230/LIPIcs.ICDT.2019.11
• Silviu Maniu, Pierre Senellart, and Suraj Jog An Experimental Study of the Treewidth of Real-World Graph Data 10.4230/LIPIcs.ICDT.2019.12
• Liat Peterfreund, Balder ten Cate, Ronald Fagin, and Benny Kimelfeld Recursive Programs for Document Spanners 10.4230/LIPIcs.ICDT.2019.13
• Frank Neven, Thomas Schwentick, Christopher Spinrath, and Brecht Vandevoort Parallel-Correctness and Parallel-Boundedness for Datalog Programs 10.4230/LIPIcs.ICDT.2019.14
• Grzegorz Głuch, Jerzy Marcinkowski, and Piotr Ostropolski-Nalewaja The First Order Truth Behind Undecidability of Regular Path Queries Determinacy 10.4230/LIPIcs.ICDT.2019.15
• Leopoldo Bertossi, Georg Gottlob, and Reinhard Pichler Datalog: Bag Semantics via Set Semantics 10.4230/LIPIcs.ICDT.2019.16
• Marco Calautti and Andreas Pieris Oblivious Chase Termination: The Sticky Case 10.4230/LIPIcs.ICDT.2019.17
• Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo, and Federico Ulliana A Single Approach to Decide Chase Termination on Linear Existential Rules 10.4230/LIPIcs.ICDT.2019.18
• Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx, and Jan Van den Bussche Additive First-Order Queries 10.4230/LIPIcs.ICDT.2019.19
• Stefan Mengel and Sebastian Skritek Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection 10.4230/LIPIcs.ICDT.2019.20
• Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, and Dan Suciu Boolean Tensor Decomposition for Conjunctive Queries with Negation 10.4230/LIPIcs.ICDT.2019.21
• Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth Constant-Delay Enumeration for Nondeterministic Document Spanners 10.4230/LIPIcs.ICDT.2019.22
• Paraschos Koutris and Jef Wijsen Consistent Query Answering for Primary Keys in Logspace 10.4230/LIPIcs.ICDT.2019.23
• Emilie Grienenberger and Martin Ritzert Learning Definable Hypotheses on Trees 10.4230/LIPIcs.ICDT.2019.24