Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40th PODS 2021: Virtual Event, China
- Leonid Libkin, Reinhard Pichler, Paolo Guagliardo:
PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Virtual Event, China, June 20-25, 2021. ACM 2021, ISBN 978-1-4503-8381-3
Keynote
- Rajeev Alur, Phillip Hilliard, Zachary G. Ives, Konstantinos Kallas, Konstantinos Mamouras, Filip Niksic, Caleb Stanford
, Val Tannen, Anton Xue:
Synchronization Schemas. 1-18
Invited Tutorials
- Dániel Marx:
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. 19-29 - Barna Saha:
Approximation Algorithms for Large Scale Data Analysis. 30-32
Session: Gems of PODS Talk 1 and Privacy
- Kobbi Nissim:
Privacy: From Database Reconstruction to Legal Theorems. 33-41 - Nina Mesing Stausholm:
Improved Differentially Private Euclidean Distance Approximation. 42-56
Session: Gems of PODS Talk 2 and Datalog
- Victor Vianu:
Datalog Unchained. 57-69 - Heba Aamer, Jan Hidders, Jan Paredaens, Jan Van den Bussche:
Expressiveness within Sequence Datalog. 70-81
Session: Test-Of-Time Award and Data Streams
- Angela Bonifati, Rasmus Pagh, Thomas Schwentick:
2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award. 82 - Christian Konrad:
Frequent Elements with Witnesses in Data Streams. 83-95
Session: Best Paper Award and Data Streams
- Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý:
Relative Error Streaming Quantiles. 96-108 - Corentin Barloy, Filip Murlak, Charles Paperman:
Stackless Processing of Streamed Trees. 109-125 - Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty:
Estimating the Size of Union of Sets in Streaming Models. 126-137
Session: Compressed Data
- Yanhao Wang, Michael Mathioudakis, Yuchen Li, Kian-Lee Tan:
Minimum Coresets for Maxima Representation of Multidimensional Data. 138-152 - Markus L. Schmid, Nicole Schweikardt:
Spanner Evaluation over SLP-Compressed Documents. 153-165
Session: Distributed Data Processing
- Miao Qiao, Yufei Tao:
Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins. 166-180 - Xiao Hu:
Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins. 181-198 - Xiao Hu, Paraschos Koutris, Spyros Blanas:
Algorithms for a Topology-aware Massively Parallel Computation Model. 199-214
Session: Consistency
- Paraschos Koutris, Xiating Ouyang, Jef Wijsen:
Consistent Query Answering for Primary Keys on Path Queries. 215-232 - Marco Calautti, Marco Console, Andreas Pieris:
Benchmarking Approximate Consistent Query Answering. 233-246 - Albert Atserias, Phokion G. Kolaitis:
Structure and Complexity of Bag Consistency. 247-259
Session: Multidimensional Data
- Yufei Tao, Yu Wang:
New Algorithms for Monotone Classification. 260-272 - Graham Cormode, Charlie Dickens, David P. Woodruff:
Subspace Exploration: Bounds on Projected Frequency Estimation. 273-284 - Graham Cormode, Minos N. Garofalakis, Michael Shekelyan:
Data-Independent Space Partitionings for Summaries. 285-298
Session: Counting and Enumeration
- Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting meets F0 Estimation. 299-311 - Batya Kenig, Dan Suciu:
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. 312-324 - Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald:
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries. 325-341
Session: Query Languages
- Floris Geerts, Thomas Muñoz, Cristian Riveros, Domagoj Vrgoc:
Expressive Power of Linear Algebra Query Languages. 342-354 - Matthias Lanzinger:
Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation. 355-369 - Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev:
Deciding Boundedness of Monadic Sirups. 370-387
Session: Incomplete and Probabilistic Data
- Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. 388-401 - Christoph Berkholz, Maximilian Merz:
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration. 402-415 - Marco Console, Phokion G. Kolaitis, Andreas Pieris:
Model-theoretic Characterizations of Rule-based Ontologies. 416-428
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-21 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
