Accepted Papers for PODS
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
