The 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS, will take place in Philadelphia, USA, from June 13th to June 15th, 2022. For more information visit https://2022.sigmod.org/

INVITED TALKS

Keynote 

• Frank Neven (Hasselt University): Robustness against read committed: a free transactional lunch. 

Tutorials

• Rediet Abebe (UC Berkeley  & Harvard Society of Fellows): Data as Inequality. 
• Wim Martens (Bayreuth University): Towards Theory for Real-Life Data.

ACCEPTED PAPERS

• Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral and Sebastian Rudolph. A Journey to the Frontiers of Query Rewritability. 
• Rajesh Jayaram, David P. Woodruff and Samson Zhou. Truly Perfect Samplers for Data Streams and Sliding Windows.
• Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu and Yisu Remy Wang. Convergence of Datalog over (Pre-) Semirings.
• Mahmoud Abo Khamis, George Chichirim, Antonia Kormpa and Dan Olteanu. The Complexity of Boolean Conjunctive Queries with Intersection Joins.
• Diego Figueira and Varun Ramanathan. Tractable Fragments of Extended CRPQs.
• Yilei Wang and Ke Yi. Query Evaluation by Circuits.
• Wei Dong and Ke Yi. A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries.
• Lijie Hu, Shuo Ni, Hanshen Xiao and Di Wang. High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data.
• Hendrik Fichtenberger and Pan Peng. Approximately Counting Subgraphs in Data Streams.
• Marco Calautti, Georg Gottlob and Andreas Pieris. Non-Uniformly Terminating Chase: Size and Complexity. 
• Marco Calautti, Ester Livshits, Andreas Pieris and Markus Schneider. Counting Database Repairs Entailing a Query: The Case of Functional Dependencies. 
• Kazuhiro Kurita, Yasuaki Kobayashi and Kunihiro Wasa. Linear-Delay Enumeration for Minimal Steiner Problems. 
• Wim Martens and Tina Popp. The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs. 
• Shangqi Lu, Wim Martens, Matthias Niewerth and Yufei Tao. Optimal Algorithms for Multiway Search on Partial Orders. 
• Steffen van Bergerem, Martin Grohe and Martin Ritzert. On the Parameterized Complexity of Learning First-Order Logic. 
• Jelani Nelson and Huacheng Yu. Optimal Bounds for Approximate Counting.
• Matthias Lanzinger. The Complexity of Conjunctive Queries with Degree 2. 
• Yi Li and Mingmou Liu. Lower Bounds for Sparse Oblivious Subspace Embeddings.
• Georg Gottlob, Matthias Lanzinger, Cem Okulmus and Reinhard Pichler. Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. 
• Jarosław Kwiecień, Jerzy Marcinkowski and Piotr Ostropolski-Nalewaja. Determinacy of Real Conjunctive Queries: The Boolean Case.
• Jacob Focke, Leslie Ann Goldberg, Marc Roth and Stanislav Živný. Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. 
• Flavio Chierichetti, Ravi Kumar and Silvio Lattanzi. The Gibbs--Rand Model.
• Carsten Lutz and Marcin Przybyłko. Enumerating Answers to Ontology-Mediated Queries.
• Sourav Chakraborty, Kuldeep S. Meel and N. V. Vinodchandran. Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size.
• Miika Hannula and Jef Wijsen. A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys. 
• Markus L. Schmid and Nicole Schweikardt. Query Evaluation over SLP-Represented Document Databases With Complex Document Editing. 
• Meghyn Bienvenu, Gianluca Cima and Víctor Gutiérrez-Basulto. LACE: A Logical Approach to Collective Entity Resolution.
• Olga Ohrimenko, Anthony Wirth and Hao Wu. Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data. 
• Diego Figueira, Artur Jez and Anthony Widjaja Lin. Data Path Queries over Embedded Graph Databases. 
• Antoine Amarilli, Louis Jachiet, Martín Muñoz and Cristian Riveros. Efficient Enumeration Algorithms for Annotated Grammars.
• Karl Bringmann, Nofar Carmeli and Stefan Mengel. Tight Fine-Grained Bounds for Direct Access on Join Queries. 
• Marco Calautti, Ester Livshits, Andreas Pieris and Markus Schneider. Uniform Operational Consistent Query Answering. 
• Miklos Ajtai, Vladimir Braverman, T.S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff and Samson Zhou. The White-Box Adversarial Data Stream Model. 

BEST PAPERS

• Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu and Yisu Remy Wang. Convergence of Datalog over (Pre-) Semirings.
• Jelani Nelson and Huacheng Yu. Optimal Bounds for Approximate Counting.

The informal Highlights conference on logic, games, and automata will happen from June 28th to July 1st, 2022, in Paris, France. The conference will be hosted by Université de Paris, and happen on the site of Grands Moulins.

Highlights aims at integrating the community working in the fields of logic, games, and automata. Papers from these areas are dispersed across many conferences, which makes them difficult to follow. A visit to the Highlights conference should offer a wide picture of the latest research in the field and a chance to meet everybody in the community, not just those who happen to publish in one particular proceedings volume.

We encourage you to attend and present your best work, be it already published or not, at the Highlights conference.

Conference page: https://highlights-conference.org/2022/

Highlights is an informal event which will take place on-site (barring unforeseen circumstances), and the preferred form of participation is to give your talk in-person. Highlights is mostly intended for a local community of participants who can attend with a limited carbon footprint (e.g., no plane travel). Before coming from further away, please review how your trip and international flights are contributing to climate change. If you do come, we encourage you to make the most of your stay in Paris, e.g., by also attending the ICALP'22 conference and/or using this opportunity for a research visit (see the Highlights website for details).

If you cannot attend, you can watch the talks remotely via a video stream, interact via text-based questions and answers, and you can also submit a proposal for a pre-recorded talk. If it is accepted, you will provide a video of your talk, which will be hosted online with other conference videos and be advertised on-site. The selection process will not discriminate between pre-recorded talks and in-person talks.

Important dates:

Submission: March 18
Notification: April 1st
Registration: TBA
Conference: June 28-July 1st, 2022.