LIPIcs, Volume 255, ICDT 2023

• Floris Geerts and Brecht Vandevoort LIPIcs, Volume 255, ICDT 2023, Complete Volume 10.4230/LIPIcs.ICDT.2023
• Floris Geerts and Brecht Vandevoort Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ICDT.2023.0
• Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, and Domagoj Vrgoč A Researcher’s Digest of GQL (Invited Talk) 10.4230/LIPIcs.ICDT.2023.1
• Gonzalo Navarro Compact Data Structures Meet Databases (Invited Talk) 10.4230/LIPIcs.ICDT.2023.2
• C. Seshadhri Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk) 10.4230/LIPIcs.ICDT.2023.3
• Shiyuan Deng, Francesco Silvestri, and Yufei Tao Enumerating Subgraphs of Constant Sizes in External Memory 10.4230/LIPIcs.ICDT.2023.4
• Pavel Raykov An Optimal Algorithm for Sliding Window Order Statistics 10.4230/LIPIcs.ICDT.2023.5
• Shiyuan Deng, Shangqi Lu, and Yufei Tao Space-Query Tradeoffs in Range Subgraph Counting and Listing 10.4230/LIPIcs.ICDT.2023.6
• Martín Muñoz and Cristian Riveros Constant-Delay Enumeration for SLP-Compressed Documents 10.4230/LIPIcs.ICDT.2023.7
• Kyle Deeds, Dan Suciu, Magda Balazinska, and Walter Cai Degree Sequence Bound for Join Cardinality Estimation 10.4230/LIPIcs.ICDT.2023.8
• Andreas Pieris and Jorge Salas Absolute Expressiveness of Subgraph-Based Centrality Measures 10.4230/LIPIcs.ICDT.2023.9
• Timo Camillo Merkl, Reinhard Pichler, and Sebastian Skritek Diversity of Answers to Conjunctive Queries 10.4230/LIPIcs.ICDT.2023.10
• Majd Khalil and Benny Kimelfeld The Complexity of the Shapley Value for Regular Path Queries 10.4230/LIPIcs.ICDT.2023.11
• Cristian Riveros, Jorge Salas, and Oskar Skibski How Do Centrality Measures Choose the Root of Trees? 10.4230/LIPIcs.ICDT.2023.12
• Tamara Cucumides, Juan Reutter, and Domagoj Vrgoč Size Bounds and Algorithms for Conjunctive Regular Path Queries 10.4230/LIPIcs.ICDT.2023.13
• Antoine Amarilli Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries 10.4230/LIPIcs.ICDT.2023.14
• Diego Figueira and Rémi Morvan Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries 10.4230/LIPIcs.ICDT.2023.15
• Jens Keppeler, Thomas Schwentick, and Christopher Spinrath Work-Efficient Query Evaluation with PRAMs 10.4230/LIPIcs.ICDT.2023.16
• Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang Conjunctive Queries with Free Access Patterns Under Updates 10.4230/LIPIcs.ICDT.2023.17
• Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, and Sebastian Rudolph Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying 10.4230/LIPIcs.ICDT.2023.18
• Sepehr Assadi, Nirmit Joshi, Milind Prabhu, and Vihan Shah Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs 10.4230/LIPIcs.ICDT.2023.19
• Martin Grohe, Peter Lindner, and Christoph Standke Probabilistic Query Evaluation with Bag Semantics 10.4230/LIPIcs.ICDT.2023.20
• Jingfan Meng, Huayi Wang, Jun Xu, and Mitsunori Ogihara On Efficient Range-Summability of IID Random Variables in Two or Higher Dimensions 10.4230/LIPIcs.ICDT.2023.21
• Amir Gilad, Aviram Imber, and Benny Kimelfeld The Consistency of Probabilistic Databases with Independent Cells 10.4230/LIPIcs.ICDT.2023.22
• Aziz Amezian El Khalfioui and Jef Wijsen Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting 10.4230/LIPIcs.ICDT.2023.23
• Diego Figueira, Anantha Padmanabha, Luc Segoufin, and Cristina Sirangelo A Simple Algorithm for Consistent Query Answering Under Primary Keys 10.4230/LIPIcs.ICDT.2023.24