LIPIcs, Volume 155, ICDT 2020

• Carsten Lutz and Jean Christoph Jung LIPIcs, Vol. 155, ICDT 2020, Complete Volume 10.4230/LIPIcs.ICDT.2020
• Carsten Lutz and Jean Christoph Jung Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ICDT.2020.0
• Benny Kimelfeld Facets of Probabilistic Databases (Invited Talk) 10.4230/LIPIcs.ICDT.2020.1
• Jerzy Marcinkowski What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk) 10.4230/LIPIcs.ICDT.2020.2
• Juan L. Reutter Current Challenges in Graph Databases (Invited Talk) 10.4230/LIPIcs.ICDT.2020.3
• Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, and Jan Van den Bussche Executable First-Order Queries in the Logic of Information Flows 10.4230/LIPIcs.ICDT.2020.4
• Antoine Amarilli and İsmail İlkan Ceylan A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs 10.4230/LIPIcs.ICDT.2020.5
• Pablo Barceló, Nelson Higuera, Jorge Pérez, and Bernardo Subercaseaux On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra 10.4230/LIPIcs.ICDT.2020.6
• Yu Chen and Ke Yi Random Sampling and Size Estimation Over Cyclic Joins 10.4230/LIPIcs.ICDT.2020.7
• Johannes Doleschal, Benny Kimelfeld, Wim Martens, and Liat Peterfreund Weight Annotation in Information Extraction 10.4230/LIPIcs.ICDT.2020.8
• Diego Figueira Containment of UC2RPQ: The Hard and Easy Cases 10.4230/LIPIcs.ICDT.2020.9
• Henrik Forssell, Evgeny Kharlamov, and Evgenij Thorstensen On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds 10.4230/LIPIcs.ICDT.2020.10
• Dominik D. Freydenberger and Sam M. Thompson Dynamic Complexity of Document Spanners 10.4230/LIPIcs.ICDT.2020.11
• Floris Geerts When Can Matrix Query Languages Discern Matrices? 10.4230/LIPIcs.ICDT.2020.12
• Gaetano Geck, Frank Neven, and Thomas Schwentick Distribution Constraints: The Chase for Distributed Data 10.4230/LIPIcs.ICDT.2020.13
• Alejandro Grez and Cristian Riveros Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing 10.4230/LIPIcs.ICDT.2020.14
• Alejandro Grez, Cristian Riveros, Martín Ugarte, and Stijn Vansummeren On the Expressiveness of Languages for Complex Event Recognition 10.4230/LIPIcs.ICDT.2020.15
• Martin Grohe and Peter Lindner Infinite Probabilistic Databases 10.4230/LIPIcs.ICDT.2020.16
• Jelle Hellings and Mohammad Sadoghi Coordination-Free Byzantine Replication with Minimal Communication Costs 10.4230/LIPIcs.ICDT.2020.17
• Batya Kenig and Dan Suciu Integrity Constraints Revisited: From Exact to Approximate Implication 10.4230/LIPIcs.ICDT.2020.18
• Bas Ketsman and Christoph Koch Datalog with Negation and Monotonicity 10.4230/LIPIcs.ICDT.2020.19
• Ester Livshits, Leopoldo Bertossi, Benny Kimelfeld, and Moshe Sebag The Shapley Value of Tuples in Query Answering 10.4230/LIPIcs.ICDT.2020.20
• Gonzalo Navarro, Juan L. Reutter, and Javiel Rojas-Ledesma Optimal Joins Using Compact Data Structures 10.4230/LIPIcs.ICDT.2020.21
• Rasmus Pagh and Johan Sivertsen The Space Complexity of Inner Product Filters 10.4230/LIPIcs.ICDT.2020.22
• Cristian Riveros and Jorge Salas A Family of Centrality Measures for Graph Data Based on Subgraphs 10.4230/LIPIcs.ICDT.2020.23
• Michael Simpson, Venkatesh Srinivasan, and Alex Thomo Reverse Prevention Sampling for Misinformation Mitigation in Social Networks 10.4230/LIPIcs.ICDT.2020.24
• Yufei Tao A Simple Parallel Algorithm for Natural Joins on Binary Relations 10.4230/LIPIcs.ICDT.2020.25