| 2022 | 2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award. Michael Bender, Michael Benedikt, Sudeepa Roy |
| 2022 | A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys. Miika Hannula, Jef Wijsen |
| 2022 | A Journey to the Frontiers of Query Rewritability. Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph |
| 2022 | A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries. Wei Dong, Ke Yi |
| 2022 | Algorithmic Techniques for Independent Query Sampling. Yufei Tao |
| 2022 | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný |
| 2022 | Approximately Counting Subgraphs in Data Streams. Hendrik Fichtenberger, Pan Peng |
| 2022 | Convergence of Datalog over (Pre-) Semirings. Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang |
| 2022 | Counting Database Repairs Entailing a Query: The Case of Functional Dependencies. Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider |
| 2022 | Data Path Queries over Embedded Graph Databases. Diego Figueira, Artur Jez, Anthony W. Lin |
| 2022 | Determinacy of Real Conjunctive Queries. The Boolean Case. Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja |
| 2022 | Document Spanners - A Brief Overview of Concepts, Results, and Recent Developments. Markus L. Schmid, Nicole Schweikardt |
| 2022 | Efficient Enumeration for Annotated Grammars. Antoine Amarilli, Louis Jachiet, Martin Muñoz, Cristian Riveros |
| 2022 | Efficiently Enumerating Answers to Ontology-Mediated Queries. Carsten Lutz, Marcin Przybylko |
| 2022 | Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. Kuldeep S. Meel, Sourav Chakraborty, N. V. Vinodchandran |
| 2022 | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
| 2022 | High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data. Lijie Hu, Shuo Ni, Hanshen Xiao, Di Wang |
| 2022 | LACE: A Logical Approach to Collective Entity Resolution. Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto |
| 2022 | Linear-Delay Enumeration for Minimal Steiner Problems. Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2022 | Lower Bounds for Sparse Oblivious Subspace Embeddings. Yi Li, Mingmou Liu |
| 2022 | Non-Uniformly Terminating Chase: Size and Complexity. Marco Calautti, Georg Gottlob, Andreas Pieris |
| 2022 | On the Parameterized Complexity of Learning First-Order Logic. Steffen van Bergerem, Martin Grohe, Martin Ritzert |
| 2022 | Optimal Algorithms for Multiway Search on Partial Orders. Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao |
| 2022 | Optimal Bounds for Approximate Counting. Jelani Nelson, Huacheng Yu |
| 2022 | PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022 Leonid Libkin, Pablo Barceló |
| 2022 | Query Evaluation by Circuits. Yilei Wang, Ke Yi |
| 2022 | Query Evaluation over SLP-Represented Document Databases with Complex Document Editing. Markus L. Schmid, Nicole Schweikardt |
| 2022 | Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data. Olga Ohrimenko, Anthony Wirth, Hao Wu |
| 2022 | Robustness Against Read Committed: A Free Transactional Lunch. Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven |
| 2022 | The Complexity of Boolean Conjunctive Queries with Intersection Joins. Mahmoud Abo Khamis, George Chichirim, Antonia Kormpa, Dan Olteanu |
| 2022 | The Complexity of Conjunctive Queries with Degree 2. Matthias Lanzinger |
| 2022 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs. Wim Martens, Tina Popp |
| 2022 | The Gibbs-Rand Model. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi |
| 2022 | The White-Box Adversarial Data Stream Model. Miklós Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, Samson Zhou |
| 2022 | Tight Fine-Grained Bounds for Direct Access on Join Queries. Karl Bringmann, Nofar Carmeli, Stefan Mengel |
| 2022 | Towards Theory for Real-World Data. Wim Martens |
| 2022 | Truly Perfect Samplers for Data Streams and Sliding Windows. Rajesh Jayaram, David P. Woodruff, Samson Zhou |
| 2022 | Uniform Operational Consistent Query Answering. Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider |
| 2022 | When is the Evaluation of Extended CRPQ Tractable? Diego Figueira, Varun Ramanathan |