Accepted Papers for PODS
Note: from the conference start date, the papers can be freely accessed via the following ACM OpenTOCs:
Proceedings of the ACM on Management of Data, Volume 3, Issue 2
Round 2
- Smallest Synthetic Witnesses for Conjunctive Queries
Aryan Esmailpour, Boris Glavic, Xiao Hu and Stavros Sintos - Circuits and Formulas for Datalog over Semirings
Austen Z. Fan, Paraschos Koutris and Sudeepa Roy - Perfect Sampling in Turnstile Streams Beyond Small Moments
David P. Woodruff, Shenghao Xie and Samson Zhou - Explaining k-Nearest Neighbors: Counterfactual and Abductive Explanations
Pablo Barcelo, Alexander Kozachinskiy, Miguel Romero, Bernardo Subsercaseaux and Jose Verschae - An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
Sepehr Assadi and Vihan Shah - Shapley Revisited: Tractable Responsibility Measures for Query Answers
Meghyn Bienvenu, Diego Figueira and Pierre Lafourcade - The Complexity of Maximal Common Subsequence Enumeration
Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita and Giulia Punzi - Minimizing Conjunctive Regular Path Queries
Diego Figueira, Rémi Morvan and Miguel Romero - Towards Update-Dependent Analysis of Query Maintenance
Xiao Hu and Qichen Wang - No Cliques Allowed: The Next Step Towards BDD/FC Conjecture
Lucas Larroque, Piotr Ostropolski-Nalewaja and Michaël Thomazo - On the adversarial robustness of Locality-Sensitive Hashing in Hamming Space
Mikhail Makarov, Michael Kapralov and Christian Sohler - Robust Statistical Analysis on Streaming Data with Near-Duplicates in General Metric Spaces
Qin Zhang - Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy
Sofya Raskhodnikova and Teresa Anna Steiner - Circuit bounds for Conjunctive Queries with Self-Joins
Austen Z. Fan, Paraschos Koutris and Hangdong Zhao - A Quantum-Leap into Schema Matching: Beyond 1-to-1 Matchings
Luisa Gerlach, Tobias Köppl, Stefanie Scherzinger, Nicole Schweikardt and René Zander - Restricted Chase Termination: You Want More than Fairness
David Carral, Lukas Gerlach, Lucas Larroque and Michaël Thomazo - Output-Optimal Algorithms for Join-Aggregate Queries
Xiao Hu - Private Synthetic Data Generation in Small Memory
Rayne Holland, Jason Xue, Chandra Thapa and Seyit Camtepe - Rewriting Consistent Answers on Annotated Data
Phokion Kolaitis, Nina Pardal, Jonni Virtema and Jef Wijsen - Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
Sungjin Im, Benjamin Moseley, Hung Ngo and Kirk Pruhs - Differentially Private Substring and Document Counting
Giulia Bernardini, Philip Bille, Inge Li Gørtz and Teresa Anna Steiner - Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
Alexis de Colnet and Kuldeep S. Meel - A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
Stefan Mengel and Harry Vinall-Smeeth - Soft and Constrained Hypertree Width
Matthias Lanzinger, Cem Okulmus, Reinhard Pichler, Alexander Selzer and Georg Gottlob - Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Rasmus Pagh, Lukas Retschmeier, Hao Wu and Hanwen Zhang - Complex event recognition under time constraints: towards a formal framework for efficient query evaluation
Julián García and Cristian Riveros - Fast Matrix Multiplication meets the Subdmodular Width
Mahmoud Abo Khamis, Xiao Hu and Dan Suciu - Output-Sensitive Evaluation of Regular Path Queries
Mahmoud Abo Khamis, Ahmet Kara, Dan Olteanu and Dan Suciu - Resilience for Regular Path Queries: Towards a Complexity Classification
Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija and Mikaël Monet - A Theoretical Framework for Distribution-Aware Dataset Search
Aryan Esmailpour, Sainyam Galhotra, Rahul Raychaudhury and Stavros Sintos
Round 1
- Optimal (Multiway) Spatial Joins
Ru Wang and Yufei Tao - Optimal Dynamic Parameterized Subset Sampling
Junhao Gan, Seeun William Umboh, Hanzhi Wang, Anthony Wirth and Zhuo Zhang - Differentially Private Hierarchical Heavy Hitters
Ari Biswas, Graham Cormode, Yaron Kanza, Divesh Srivastava and Zhengyi Zhou - Insert-Only versus Insert-Delete in Dynamic Query Evaluation
Mahmoud Abo Khamis, Ahmet Kara, Dan Olteanu and Dan Suciu - Polynomial Time Convergence of the Iterative Evaluation of Datalog Programs
Sungjin Im, Benjamin Moseley, Hung Ngo and Kirk Pruhs - Output-sensitive Conjunctive Query Evaluation
Shaleen Deep, Hangdong Zhao, Austen Fan and Paraschos Koutris - Parallel Communication Obliviousness: One Round and Beyond
Yufei Tao, Ru Wang and Shiyuan Deng - Below and Above Why-Provenance for Datalog Queries
Marco Calautti, Ester Livshits, Andreas Pieris and Markus Schneider - Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
Marcelo Arenas, Timo Merkl, Reinhard Pichler and Cristian Riveros - Computing Range Consistent Answers to Aggregation Queries via Rewriting
Aziz Amezian El Khalfioui and Jef Wijsen - Efficient Algorithms for k-Clustering with Noisy and Exact Oracles
Sainyam Galhotra, Rahul Raychaudhury and Stavros Sintos - Computing A Well-Representative Summary of Conjunctive Query Results
Pankaj Agarwal, Aryan Esmailpour, Xiao Hu, Stavros Sintos and Jun Yang - Improved Approximation Algorithms for Relational Clustering
Aryan Esmailpour and Stavros Sintos - Complex event recognition meets hierarchical conjunctive queries
Dante Pinto and Cristian Riveros - Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
Pawel Gawrychowski, Florin Manea and Markus L. Schmid
