| 2023 | Quantifying the Loss of Acyclic Join Dependencies. | Batya Kenig, Nir Weinberger |
| 2023 | Node-Differentially Private Estimation of the Number of Connected Components. | Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis |
| 2023 | Towards Better Bounds for Finding Quasi-Identifiers. | Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta, Hoa T. Vu |
| 2023 | Differentially Private Data Release over Multiple Tables. | Badih Ghazi, Xiao Hu, Ravi Kumar, Pasin Manurangsi |
| 2023 | A Query Language Perspective on Graph Learning. | Floris Geerts |
| 2023 | GPC: A Pattern Calculus for Property Graphs. | Nadime Francis, Amlie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc |
| 2023 | Conjunctive Regular Path Queries under Injective Semantics. | Diego Figueira, Miguel Romero |
| 2023 | Universal Private Estimators. | Wei Dong, Ke Yi |
| 2023 | Optimal Uncoordinated Unique IDs. | Peter C. Dillinger, Martin Farach-Colton, Guido Tagliavini, Stefan Walzer |
| 2023 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms. | Shiyuan Deng, Shangqi Lu, Yufei Tao |
| 2023 | Applications of Sketching and Pathways to Impact. | Graham Cormode |
| 2023 | Querying Incomplete Numerical Data: Between Certain and Possibile Answers. | Marco Console, Leonid Libkin, Liat Peterfreund |
| 2023 | Sampling Big Ideas in Query Optimization. | Edith Cohen |
| 2023 | Extremal Fitting Problems for Conjunctive Queries. | Balder ten Cate, Victor Dalmau, Maurice Funk, Carsten Lutz |
| 2023 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis. | Nofar Carmeli, Luc Segoufin |
| 2023 | Corrigendum: Are Few Bins Enough: Testing Histogram Distributions. | Clment L. Canonne |
| 2023 | Probabilistic Query Evaluation: The Combined FPRAS Landscape. | Timothy van Bremen, Kuldeep S. Meel |
| 2023 | Static Analysis of Graph Database Transformations. | Iovka Boneva, Benot Groz, Jan Hidders, Filip Murlak, Slawek Staworko |
| 2023 | Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation. | Aline Bessa, Majid Daliri, Juliana Freire, Cameron Musco, Christopher Musco, Acio S. R. Santos, Haoxiang Zhang |
| 2023 | Synthesizing Nested Relational Queries from Implicit Specifications. | Michael Benedikt, Ccilia Pradic, Christoph Wernhard |
| 2023 | Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying. | Jean-Franois Baget, Marie-Laure Mugnier, Sebastian Rudolph |
| 2023 | Distributed Consistency Beyond Queries. | Tim Baccaert, Bas Ketsman |
| 2023 | Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. | Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl |
| 2023 | The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2023. | Marcelo Arenas, Wenfei Fan, Frank Neven |
| 2023 | Generative Datalog with Stable Negation. | Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris |