| Id | Authors | Title |
|---|---|---|
| 101 | Sepehr Assadi, Nirmit Joshi, Milind Prabhu and Vihan Shah | Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs |
| 102 | Tamara Cucumides, Juan L. Reutter and Domagoj Vrgoc | Size bounds and algorithms for conjunctive regular path queries |
| 103 | Kyle Deeds, Dan Suciu, Magdalena Balazinska and Walter Cai | Degree Sequence Bound For Join Cardinality Estimation |
| 104 | Shiyuan Deng, Shangqi Lu and Yufei Tao | Space-Query Tradeoffs in Range Subgraph Counting and Listing |
| 105 | Thomas Feller, Timothy Lyon, Piotr Ostropolski-Nalewaja and Sebastian Rudolph | Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying |
| 106 | Diego Figueira, Anantha Padmanabha, Luc Segoufin and Cristina Sirangelo | A simple algorithm for consistent query answering under primary keys |
| 107 | Martin Grohe, Peter Lindner and Christoph Standke | Probabilistic Query Evaluation with Bag Semantics |
| 108 | Majd Khalil and Benny Kimelfeld | The Complexity of the Shapley Value for Regular Path Queries |
| 109 | Jingfan Meng, Huayi Wang, Jun Xu and Mitsunori Ogihara | On Efficient Range-Summability of IID Random Variables in Two or Higher Dimensions |
| 110 | Timo Merkl, Reinhard Pichler and Sebastian Skritek | Diversity of Answers to Conjunctive Queries |
| 111 | Pavel Raykov | An optimal algorithm for sliding window order statistics |
| 112 | Aziz Amezian El Khalfioui and Jef Wijsen | Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting |
| 113 | Martín Muñoz and Cristian Riveros | Constant-delay enumeration for SLP-compressed documents |
| 114 | Andreas Pieris and Jorge Salas | Absolute Expressiveness of Subgraph Motif Centrality Measures |
| 115 | Amir Gilad, Aviram Imber and Benny Kimelfeld | The Consistency of Probabilistic Databases with Independent Cells |
| 116 | Antoine Amarilli | Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries |
| 117 | Jens Keppeler, Thomas Schwentick and Christopher Spinrath | Work-Efficient Query Evaluation with PRAMs |
| 118 | Diego Figueira and Rémi Morvan | Approximation and Semantic Tree-width of Conjunctive Regular Path Queries |
| 119 | Cristian Riveros, Jorge Salas and Oskar Skibski | On the foundations of data centrality: the trees case |
| 120 | Ahmet Kara, Milos Nikolic, Dan Olteanu and Haozhe Zhang | Conjunctive Queries with Free Access Patterns under Updates |
| 121 | Shiyuan Deng, Francesco Silvestri and Yufei Tao | The I/O Complexity of Enumerating Subgraphs of Constant Sizes |