Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID39th PODS 2020: Portland, OR, USA
- Dan Suciu, Yufei Tao, Zhewei Wei:
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2020, Portland, OR, USA, June 14-19, 2020. ACM 2020, ISBN 978-1-4503-7108-7
Keynote
- Martin Grohe:
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data. 1-16
Session: Test-of-Time Award and Gems of PODS
- Georg Gottlob, Jan Van den Bussche, Dirk Van Gucht:
2020 ACM PODS Alberto O. Mendelzon Test-of-Time Award. 17 - Dan Suciu
:
Probabilistic Databases for All. 19-31 - Marco Console, Paolo Guagliardo, Leonid Libkin, Etienne Toussaint:
Coping with Incomplete Data: Recent Advances. 33-47
Session 1: Streams - Robustness and Determinism
- Omri Ben-Eliezer, Eylon Yogev:
The Adversarial Robustness of Sampling. 49-62 - Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
A Framework for Adversarially Robust Streaming Algorithms. 63-80 - Graham Cormode, Pavel Veselý:
A Tight Lower Bound for Comparison-Based Quantile Summaries. 81-93
Session 2: Containment and Rewritability
- Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Bag Query Containment and Information Theory. 95-112 - Paraschos Koutris, Jef Wijsen:
First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys. 113-129 - Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero:
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. 131-148
Session 3: Probabilistic and Incomplete Databases
- Mikaël Monet:
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. 149-163 - Marcelo Arenas, Pablo Barceló, Mikaël Monet:
Counting Problems over Incomplete Databases. 165-177 - Marco Console, Matthias F. J. Hofer, Leonid Libkin:
Queries with Arithmetic on Incomplete Databases. 179-189
Session 4: Data Structures
- Martin Aumüller, Rasmus Pagh, Francesco Silvestri:
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. 191-204 - Mayank Goswami, Riko Jacob, Rasmus Pagh:
On the I/O Complexity of the k-Nearest Neighbors Problem. 205-212 - Pankaj K. Agarwal, Stavros Sintos, Alex Steiger:
Efficient Indexes for Diverse Top-k Range Queries. 213-227
Invited Tutorial 1
- Adnan Darwiche:
Three Modern Roles for Logic in AI. 229-243
Session 5: Dependencies
- Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris:
All-Instances Restricted Chase Termination. 245-258 - Pablo Barceló, Victor Dalmau, Cristina Feier, Carsten Lutz, Andreas Pieris:
The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs. 259-270
Session 6: Resilience and Relevance
- Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou:
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. 271-284 - Alon Reshef, Benny Kimelfeld, Ester Livshits:
The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries. 285-297
Session 7: Database-Driven Workflows and Transactions
- Luc Segoufin, Victor Vianu:
Projection Views of Register Automata. 299-313 - Bas Ketsman, Christoph Koch, Frank Neven, Brecht Vandevoort:
Deciding Robustness for Lower SQL Isolation Levels. 315-330
Invited Tutorial 2
- Arnaud Durand:
Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration. 331-346
Session 8: Languages
- Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. 347-360 - Markus L. Schmid:
Conjunctive Regular Path Queries with String Variables. 361-374
Session 9: Query enumeration and Aggregation
- Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. 375-392 - Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt:
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. 393-409 - Xiao Hu, Ke Yi:
Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries. 411-425 - Szymon Torunczyk:
Aggregate Queries on Sparse Databases. 427-443
Session 10: Streams - Cycle Counting
- Andrew McGregor, Sofya Vorotnikova:
Triangle and Four Cycle Counting in the Data Stream Model. 445-456 - Suman K. Bera, C. Seshadhri:
How the Degeneracy Helps for Triangle Counting in Graph Streams. 457-467
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-07-20 20:17 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:
