Abstract is missing.
- word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured DataMartin Grohe. 1-16 [doi]
- 2020 ACM PODS Alberto O. Mendelzon Test-of-Time AwardGeorg Gottlob, Jan Van den Bussche, Dirk Van Gucht. 17 [doi]
- Probabilistic Databases for AllDan Suciu. 19-31 [doi]
- Coping with Incomplete Data: Recent AdvancesMarco Console, Paolo Guagliardo, Leonid Libkin, Etienne Toussaint. 33-47 [doi]
- The Adversarial Robustness of SamplingOmri Ben-Eliezer, Eylon Yogev. 49-62 [doi]
- A Framework for Adversarially Robust Streaming AlgorithmsOmri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev. 63-80 [doi]
- A Tight Lower Bound for Comparison-Based Quantile SummariesGraham Cormode, Pavel Veselý. 81-93 [doi]
- Bag Query Containment and Information TheoryMahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo 0001, Dan Suciu. 95-112 [doi]
- First-Order Rewritability in Consistent Query Answering with Respect to Multiple KeysParaschos Koutris, Jef Wijsen. 113-129 [doi]
- On Monotonic Determinacy and Rewritability for Recursive Queries and ViewsMichael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero 0001. 131-148 [doi]
- Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic DatabasesMikaël Monet. 149-163 [doi]
- Counting Problems over Incomplete DatabasesMarcelo Arenas, Pablo Barceló, Mikaël Monet. 165-177 [doi]
- Queries with Arithmetic on Incomplete DatabasesMarco Console, Matthias Hofer, Leonid Libkin. 179-189 [doi]
- Fair Near Neighbor Search: Independent Range Sampling in High DimensionsMartin Aumüller 0001, Rasmus Pagh, Francesco Silvestri 0001. 191-204 [doi]
- On the I/O Complexity of the k-Nearest Neighbors ProblemMayank Goswami, Riko Jacob, Rasmus Pagh. 205-212 [doi]
- Efficient Indexes for Diverse Top-k Range QueriesPankaj K. Agarwal, Stavros Sintos, Alex Steiger. 213-227 [doi]
- Three Modern Roles for Logic in AIAdnan Darwiche. 229-243 [doi]
- All-Instances Restricted Chase TerminationTomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris. 245-258 [doi]
- The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDsPablo Barceló, Victor Dalmau, Cristina Feier, Carsten Lutz, Andreas Pieris. 259-270 [doi]
- New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-JoinsCibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou. 271-284 [doi]
- The Impact of Negation on the Complexity of the Shapley Value in Conjunctive QueriesAlon Reshef, Benny Kimelfeld, Ester Livshits. 285-297 [doi]
- Projection Views of Register AutomataLuc Segoufin, Victor Vianu. 299-313 [doi]
- Deciding Robustness for Lower SQL Isolation LevelsBas Ketsman, Christoph Koch 0001, Frank Neven, Brecht Vandevoort. 315-330 [doi]
- Fine-Grained Complexity Analysis of Queries: From Decision to Counting and EnumerationArnaud Durand 0001. 331-346 [doi]
- Generative Datalog with Continuous DistributionsMartin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner. 347-360 [doi]
- Conjunctive Regular Path Queries with String VariablesMarkus L. Schmid. 361-374 [doi]
- Trade-offs in Static and Dynamic Evaluation of Hierarchical QueriesAhmet Kara 0002, Milos Nikolic, Dan Olteanu, Haozhe Zhang. 375-392 [doi]
- Answering (Unions of) Conjunctive Queries using Random Access and Random-Order EnumerationNofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt. 393-409 [doi]
- Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate QueriesXiao Hu, Ke Yi 0001. 411-425 [doi]
- Aggregate Queries on Sparse DatabasesSzymon Torunczyk. 427-443 [doi]
- Triangle and Four Cycle Counting in the Data Stream ModelAndrew McGregor 0001, Sofya Vorotnikova. 445-456 [doi]
- How the Degeneracy Helps for Triangle Counting in Graph StreamsSuman K. Bera, C. Seshadhri. 457-467 [doi]