Conference Program: PODS Sessions
PODS Special Event
PODS Special Event: Unlocking the Secrets: Bridging Theory and Practice
Sunday June 9 4:00 pm – 6:00 pm
Location: Aconcagua
Moderator: Floris Geerts (University of Antwerp) and Dan Olteanu (University of Zurich)
Webpage
Session 1: PODS Keynote
A Data Management Approach to Explainable AI
Marcelo Arenas, Universidad Católica de Chile
Monday June 10 8:15 am – 9:30 am
Location: Floor -2
Session Chair: Wim Martens
Session 2: Tutorial, Joins, and Query Processing
Monday June 10 10:00 am – 12:00 am (with 5 min break after Tutorial)
Location: Parinacota/Tupungato
Session Chair: Wim Martens
- Tutorial 1: Closing the gap between theory and practice in query optimization
Thomas Neumann, Technical University of Munich - Topology-aware Parallel Joins
Xiao Hu and Paraschos Koutris - Join Size Bounds using Lp Norms on Degree Sequences
Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu and Dan Suciu - Fast Matrix Multiplication for Query Processing
Xiao Hu
Session 3: Test-of-Time, Query Languages, Graphs
Monday June 10 1:30 pm – 3:30 pm (with 5 min break in the middle)
Location: Parinacota/Tupungato
Session Chair: Frank Neven
- Test of Time: Composable Core-sets for Diversity and Coverage Maximization
Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian and Vahab S. Mirrokni - Best Newcomer: TypeQL: A Type-Theoretic & Polymorphic Query Language
Christoph Dorn and Haikal Pribadi - Distinct Shortest Walk Enumeration for RPQs
Claire David, Nadime Francis and Victor Marsault - On Density-based Local Community Search
Miao Qiao, Yizhou Dai and Ronghua Li - On Reporting Durable Patterns in Temporal Proximity Graphs
Pankaj Agarwal, Xiao Hu, Stavros Sintos and Jun Yang - Containment of Graph Queries Modulo Schema
Victor Gutierrez-Basulto, Albert Gutowski, Yazmin A. Ibanez-Garcia and Filip Murlak
Session 4: Gems of PODS, Views, Query Processing, Data Structures
Monday June 10 4:00 pm – 6:00 pm (with 5 min break in the middle)
Location: Parinacota/Tupungato
Session Chair: Sudeepa Roy
- Gems of PODS: Recent Increments in Incremental View Maintenance
Dan Olteanu, University of Zurich - Best Paper: History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
Michael A. Bender, Martin Farach-Colton, Michael T. Goodrich and Hanna Komlos - When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control
Brecht Vandevoort, Bas Ketsman and Frank Neven - The Moments Method for Approximate Data Cube Queries
Peter Lindner, Dan Suciu, Christoph Koch and Sachin Basil John - Query Optimization by Quantifier Elimination
Christoph Koch and Peter Lindner
PODS Business Meeting
Monday June 10 6:00 pm – 7:00 pm
Location: Europa
Session 5: Tutorial, Streams
Tuesday June 11 1:00 pm – 2:30 pm
Location: Antartica
Session Chair: Rajesh Jayaram
- Tutorial 2: Approximation Algorithms on Matrices - with some Database Applications
David Woodruff, Carnegie Mellon University - On the Feasibility of Forgetting in Data Streams
Sourav Chakraborty, Kuldeep Meel, A Pavan and N. V. Vinodchandran
Session 6: Bags and Counting
Tuesday June 11 3:00 pm – 4:30 pm
Location: Antartica
Session Chair: Filip Murlak
- Best Paper Award: Consistency of Relations over Monoids
Albert Atserias and Phokion Kolaitis - Bag Semantics Conjunctive Query Containment. Four Small Steps Towards Undecidability
Jerzy Marcinkowski and Mateusz Orda - Tight Bounds of Circuits for Sum-Product Queries
Austen Z. Fan, Paraschos Koutris and Hangdong Zhao - A faster FPRAS for #NFA
Sourav Chakraborty, Umang Mathur and Kuldeep Meel - Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity (canceled)
Jacob Focke, Leslie Ann Goldberg, Marc Roth and Stanislav Zivny
Session 7: Shapley and Consistency
Tuesday June 11 5:00 pm – 6:30 pm
Location: Antartica
Session Chair: Xiao Hu
- When is Shapley Value Computation a Matter of Counting?
Meghyn Bienvenu, Diego Figueira and Pierre Lafourcade - Expected Shapley-Like Scores of Boolean functions: Complexity and Applications to Probabilistic Databases
Pratik Karmakar, Mikaël Monet, Pierre Senellart and Stephane Bressan - From Shapley Value to Model Counting and Back
Ahmet Kara, Dan Olteanu and Dan Suciu - Consistent Query Answering for Primary Keys on Rooted Tree Queries
Paraschos Koutris, Xiating Ouyang and Jef Wijsen - Combined Approximations for Uniform Operational Consistent Query Answering
Marco Calautti, Ester Livshits, Andreas Pieris and Markus Schneider
Session 8: Enumeration and Counting
Wednesday June 12 1:00 pm – 2:30 pm
Location: Antartica
Session Chair: Andreas Pieris
- Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization
Hangdong Zhao, Austen Z. Fan, Xiating Ouyang and Paraschos Koutris - The Weisfeiler-Leman Dimension of Existential Conjunctive Queries
Andreas Göbel, Leslie Ann Goldberg and Marc Roth - Enumeration for MSO-Queries on Compressed Trees
Markus Lohrey and Markus L. Schmid - Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC
Sam M. Thompson and Dominik D. Freydenberger - Chase Termination Beyond Polynomial Time
Philipp Hanisch and Markus Krötzsch
Session 9: Data Structures, Streams, Privacy
Wednesday June 12 3:00 pm – 4:30 pm
Location: Antartica
Session Chair: Vinodchandran Variyam
- Layered List Labeling
Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlos and William Kuszmaul - Streaming Algorithms with Few State Changes
Rajesh Jayaram, David P. Woodruff and Samson Zhou - Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
Yu Cheng, Max Li, Honghao Lin, Zi-Yi Tai, David Woodruff and Jason Zhang - Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald
Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu and Huacheng Yu - Continual Release of Differentially Private Synthetic Data from Longitudinal Data Collections (canceled)
Mark Bun, Marco Gaboardi, Marcel Neunhoeffer and Wanrong Zhang
Session 10: Datalog and Provenance
Wednesday June 12 5:00 pm – 6:30 pm
Location: Antartica
Session Chair: Dan Suciu
- Evaluating Datalog over Semirings: A Grounding-based Approach
Hangdong Zhao, Shaleen Deep, Paraschos Koutris, Sudeepa Roy and Val Tannen - Verification of Unary Communicating Datalog Programs
C. Aiswarya, Diego Calvanese, Francesco Di Cosmo and Marco Montali - The Complexity of Why-Provenance for Datalog Queries
Marco Calautti, Ester Livshits, Andreas Pieris and Markus Schneider - Provenance postulates: Instance-based provenance for first-order logic
Bart Bogaerts, Maxime Jakubowski and Jan Van den Bussche - Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries
Neha Makhija and Wolfgang Gatterbauer
