default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th ICDT 2024: Paestum, Italy
- Graham Cormode
, Michael Shekelyan:
27th International Conference on Database Theory, ICDT 2024, Paestum, Italy, March 25-28, 2024. LIPIcs 290, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-312-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Georgia Koutrika:
Natural Language Data Interfaces: A Data Access Odyssey (Invited Talk). 1:1-1:22 - Sudeepa Roy, Amir Gilad, Yihao Hu, Hanze Meng, Zhengjie Miao, Kristin Stephens-Martinez, Jun Yang:
How Database Theory Helps Teach Relational Queries in Database Education (Invited Talk). 2:1-2:9 - Andreas Pieris:
Rule-Based Ontologies: From Semantics to Syntax (Invited Talk). 3:1-3:1 - Idan Eldar, Nofar Carmeli, Benny Kimelfeld:
Direct Access for Answers to Conjunctive Queries with Aggregation. 4:1-4:20 - Tamara Cucumides, Juan L. Reutter:
Communication Cost of Joins over Federated Data. 5:1-5:19 - Sanjay Krishnan, Stavros Sintos:
Range Entropy Queries and Partitioning. 6:1-6:21 - Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel:
Skyline Operators for Document Spanners. 7:1-7:18 - Balder ten Cate, Victor Dalmau, Phokion G. Kolaitis, Wei-Lin Wu:
When Do Homomorphism Counts Help in Query Algorithms? 8:1-8:20 - Zhewei Wei, Ji-Rong Wen, Mingji Yang:
Approximating Single-Source Personalized PageRank with Absolute Error Guarantees. 9:1-9:19 - Balder ten Cate, Víctor Dalmau, Jakub Oprsal:
Right-Adjoints for Datalog Programs. 10:1-10:20 - Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. 11:1-11:20 - Thomas Muñoz, Cristian Riveros, Stijn Vansummeren:
Enumeration and Updates for Conjunctive Linear Algebra Queries Through Expressibility. 12:1-12:20 - Florent Capelli, Oliver Irwin:
Direct Access for Conjunctive Queries with Negations. 13:1-13:20 - Martin Grohe, Benny Kimelfeld, Peter Lindner, Christoph Standke:
The Importance of Parameters in Database Queries. 14:1-14:17 - Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel:
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. 15:1-15:20 - Hubie Chen, Stefan Mengel:
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. 16:1-16:17 - Sylvain Salvati, Sophie Tison:
Containment of Regular Path Queries Under Path Constraints. 17:1-17:19 - Pankaj K. Agarwal, Rahul Raychaudhury, Stavros Sintos, Jun Yang:
Computing Data Distribution from Query Selectivities. 18:1-18:20 - Miika Hannula:
Information Inequality Problem over Set Functions. 19:1-19:20 - Miika Hannula:
Conditional Independence on Semiring Relations. 20:1-20:20 - Shiyuan Deng, Yufei Tao:
Subgraph Enumeration in Optimal I/O Complexity. 21:1-21:20 - Cristina Feier, Tomasz Gogacz, Filip Murlak:
Evaluating Graph Queries Using Semantic Treewidth. 22:1-22:20 - Ru Wang, Yufei Tao:
Join Sampling Under Acyclic Degree Constraints and (Cyclic) Subgraph Sampling. 23:1-23:20 - Xiao Hu, Stavros Sintos:
Finding Smallest Witnesses for Conjunctive Queries. 24:1-24:20 - Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet:
Ranked Enumeration for MSO on Trees via Knowledge Compilation. 25:1-25:18
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 2025-12-09 23:37 CET 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:
