PODS A*

33 papers

YearTitle / Authors
20212021 ACM PODS Alberto O. Mendelzon Test-of-Time Award.
Angela Bonifati, Rasmus Pagh, Thomas Schwentick
2021A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries.
Batya Kenig, Dan Suciu
2021Algorithms for a Topology-aware Massively Parallel Computation Model.
Xiao Hu, Paraschos Koutris, Spyros Blanas
2021Approximation Algorithms for Large Scale Data Analysis.
Barna Saha
2021Benchmarking Approximate Consistent Query Answering.
Marco Calautti, Marco Console, Andreas Pieris
2021Consistent Query Answering for Primary Keys on Path Queries.
Paraschos Koutris, Xiating Ouyang, Jef Wijsen
2021Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins.
Xiao Hu
2021Data-Independent Space Partitionings for Summaries.
Graham Cormode, Minos N. Garofalakis, Michael Shekelyan
2021Datalog Unchained.
Victor Vianu
2021Deciding Boundedness of Monadic Sirups.
Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev
2021Estimating the Size of Union of Sets in Streaming Models.
Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty
2021Expressive Power of Linear Algebra Query Languages.
Floris Geerts, Thomas Muñoz, Cristian Riveros, Domagoj Vrgoc
2021Expressiveness within Sequence Datalog.
Heba Aamer, Jan Hidders, Jan Paredaens, Jan Van den Bussche
2021Frequent Elements with Witnesses in Data Streams.
Christian Konrad
2021Improved Differentially Private Euclidean Distance Approximation.
Nina Mesing Stausholm
2021Minimum Coresets for Maxima Representation of Multidimensional Data.
Yanhao Wang, Michael Mathioudakis, Yuchen Li, Kian-Lee Tan
2021Model Counting meets F
Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2021Model-theoretic Characterizations of Rule-based Ontologies.
Marco Console, Phokion G. Kolaitis, Andreas Pieris
2021Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction.
Dániel Marx
2021New Algorithms for Monotone Classification.
Yufei Tao, Yu Wang
2021PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Virtual Event, China, June 20-25, 2021.
Leonid Libkin, Reinhard Pichler, Paolo Guagliardo
2021Privacy: From Database Reconstruction to Legal Theorems.
Kobbi Nissim
2021Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration.
Christoph Berkholz, Maximilian Merz
2021Relative Error Streaming Quantiles.
Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý
2021Spanner Evaluation over SLP-Compressed Documents.
Markus L. Schmid, Nicole Schweikardt
2021Stackless Processing of Streamed Trees.
Corentin Barloy, Filip Murlak, Charles Paperman
2021Structure and Complexity of Bag Consistency.
Albert Atserias, Phokion G. Kolaitis
2021Subspace Exploration: Bounds on Projected Frequency Estimation.
Graham Cormode, Charlie Dickens, David P. Woodruff
2021Synchronization Schemas.
Rajeev Alur, Phillip Hilliard, Zachary G. Ives, Konstantinos Kallas, Konstantinos Mamouras, Filip Niksic, Caleb Stanford, Val Tannen, Anton Xue
2021Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation.
Matthias Lanzinger
2021Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries.
Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald
2021Tuple-Independent Representations of Infinite Probabilistic Databases.
Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke
2021Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins.
Miao Qiao, Yufei Tao