| 2020 | Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing. | Alejandro Grez, Cristian Riveros |
| 2020 | When Can Matrix Query Languages Discern Matrices? | Floris Geerts |
| 2020 | Distribution Constraints: The Chase for Distributed Data. | Gaetano Geck, Frank Neven, Thomas Schwentick |
| 2020 | Dynamic Complexity of Document Spanners. | Dominik D. Freydenberger, Sam M. Thompson |
| 2020 | On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds. | Henrik Forssell, Evgeny Kharlamov, Evgenij Thorstensen |
| 2020 | Containment of UC2RPQ: The Hard and Easy Cases. | Diego Figueira |
| 2020 | Weight Annotation in Information Extraction. | Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund |
| 2020 | Random Sampling and Size Estimation Over Cyclic Joins. | Yu Chen, Ke Yi |
| 2020 | On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. | Pablo Barcel, Nelson Higuera, Jorge Prez, Bernardo Subercaseaux |
| 2020 | A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs. | Antoine Amarilli, Ismail Ilkan Ceylan |
| 2020 | Executable First-Order Queries in the Logic of Information Flows. | Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche |
| 2019 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2019 | A Formal Framework for Probabilistic Unclean Databases. | Christopher De Sa, Ihab F. Ilyas, Benny Kimelfeld, Christopher R, Theodoros Rekatsinas |
| 2019 | Recursive Programs for Document Spanners. | Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld |
| 2019 | Learning Models over Relational Databases (Invited Talk). | Dan Olteanu |
| 2019 | Parallel-Correctness and Parallel-Boundedness for Datalog Programs. | Frank Neven, Thomas Schwentick, Christopher Spinrath, Brecht Vandevoort |
| 2019 | Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. | Stefan Mengel, Sebastian Skritek |
| 2019 | An Experimental Study of the Treewidth of Real-World Graph Data. | Silviu Maniu, Pierre Senellart, Suraj Jog |
| 2019 | Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees. | Yuliang Li, Jianguo Wang, Benjamin S. Pullman, Nuno Bandeira, Yannis Papakonstantinou |
| 2019 | A Single Approach to Decide Chase Termination on Linear Existential Rules. | Michel Leclre, Marie-Laure Mugnier, Michal Thomazo, Federico Ulliana |
| 2019 | Approximating Distance Measures for the Skyline. | Nirman Kumar, Benjamin Raichel, Stavros Sintos, Gregory Van Buskirk |
| 2019 | The Power of the Terminating Chase (Invited Talk). | Markus Krtzsch, Maximilian Marx, Sebastian Rudolph |
| 2019 | Consistent Query Answering for Primary Keys in Logspace. | Paraschos Koutris, Jef Wijsen |
| 2019 | Boolean Tensor Decomposition for Conjunctive Queries with Negation. | Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, Dan Suciu |
| 2019 | Counting Triangles under Updates in Worst-Case Optimal Time. | Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang |