default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd PODS 2023: Seattle, WA, USA
- Floris Geerts
, Hung Q. Ngo, Stavros Sintos:
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2023, Seattle, WA, USA, June 18-23, 2023. ACM 2023
PODS Keynote
- Jure Leskovec:
Databases as Graphs: Predictive Queries for Declarative Machine Learning. 1
Session 1: Test of Time Awards and Gems of PODS
- Marcelo Arenas, Wenfei Fan, Frank Neven:
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2023. 3-4 - Graham Cormode:
Applications of Sketching and Pathways to Impact. 5-10
Session 2: Query Languages & Transaction Processing
- Leonid Libkin, Liat Peterfreund:
SQL Nulls and Two-Valued Logic. 11-20 - Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris:
Generative Datalog with Stable Negation. 21-32 - Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing Nested Relational Queries from Implicit Specifications. 33-45 - Tim Baccaert, Bas Ketsman:
Distributed Consistency Beyond Queries. 47-58
Session 3: Awards (Best Paper and Distinguished Papers)
- Hangdong Zhao, Shaleen Deep, Paraschos Koutris:
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. 59-68 - Brecht Vandevoort, Bas Ketsman, Frank Neven:
Allocating Isolation Levels to Transactions in a Multiversion Setting. 69-78 - Christian Janos Lebeda, Jakub Tetek:
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. 79-88 - Balder ten Cate, Victor Dalmau, Maurice Funk, Carsten Lutz:
Extremal Fitting Problems for Conjunctive Queries. 89-98
Session 4: Consistent Query Answering, Certain Answers and Repairs
- Shiyuan Deng, Shangqi Lu, Yufei Tao:
On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms. 99-111 - Kyoungmin Kim, Jaehyun Ha, George Fletcher, Wook-Shin Han:
Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins. 113-125 - Sanjeev Khanna, Christian Konrad, Cezar-Mihail Alexandru:
Set Cover in the One-pass Edge-arrival Streaming Model. 127-139 - Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl:
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. 141-153 - Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta, Hoa T. Vu:
Towards Better Bounds for Finding Quasi-Identifiers. 155-167 - Aline Bessa, Majid Daliri, Juliana Freire, Cameron Musco, Christopher Musco, Aécio S. R. Santos, Haoxiang Zhang:
Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation. 169-181
Session 5: Differential privacy & distributed processing
- Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis:
Node-Differentially Private Estimation of the Number of Connected Components. 183-194 - Wei Dong, Ke Yi:
Universal Private Estimators. 195-206 - Badih Ghazi, Xiao Hu, Ravi Kumar, Pasin Manurangsi:
Differentially Private Data Release over Multiple Tables. 207-219 - Peter C. Dillinger, Martin Farach-Colton, Guido Tagliavini, Stefan Walzer:
Optimal Uncoordinated Unique IDs. 221-230
Session 6: Queries and Graphs
- Diego Figueira, Miguel Romero:
Conjunctive Regular Path Queries under Injective Semantics. 231-240 - Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc:
GPC: A Pattern Calculus for Property Graphs. 241-250 - Iovka Boneva, Benoît Groz, Jan Hidders, Filip Murlak, Slawek Staworko:
Static Analysis of Graph Database Transformations. 251-261
Session 7: Query Processing
- Shangqi Lu, Yufei Tao:
Indexing for Keyword Search with Structured Constraints. 263-275 - Nofar Carmeli, Luc Segoufin:
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis. 277-289 - Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph:
Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying. 291-302 - Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald:
Efficient Computation of Quantiles over Joins. 303-315
Session 8: Uncertainty
- Dingyu Wang, Seth Pettie:
Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond. 317-327 - Batya Kenig, Nir Weinberger:
Quantifying the Loss of Acyclic Join Dependencies. 329-338 - Timothy van Bremen, Kuldeep S. Meel:
Probabilistic Query Evaluation: The Combined FPRAS Landscape. 339-347 - Marco Console, Leonid Libkin, Liat Peterfreund:
Querying Incomplete Numerical Data: Between Certain and Possibile Answers. 349-358
Corrigendum
- Clément L. Canonne:
Corrigendum: Are Few Bins Enough: Testing Histogram Distributions. 359
Invited Tutorial 1
- Edith Cohen:
Sampling Big Ideas in Query Optimization. 361-371
Invited Tutorial 2
- Floris Geerts:
A Query Language Perspective on Graph Learning. 373-379
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 2025-03-25 00:14 CET 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:
