ICDT2020: List of Accepted Papers


Id Authors Title
I1 Henrik Forssell, Evgeny Kharlamov and Evgenij Thorstensen On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds
I2 Martin Grohe and Peter Lindner Infinite Probabilistic Databases
I3 Yu Chen and Ke Yi Random Sampling and Size Estimation over Cyclic Joins
I4 Yufei Tao A Simple Parallel Algorithm for Natural Joins on Binary Relations
I5 Alejandro Grez, Cristian Riveros, Martin Ugarte and Stijn Vansummeren On the Expressiveness of Languages for Complex Event Recognition
I6 Ester Livshits, Leopoldo Bertossi, Benny Kimelfeld and Moshe Sebag The Shapley Value of Tuples in Query Answering
I7 Alejandro Grez and Cristian Riveros A constant delay algorithm for the partition-by operator in complex event processing
I8 Pablo Barceló, Nelson Higuera, Jorge Pérez and Bernardo Subercaseux On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra
I9 Gaetano Geck, Frank Neven and Thomas Schwentick Distribution Constraints: The Chase for Distributed Data
I10 Batya Kenig and Dan Suciu Integrity Constraints Revisited: From Exact to Approximate Implication
I11 Bas Ketsman and Christoph Koch Datalog with Negation and Monotonicity
I12 Antoine Amarilli and Ismail Ilkan Ceylan A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs
I13 Rasmus Pagh and Johan Sivertsen The space complexity of inner product estimation
I14 Diego Figueira Containment of UC2RPQ: the hard and easy cases
I15 Heba Aamer, Bart Bogaerts, Dimitri Surinx, Evgenia Ternovska and Jan Van den Bussche Executable first-order queries in the logic of information flows
I16 Johannes Doleschal, Benny Kimelfeld, Wim Martens and Liat Peterfreund Weight Annotation in Information Extraction
I17 Dominik D. Freydenberger and Samuel M. Thompson Dynamic Complexity of Document Spanners
I18 Michael Simpson, Venkatesh Srinivasan and Alex Thomo Reverse Prevention Sampling for Misinformation Mitigation in Social Networks
I19 Jelle Hellings and Mohammad Sadoghi Coordination-free Byzantine Replication with Minimal Communication Costs
I20 Floris Geerts When can matrix query languages discern matrices?
I21 Gonzalo Navarro, Juan L. Reutter and Javiel Rojas-Ledesma Optimal Joins using Compact Data Structures
I22 Cristian Riveros and Jorge Salas A family of centrality measures for graph data based on subgraphs