default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd ICDT 2019: Lisbon, Portugal
- Pablo Barceló, Marco Calautti:
22nd International Conference on Database Theory, ICDT 2019, Lisbon, Portugal, March 26-28, 2019. LIPIcs 127, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-101-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Dan Olteanu:
Learning Models over Relational Databases (Invited Talk). 1:1-1:1 - Lise Getoor:
The Power of Relational Learning (Invited Talk). 2:1-2:1 - Markus Krötzsch
, Maximilian Marx, Sebastian Rudolph:
The Power of the Terminating Chase (Invited Talk). 3:1-3:17 - Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates in Worst-Case Optimal Time. 4:1-4:18 - Alejandro Grez, Cristian Riveros, Martín Ugarte:
A Formal Framework for Complex Event Processing. 5:1-5:18 - Christopher De Sa, Ihab F. Ilyas, Benny Kimelfeld, Christopher Ré, Theodoros Rekatsinas:
A Formal Framework for Probabilistic Unclean Databases. 6:1-6:18 - Floris Geerts:
On the Expressive Power of Linear Algebra on Graphs. 7:1-7:19 - Marco Console, Paolo Guagliardo, Leonid Libkin:
Fragments of Bag Relational Algebra: Expressiveness and Certain Answers. 8:1-8:16 - Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan:
Categorical Range Reporting with Frequencies. 9:1-9:19 - Nirman Kumar, Benjamin Raichel, Stavros Sintos, Gregory Van Buskirk:
Approximating Distance Measures for the Skyline. 10:1-10:20 - Yuliang Li, Jianguo Wang, Benjamin S. Pullman, Nuno Bandeira, Yannis Papakonstantinou:
Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees. 11:1-11:20 - Silviu Maniu, Pierre Senellart, Suraj Jog:
An Experimental Study of the Treewidth of Real-World Graph Data. 12:1-12:18 - Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld:
Recursive Programs for Document Spanners. 13:1-13:18 - Frank Neven, Thomas Schwentick, Christopher Spinrath, Brecht Vandevoort:
Parallel-Correctness and Parallel-Boundedness for Datalog Programs. 14:1-14:19 - Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. 15:1-15:18 - Leopoldo E. Bertossi, Georg Gottlob, Reinhard Pichler:
Datalog: Bag Semantics via Set Semantics. 16:1-16:19 - Marco Calautti, Andreas Pieris:
Oblivious Chase Termination: The Sticky Case. 17:1-17:18 - Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo, Federico Ulliana:
A Single Approach to Decide Chase Termination on Linear Existential Rules. 18:1-18:19 - Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx, Jan Van den Bussche:
Additive First-Order Queries. 19:1-19:14 - Stefan Mengel, Sebastian Skritek:
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. 20:1-20:18 - Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, Dan Suciu:
Boolean Tensor Decomposition for Conjunctive Queries with Negation. 21:1-21:19 - Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. 22:1-22:19 - Paraschos Koutris, Jef Wijsen:
Consistent Query Answering for Primary Keys in Logspace. 23:1-23:19 - Émilie Grienenberger, Martin Ritzert:
Learning Definable Hypotheses on Trees. 24:1-24:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
