LIPIcs, Volume 290, ICDT 2024

• Graham Cormode and Michael Shekelyan LIPIcs, Volume 290, ICDT 2024, Complete Volume 10.4230/LIPIcs.ICDT.2024
• Graham Cormode and Michael Shekelyan Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ICDT.2024.0
• Georgia Koutrika Natural Language Data Interfaces: A Data Access Odyssey (Invited Talk) 10.4230/LIPIcs.ICDT.2024.1
• Sudeepa Roy, Amir Gilad, Yihao Hu, Hanze Meng, Zhengjie Miao, Kristin Stephens-Martinez, and Jun Yang How Database Theory Helps Teach Relational Queries in Database Education (Invited Talk) 10.4230/LIPIcs.ICDT.2024.2
• Andreas Pieris Rule-Based Ontologies: From Semantics to Syntax (Invited Talk) 10.4230/LIPIcs.ICDT.2024.3
• Idan Eldar, Nofar Carmeli, and Benny Kimelfeld Direct Access for Answers to Conjunctive Queries with Aggregation 10.4230/LIPIcs.ICDT.2024.4
• Tamara Cucumides and Juan Reutter Communication Cost of Joins over Federated Data 10.4230/LIPIcs.ICDT.2024.5
• Sanjay Krishnan and Stavros Sintos Range Entropy Queries and Partitioning 10.4230/LIPIcs.ICDT.2024.6
• Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, and Stefan Mengel Skyline Operators for Document Spanners 10.4230/LIPIcs.ICDT.2024.7
• Balder ten Cate, Victor Dalmau, Phokion G. Kolaitis, and Wei-Lin Wu When Do Homomorphism Counts Help in Query Algorithms? 10.4230/LIPIcs.ICDT.2024.8
• Zhewei Wei, Ji-Rong Wen, and Mingji Yang Approximating Single-Source Personalized PageRank with Absolute Error Guarantees 10.4230/LIPIcs.ICDT.2024.9
• Balder ten Cate, Víctor Dalmau, and Jakub Opršal Right-Adjoints for Datalog Programs 10.4230/LIPIcs.ICDT.2024.10
• Sungjin Im, Benjamin Moseley, Hung Ngo, and Kirk Pruhs On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings 10.4230/LIPIcs.ICDT.2024.11
• Thomas Muñoz Serrano, Cristian Riveros, and Stijn Vansummeren Enumeration and Updates for Conjunctive Linear Algebra Queries Through Expressibility 10.4230/LIPIcs.ICDT.2024.12
• Florent Capelli and Oliver Irwin Direct Access for Conjunctive Queries with Negations 10.4230/LIPIcs.ICDT.2024.13
• Martin Grohe, Benny Kimelfeld, Peter Lindner, and Christoph Standke The Importance of Parameters in Database Queries 10.4230/LIPIcs.ICDT.2024.14
• Antoine Amarilli, Timothy van Bremen, and Kuldeep S. Meel Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability 10.4230/LIPIcs.ICDT.2024.15
• Hubie Chen and Stefan Mengel Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity 10.4230/LIPIcs.ICDT.2024.16
• Sylvain Salvati and Sophie Tison Containment of Regular Path Queries Under Path Constraints 10.4230/LIPIcs.ICDT.2024.17
• Pankaj K. Agarwal, Rahul Raychaudhury, Stavros Sintos, and Jun Yang Computing Data Distribution from Query Selectivities 10.4230/LIPIcs.ICDT.2024.18
• Miika Hannula Information Inequality Problem over Set Functions 10.4230/LIPIcs.ICDT.2024.19
• Miika Hannula Conditional Independence on Semiring Relations 10.4230/LIPIcs.ICDT.2024.20
• Shiyuan Deng and Yufei Tao Subgraph Enumeration in Optimal I/O Complexity 10.4230/LIPIcs.ICDT.2024.21
• Cristina Feier, Tomasz Gogacz, and Filip Murlak Evaluating Graph Queries Using Semantic Treewidth 10.4230/LIPIcs.ICDT.2024.22
• Ru Wang and Yufei Tao Join Sampling Under Acyclic Degree Constraints and (Cyclic) Subgraph Sampling 10.4230/LIPIcs.ICDT.2024.23
• Xiao Hu and Stavros Sintos Finding Smallest Witnesses for Conjunctive Queries 10.4230/LIPIcs.ICDT.2024.24
• Antoine Amarilli, Pierre Bourhis, Florent Capelli, and Mikaël Monet Ranked Enumeration for MSO on Trees via Knowledge Compilation 10.4230/LIPIcs.ICDT.2024.25