Abstract is missing.
- Synchronization SchemasRajeev Alur, Phillip Hilliard, Zachary G. Ives, Konstantinos Kallas, Konstantinos Mamouras, Filip Niksic, Caleb Stanford, Val Tannen, Anton Xue. 1-18 [doi]
- Modern Lower Bound Techniques in Database Theory and Constraint SatisfactionDániel Marx. 19-29 [doi]
- Approximation Algorithms for Large Scale Data AnalysisBarna Saha. 30-32 [doi]
- Privacy: From Database Reconstruction to Legal TheoremsKobbi Nissim. 33-41 [doi]
- Improved Differentially Private Euclidean Distance ApproximationNina Mesing Stausholm. 42-56 [doi]
- Datalog UnchainedVictor Vianu. 57-69 [doi]
- Expressiveness within Sequence DatalogHeba Aamer, Jan Hidders, Jan Paredaens, Jan Van den Bussche. 70-81 [doi]
- 2021 ACM PODS Alberto O. Mendelzon Test-of-Time AwardAngela Bonifati, Rasmus Pagh, Thomas Schwentick. 82 [doi]
- Frequent Elements with Witnesses in Data StreamsChristian Konrad. 83-95 [doi]
- Relative Error Streaming QuantilesGraham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý. 96-108 [doi]
- Stackless Processing of Streamed TreesCorentin Barloy, Filip Murlak, Charles Paperman. 109-125 [doi]
- Estimating the Size of Union of Sets in Streaming ModelsKuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty 0001. 126-137 [doi]
- Minimum Coresets for Maxima Representation of Multidimensional DataYanhao Wang, Michael Mathioudakis, Yuchen Li 0001, Kian-Lee Tan. 138-152 [doi]
- Spanner Evaluation over SLP-Compressed DocumentsMarkus L. Schmid, Nicole Schweikardt. 153-165 [doi]
- Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel JoinsMiao Qiao, Yufei Tao. 166-180 [doi]
- Cover or Pack: New Upper and Lower Bounds for Massively Parallel JoinsXiao Hu. 181-198 [doi]
- Algorithms for a Topology-aware Massively Parallel Computation ModelXiao Hu, Paraschos Koutris, Spyros Blanas. 199-214 [doi]
- Consistent Query Answering for Primary Keys on Path QueriesParaschos Koutris, Xiating Ouyang, Jef Wijsen. 215-232 [doi]
- Benchmarking Approximate Consistent Query AnsweringMarco Calautti, Marco Console, Andreas Pieris. 233-246 [doi]
- Structure and Complexity of Bag ConsistencyAlbert Atserias, Phokion G. Kolaitis. 247-259 [doi]
- New Algorithms for Monotone ClassificationYufei Tao, Yu Wang. 260-272 [doi]
- Subspace Exploration: Bounds on Projected Frequency EstimationGraham Cormode, Charlie Dickens, David P. Woodruff. 273-284 [doi]
- Data-Independent Space Partitionings for SummariesGraham Cormode, Minos N. Garofalakis, Michael Shekelyan. 285-298 [doi]
- 0 EstimationAduri Pavan, N. V. Vinodchandran, Arnab Bhattacharya, Kuldeep S. Meel. 299-311 [doi]
- A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive QueriesBatya Kenig, Dan Suciu. 312-324 [doi]
- Tractable Orders for Direct Access to Ranked Answers of Conjunctive QueriesNofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald. 325-341 [doi]
- Expressive Power of Linear Algebra Query LanguagesFloris Geerts, Thomas Muñoz, Cristian Riveros, Domagoj Vrgoc. 342-354 [doi]
- Tractability Beyond ß-Acyclicity for Conjunctive Queries with NegationMatthias Lanzinger. 355-369 [doi]
- Deciding Boundedness of Monadic SirupsStanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev. 370-387 [doi]
- Tuple-Independent Representations of Infinite Probabilistic DatabasesNofar Carmeli, Martin Grohe, Peter Lindner 0001, Christoph Standke. 388-401 [doi]
- Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked EnumerationChristoph Berkholz, Maximilian Merz. 402-415 [doi]
- Model-theoretic Characterizations of Rule-based OntologiesMarco Console, Phokion G. Kolaitis, Andreas Pieris. 416-428 [doi]