PODS 2021: Accepted Papers

Submitted by Nofar Carmeli on Thu, 03/11/2021 - 16:22

PODS 2021 accepted papers (from both submission cycles):

Albert Atserias and Phokion Kolaitis
Structure and Complexity of Bag Consistency

A. Pavan, N. V. Vinodchandran, Arnab Bhattacharya and Kuldeep S. Meel
Model Counting meets F0 Estimation

Batya Kenig and Dan Suciu
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries

Charles Paperman, Filip Murlak and Corentin Barloy
Stackless Processing of Streamed Trees

Christian Konrad
Frequent Elements with Witnesses in Data Streams

Christoph Berkholz and Maximilian Merz
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration

Floris Geerts, Thomas Muñoz, Cristian Riveros and Domagoj Vrgoc
Expressive Power of Linear Algebra Query Languages

Graham Cormode, Charlie Dickens and David P. Woodruff
Subspace Exploration: Bounds on Projected Frequency Estimation

Graham Cormode, Zohar Karnin, Edo Liberty, Justin Thaler and Pavel Vesely
Relative Error Streaming Quantiles

Heba Aamer, Jan Hidders, Jan Paredaens and Jan Van den Bussche
Expressiveness within Sequence Datalog

Marco Calautti, Marco Console and Andreas Pieris
Benchmarking Approximate Consistent Query Answering

Marco Console, Phokion Kolaitis and Andreas Pieris
Model-theoretic Characterizations of Rule-based Ontologies

Markus L. Schmid and Nicole Schweikardt
Spanner Evaluation over SLP-Compressed Documents

Matthias Lanzinger
Tractability Beyond β-Acyclicity for Conjunctive Queries with Negation

Miao Qiao and Yufei Tao
Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins

Michael Shekelyan, Graham Cormode and Minos Garofalakis
Data-Independent Space Partitionings for Summaries

Nina Mesing Stausholm
Improved Differentially Private Euclidean Distance Approximation

Nofar Carmeli, Martin Grohe, Peter Lindner and Christoph Standke
Tuple-Independent Representations of Infinite Probabilistic Databases

Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld and Mirek Riedewald
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries

Paraschos Koutris, Xiating Ouyang and Jef Wijsen
Consistent Query Answering for Primary Keys on Path Queries

Sourav Chakraborty, Kuldeep S. Meel and N.V. Vinodchandran
Estimating the Size of Unions of Sets in Streaming Models

Stanislav Kikot, Agi Kurucz, Vladimir Podolskii and Michael Zakharyaschev
Deciding Boundedness of Monadic Sirups

Xiao Hu
Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins

Xiao Hu, Paraschos Koutris and Spyros Blanas
Algorithms for a Topology-aware Massively Parallel Computation Model

Yanhao Wang, Michael Mathioudakis, Yuchen Li and Kian-Lee Tan
Minimum Coresets for Maxima Representation of Multidimensional Data

Yufei Tao and Yu Wang
New Algorithms for Monotone Classification