PODS 2021: Accepted Papers
- Structure and Complexity of Bag ConsistencyAlbert Atserias and Phokion Kolaitis
- Model Counting meets F0 EstimationA. Pavan, N. V. Vinodchandran, Arnab Bhattacharya and Kuldeep S. Meel
- A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive QueriesBatya Kenig and Dan Suciu
- Stackless Processing of Streamed TreesCharles Paperman, Filip Murlak and Corentin Barloy
- Frequent Elements with Witnesses in Data StreamsChristian Konrad
- Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration Christoph Berkholz and Maximilian Merz
- Expressive Power of Linear Algebra Query Languages Floris Geerts, Thomas Muñoz, Cristian Riveros and Domagoj Vrgoc
- Subspace Exploration: Bounds on Projected Frequency Estimation Graham Cormode, Charlie Dickens and David P. Woodruff
- Relative Error Streaming QuantilesGraham Cormode, Zohar Karnin, Edo Liberty, Justin Thaler and Pavel Vesely
- Expressiveness within Sequence DatalogHeba Aamer, Jan Hidders, Jan Paredaens and Jan Van den Bussche
- Benchmarking Approximate Consistent Query Answering Marco Calautti, Marco Console and Andreas Pieris
- Model-theoretic Characterizations of Rule-based Ontologies Marco Console, Phokion Kolaitis and Andreas Pieris
- Spanner Evaluation over SLP-Compressed Documents Markus L. Schmid and Nicole Schweikardt
- Tractability Beyond β-Acyclicity for Conjunctive Queries with Negation Matthias Lanzinger
- Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins Miao Qiao and Yufei Tao
- Data-Independent Space Partitionings for Summaries Michael Shekelyan, Graham Cormode and Minos Garofalakis
- Improved Differentially Private Euclidean Distance ApproximationNina Mesing Stausholm
- Tuple-Independent Representations of Infinite Probabilistic DatabasesNofar Carmeli, Martin Grohe, Peter Lindner and Christoph Standke
- Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld and Mirek Riedewald
- Consistent Query Answering for Primary Keys on Path QueriesParaschos Koutris, Xiating Ouyang and Jef Wijsen
- Estimating the Size of Unions of Sets in Streaming Models Sourav Chakraborty, Kuldeep S. Meel and N.V. Vinodchandran
- Deciding Boundedness of Monadic Sirups Stanislav Kikot, Agi Kurucz, Vladimir Podolskii and Michael Zakharyaschev
- Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins Xiao Hu
- Algorithms for a Topology-aware Massively Parallel Computation Model Xiao Hu, Paraschos Koutris and Spyros Blanas
- Minimum Coresets for Maxima Representation of Multidimensional DataYanhao Wang, Michael Mathioudakis, Yuchen Li and Kian-Lee Tan
- New Algorithms for Monotone ClassificationYufei Tao and Yu Wang
