Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID41st PODS 2022: Philadelphia, PA, USA
- Leonid Libkin, Pablo Barceló:
PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022. ACM 2022, ISBN 978-1-4503-9260-0
Session 1: PODS Opening, Keynote Talk, and Streaming
- Brecht Vandevoort
, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness Against Read Committed: A Free Transactional Lunch. 1-14 - Miklós Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, Samson Zhou:
The White-Box Adversarial Data Stream Model. 15-27 - Rajesh Jayaram, David P. Woodruff, Samson Zhou:
Truly Perfect Samplers for Data Streams and Sliding Windows. 29-40 - Kuldeep S. Meel, Sourav Chakraborty, N. V. Vinodchandran:
Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. 41-52
Session 2: Query Evaluation
- Mahmoud Abo Khamis, George Chichirim, Antonia Kormpa, Dan Olteanu:
The Complexity of Boolean Conjunctive Queries with Intersection Joins. 53-65 - Yilei Wang, Ke Yi:
Query Evaluation by Circuits. 67-78 - Markus L. Schmid, Nicole Schweikardt:
Query Evaluation over SLP-Represented Document Databases with Complex Document Editing. 79-89 - Matthias Lanzinger:
The Complexity of Conjunctive Queries with Degree 2. 91-102
Session 3: PODS Awards
- Michael Bender, Michael Benedikt, Sudeepa Roy:
2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award. 103-104 - Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang:
Convergence of Datalog over (Pre-) Semirings. 105-117 - Jelani Nelson, Huacheng Yu:
Optimal Bounds for Approximate Counting. 119-127
Session 4: Invited Tutorial, Gems of PODS, and Sampling
- Yufei Tao:
Algorithmic Techniques for Independent Query Sampling. 129-138 - Markus L. Schmid, Nicole Schweikardt:
Document Spanners - A Brief Overview of Concepts, Results, and Recent Developments. 139-150 - Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi:
The Gibbs-Rand Model. 151-163
Session 5: Graph Data
- Wim Martens, Tina Popp:
The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs. 165-174 - Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao:
Optimal Algorithms for Multiway Search on Partial Orders. 175-187 - Diego Figueira, Artur Jez, Anthony W. Lin:
Data Path Queries over Embedded Graph Databases. 189-201 - Diego Figueira, Varun Ramanathan:
When is the Evaluation of Extended CRPQ Tractable? 203-212
Session 6: Privacy and Embeddings
- Wei Dong, Ke Yi:
A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries. 213-225 - Lijie Hu, Shuo Ni, Hanshen Xiao, Di Wang:
High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data. 227-236 - Olga Ohrimenko, Anthony Wirth, Hao Wu:
Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data. 237-249 - Yi Li, Mingmou Liu:
Lower Bounds for Sparse Oblivious Subspace Embeddings. 251-260
Session 7: Invited Tutorial, Enumeration and Counting
- Wim Martens:
Towards Theory for Real-World Data. 261-276 - Carsten Lutz, Marcin Przybylko:
Efficiently Enumerating Answers to Ontology-Mediated Queries. 277-289 - Antoine Amarilli, Louis Jachiet, Martin Muñoz, Cristian Riveros:
Efficient Enumeration for Annotated Grammars. 291-300 - Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Linear-Delay Enumeration for Minimal Steiner Problems. 301-313 - Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. 315-324
Session 8: Query Processing
- Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler:
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. 325-336 - Steffen van Bergerem, Martin Grohe, Martin Ritzert:
On the Parameterized Complexity of Learning First-Order Logic. 337-346 - Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Determinacy of Real Conjunctive Queries. The Boolean Case. 347-358 - Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph:
A Journey to the Frontiers of Query Rewritability. 359-367
Session 9: Uncertainty and Incompleteness
- Marco Calautti, Georg Gottlob, Andreas Pieris:
Non-Uniformly Terminating Chase: Size and Complexity. 369-378 - Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto:
LACE: A Logical Approach to Collective Entity Resolution. 379-391 - Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
Uniform Operational Consistent Query Answering. 393-402
Session 10: Counting and Dichotomies
- Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
Counting Database Repairs Entailing a Query: The Case of Functional Dependencies. 403-412 - Hendrik Fichtenberger, Pan Peng:
Approximately Counting Subgraphs in Data Streams. 413-425 - Karl Bringmann, Nofar Carmeli, Stefan Mengel:
Tight Fine-Grained Bounds for Direct Access on Join Queries. 427-436 - Miika Hannula, Jef Wijsen:
A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys. 437-449
a service of 
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 2024-06-10 21:37 CEST 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:
