22nd International Conference on Database Theory - Pablo Barcelo Marco Calautti Edited by - Schloss Dagstuhl
←
→
Page content transcription
If your browser does not render page correctly, please read the page content below
22nd International Conference on Database Theory ICDT 2019, March 26–28, 2019, Lisbon, Portugal Edited by Pablo Barcelo Marco Calautti L I P I c s – V o l . 127 – ICDT 2019 www.dagstuhl.de/lipics
Editors Pablo Barcelo Department of Computer Science, Universidad de Chile, CL pbarcelo@dcc.uchile.cl Marco Calautti School of Informatics, University of Edinburgh, UK mcalautt@inf.ed.ac.uk ACM Classification 2012 Computing Methodologies → Knowledge Representation and Reasoning; Theory of computation → Data modeling; Theory of computation → Incomplete, inconsistent, and uncertain databases; Information systems → Data management systems; Information systems → Data streams; Information systems → Database query processing; Information systems → Incomplete data; Information systems → Inconsistent data; Information systems → Relational database model; Information systems → Relational database query languages; Mathematics of computing → Graph theory; Theory of computation → Complexity theory and logic; Theory of computation → Data structures and algorithms for data management; Theory of computation → Semantics and reasoning ISBN 978-3-95977-101-6 Published online and open access by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at https://www.dagstuhl.de/dagpub/978-3-95977-101-6. Publication date March, 2019 Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at https://portal.dnb.de. License This work is licensed under a Creative Commons Attribution 3.0 Unported license (CC-BY 3.0): https://creativecommons.org/licenses/by/3.0/legalcode. In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors’ moral rights: Attribution: The work must be attributed to its authors. The copyright is retained by the corresponding authors. Digital Object Identifier: 10.4230/LIPIcs.ICDT.2019.0 ISBN 978-3-95977-101-6 ISSN 1868-8969 https://www.dagstuhl.de/lipics
0:iii LIPIcs – Leibniz International Proceedings in Informatics LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge. Editorial Board Luca Aceto (Chair, Gran Sasso Science Institute and Reykjavik University) Susanne Albers (TU München) Christel Baier (TU Dresden) Javier Esparza (TU München) Michael Mitzenmacher (Harvard University) Madhavan Mukund (Chennai Mathematical Institute) Anca Muscholl (University Bordeaux) Catuscia Palamidessi (INRIA) Raimund Seidel (Saarland University and Schloss Dagstuhl – Leibniz-Zentrum für Informatik) Thomas Schwentick (TU Dortmund) Reinhard Wilhelm (Saarland University) ISSN 1868-8969 https://www.dagstuhl.de/lipics ICDT 2019
Contents Preface Pablo Barcelo and Marco Calautti . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0:vii Organization ................................................................................ 0:ix External Reviewers ................................................................................ 0:xi Contributing Authors ................................................................................ 0:xiii ICDT 2019 Test of Time Award Wenfei Fan, Magdalena Ortiz and Ke Yi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0:xv Invited Talks Learning Models over Relational Databases Dan Olteanu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:1–1:1 The Power of Relational Learning Lise Getoor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:1–2:1 The Power of the Terminating Chase Markus Krötzsch, Maximilian Marx, and Sebastian Rudolph . . . . . . . . . . . . . . . . . . . . . . 3:1–3:17 Regular Papers Counting Triangles under Updates in Worst-Case Optimal Time Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang . . . . . . 4:1–4:18 A Formal Framework for Complex Event Processing Alejandro Grez, Cristian Riveros, and Martín Ugarte . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5:1–5:18 A Formal Framework for Probabilistic Unclean Databases Christopher De Sa, Ihab F. Ilyas, Benny Kimelfeld, Christopher Ré, and Theodoros Rekatsinas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:1–6:18 On the Expressive Power of Linear Algebra on Graphs Floris Geerts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7:1–7:19 Fragments of Bag Relational Algebra: Expressiveness and Certain Answers Marco Console, Paolo Guagliardo, and Leonid Libkin . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8:1–8:16 Categorical Range Reporting with Frequencies Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, and Sharma V. Thankachan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9:1–9:19 Approximating Distance Measures for the Skyline Nirman Kumar, Benjamin Raichel, Stavros Sintos, and Gregory Van Buskirk . . . . 10:1–10:20 22nd International Conference on Database Theory (ICDT 2019). Editors: Pablo Barcelo and Marco Calautti Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
0:vi Contents Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees Yuliang Li, Jianguo Wang, Benjamin Pullman, Nuno Bandeira, and Yannis Papakonstantinou . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11:1–11:20 An Experimental Study of the Treewidth of Real-World Graph Data Silviu Maniu, Pierre Senellart, and Suraj Jog . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12:1–12:18 Recursive Programs for Document Spanners Liat Peterfreund, Balder ten Cate, Ronald Fagin, and Benny Kimelfeld . . . . . . . . . . 13:1–13:18 Parallel-Correctness and Parallel-Boundedness for Datalog Programs Frank Neven, Thomas Schwentick, Christopher Spinrath, and Brecht Vandevoort . 14:1–14:19 The First Order Truth Behind Undecidability of Regular Path Queries Determinacy Grzegorz Głuch, Jerzy Marcinkowski, and Piotr Ostropolski-Nalewaja . . . . . . . . . . . . 15:1–15:18 Datalog: Bag Semantics via Set Semantics Leopoldo Bertossi, Georg Gottlob, and Reinhard Pichler . . . . . . . . . . . . . . . . . . . . . . . . . . 16:1–16:19 Oblivious Chase Termination: The Sticky Case Marco Calautti and Andreas Pieris . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17:1–17:18 A Single Approach to Decide Chase Termination on Linear Existential Rules Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo, and Federico Ulliana . . . 18:1–18:19 Additive First-Order Queries Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx, and Jan Van den Bussche . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19:1–19:14 Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection Stefan Mengel and Sebastian Skritek . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20:1–20:18 Boolean Tensor Decomposition for Conjunctive Queries with Negation Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, and Dan Suciu . . . . . . . . . . . . . 21:1–21:19 Constant-Delay Enumeration for Nondeterministic Document Spanners Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth . . . . . . . . 22:1–22:19 Consistent Query Answering for Primary Keys in Logspace Paraschos Koutris and Jef Wijsen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23:1–23:19 Learning Definable Hypotheses on Trees Emilie Grienenberger and Martin Ritzert . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24:1–24:18
Preface The 22nd International Conference on Database Theory (ICDT 2019) was held in Lisbon, Portugal, March 26–28, 2019. The proceedings of ICDT 2019 include an extended abstract of a keynote by Dan Olteanu (University of Oxford), an extended abstract of a keynote by Lise Getoor (University of California, Santa Cruz), a paper by Markus Kroetzsch (Technical University of Dresden) and coauthors based on his invited tutorial, a laudation concerning the ICDT 2019 Test of Time Award, and 21 research papers that were selected by the Program Committee from 67 submissions. The Program Committee selected the paper Counting Triangles under Updates in Worst- Case Optimal Time by Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu and Haozhe Zhang for the ICDT 2019 Best Paper Award. Furthermore, a specially designated committee formed by Wenfei Fan, Magdalena Ortiz, and Ke Yi decided to give the Test of Time Award for ICDT 2019 to the paper Automatic verification of data-centric business processes by Alin Deutsch, Richard Hull, Fabio Patrizi, and Victor Vianu (originally published in ICDT 2009). We sincerely congratulate to the authors of these award winning papers! We would like to thank all people who contributed to the success of ICDT 2019, including authors who submitted papers, keynote and tutorial speakers, and, of course, all members of the Program Committee, and the external reviewers, for the very dedicated work they have done over the two submission cycles of ICDT 2019. Their help and assistance were crucial to ensure that the final program of the conference keeps satisfying the highest standards. We would also like to thank the ICDT Council members for their support on a wide variety of matters concerning ICDT, and the local organizers of the EDBT/ICDT 2019 conference, leaded by General Chair Helena Galhardas (Universidade de Lisboa, Portugal), for their constant help in the organization of the conference and some co-located events. Finally, we wish to acknowledge Dagstuhl Publishing for their support with the publication of the proceedings in the LIPIcs (Leibniz International Proceedings in Informatics) Series. Pablo Barcelo and Marco Calautti March 2019 22nd International Conference on Database Theory (ICDT 2019). Editors: Pablo Barcelo and Marco Calautti Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
Organization Conference Chair Wim Martens (University of Bayreuth) Program Chair Pablo Barcelo (University of Chile) Proceedings and Publicity Chair Marco Calautti (University of Edinburgh) Program Committee Members Isolde Adler (University of Leeds) Antoine Amarilli (Telecom ParisTech) Paul Beame (University of Washington) Elena Botoeva (Imperial College London) Victor Dalmau (Universitat Pompeu Fabra) Diego Figueira (Labri, CNRS) Dominik D. Freydenberger (Loughborough University) Paolo Guagliardo (University of Edinburgh) Zengfeng Huang (The University of New South Wales) Benny Kimelfeld (Technion, Israel) Paris Koutris (University of Wisconsin) Maurizio Lenzerini (Sapienza University of Rome) Yakov Nekrich (University of Waterloo) Matthias Niewerth (University of Bayreuth) Cristian Riveros (PUC, Chile) Sebastian Skritek (TU Vienna) Julia Stoyanovich (Drexel University) Szymon Torunczyk (University of Warsaw) Ke Yi (HKUST) Thomas Zeume (University of Dortmund) 22nd International Conference on Database Theory (ICDT 2019). Editors: Pablo Barcelo and Marco Calautti Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
External Reviewers Giovanni Amendola Mikaël Monet Christoph Berkholz Frank Neven Leopoldo Bertossi Miguel Romero Orth Marco Console Paweł Parys Shaleen Deep Thomas Pellissier Tanon Johannes Doleschal Liat Peterfreund Nadime Francis Andreas Pieris Travis Gagie Juan L. Reutter Floris Geerts Vladislav Ryzhikov Boris Glavic Emanuel Sallinger Tomasz Gogacz Luc Segoufin Alejandro Grez Mantas Simkus Aidan Hogan Dan Suciu Jean Christoph Jung Egor V. Kostylev Stijn Vansummeren Sławomir Lasota Nils Vortmeier Leonid Libkin Domagoj Vrgoc Ester Livshits Zhewei Wei Brendan Lucier Xuan Wu 22nd International Conference on Database Theory (ICDT 2019). Editors: Pablo Barcelo and Marco Calautti Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
Contributing Authors Antoine Amarilli Markus Krötzsch Benjamin Raichel Nuno Bandeira Nirman Kumar Christopher Ré Gerald Berger Michel Leclère Theodoros Rekatsinas Leopoldo Bertossi Yuliang Li Martin Ritzert Pierre Bourhis Leonid Libkin Cristian Riveros Marco Calautti Silviu Maniu Sebastian Rudolph Balder ten Cate Jerzy Marcinkowski Thomas Schwentick Marco Console Maximilian Marx Pierre Senellart Christopher De Sa Stefan Mengel Rahul Shah Ronald Fagin Marie-Laure Mugnier Stavros Sintos Arnab Ganguly Ian Munro Sebastian Skritek Floris Geerts Yakov Nekrich Christopher Spinrath Lise Getoor Frank Neven Dan Suciu Grzegorz Gluch Hung Q. Ngo Dimitri Surinx Georg Gottlob Matthias Niewerth Sharma Thankachan Alejandro Grez Milos Nikolic Michaël Thomazo Emilie Grienenberger Dan Olteanu Martín Ugarte Paolo Guagliardo Piotr Ostropolski-Nalewaja Federico Ulliana Ihab F. Ilyas Martin Otto Gregory Van Buskirk Suraj Jog Yannis Papakonstantinou Jan Van den Bussche Ahmet Kara Liat Peterfreund Brecht Vandevoort Mahmoud Abo Khamis Reinhard Pichler Jianguo Wang Benny Kimelfeld Andreas Pieris Jef Wijsen Paraschos Koutris Benjamin Pullman Haozhe Zhang 22nd International Conference on Database Theory (ICDT 2019). Editors: Pablo Barcelo and Marco Calautti Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
ICDT 2019 Test of Time Award In 2013, the International Conference on Database Theory (ICDT) began awarding the ICDT test-of-time (ToT) award, with the goal of recognizing one paper, or a small number of papers, presented at ICDT a decade earlier that have best met the "test of time". In 2019, the award recognizes a paper from the ICDT 2009 proceedings that has had the most impact in terms of research, methodology, conceptual contribution, or transfer to practice over the past decade. The award was presented during the EDBT/ICDT 2019 Joint Conference, March 26-29, 2019, in Lisbon, Portugal. The 2019 ToT Committee consists of Wenfei Fan (chair), Magdalena Ortiz, and Ke Yi. After careful consideration and soliciting external assessments, the committee has chosen the following recipient of the 2019 ICDT Test of Time Award: Automatic verification of data-centric business processes Alin Deutsch, Richard Hull, Fabio Patrizi, Victor Vianu The paper has been a cornerstone in the research on artifact-centric and data-aware processes. It opens up the possibility of verifying data-aware processes not only in niche cases but also in quite broad classes. It provides a formalization of IBM’s artifact-based approach to business processes, and models arbitrary inputs from external users with infinite domains. This gives rise to processes that have infinite states and hence are impossible to verify through standard model checking techniques. In addition to this formalization, it investigates verification of properties in an extension of LTL over artifacts, which is challenging since it deals with infinite alphabets. The paper has generated impact not only on database and business process communities, but also influenced artificial intelligence, verification and Web services. It has received over 250 citations coming from these diverse communities. In addition, its techniques have influenced theoretical work on fundamental aspects of languages over infinite alphabets. Wenfei Fan Magdalena Ortiz Ke Yi University of Edinburgh Vienna University of Hong Kong University of Technology (TU Wien) Science and Technology The ICDT Test-of-Time Award Committee for 2019 22nd International Conference on Database Theory (ICDT 2019). Editors: Pablo Barcelo and Marco Calautti Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
You can also read