A Journey to the Frontiers of Query Rewritability
Authors: 
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, 
Sebastian RudolphAuthors Info & Claims
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian RudolphAuthors Info & ClaimsPages 359 - 367
Abstract
We consider (first-order) query rewritability in the context of theory-mediated query answering. The starting point of our journey is the FUS/FES conjecture, which states that any theory that is a finite expansion set (FES) and admits query rewriting (BDD, FUS) must be uniformly bounded. We show that this conjecture holds for a large class of BDD theories, which we call "local". Upon investigating how "non-local" BDD theories can actually get, we discover unexpected phenomena that, we think, are at odds with prevailing intuitions about BDD theories.
References
[1]
Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev. 2009. The DL-Lite Family and Relations. J. Artif. Intell. Res. 36 (2009), 1--69.
[2]
Jean-François Baget, Fabien Garreau, Marie-Laure Mugnier, and Swan Rocher. 2014. Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation. CoRR abs/1405.1071 (2014).
[3]
Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. 2011. On rules with existential variables: Walking the decidability line. Artif. Intell. 175, 9--10 (2011), 1620--1654.
[4]
Pablo Barceló, Gerald Berger, Carsten Lutz, and Andreas Pieris. 2018. First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries. In Proc. of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, Jérôme Lang (Ed.). ijcai.org, 1707--1713.
[5]
Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, and Lily Gallois. 2019. Oblivious and Semi-Oblivious Boundedness for Existential Rules. In Proc. of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019, Sarit Kraus (Ed.). ijcai.org, 1581--1587.
[6]
Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. 2009. Datalog±: a unified approach to ontologies and integrity constraints. In Proc. of the 12th International Conference on Database Theory, ICDT 2009, (ACM International Conference Proceeding Series), Ronald Fagin (Ed.), Vol. 361. ACM, 14--30.
[7]
Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. 2012. A general Datalogbased framework for tractable query answering over ontologies. J. Web Semant. 14 (2012), 57--83.
[8]
Andrea Calì, Georg Gottlob, and Andreas Pieris. 2010. Advanced Processing for Ontological Queries. Proc. VLDB Endow. 3, 1 (2010), 554--565.
[9]
Cristina Civili and Riccardo Rosati. 2015. On the first-order rewritability of conjunctive queries over binary guarded existential rules. In Proc. of the 30th Italian Conference on Computational Logic, (CEUR Workshop Proceedings), Davide Ancona, Marco Maratea, and Viviana Mascardi (Eds.), Vol. 1459. CEUR-WS.org, 25--30.
[10]
Stathis Delivorias, Michel Leclère, Marie-Laure Mugnier, and Federico Ulliana. 2018. On the k-Boundedness for Existential Rules. In Proc. of 2nd International Joint Conference on Rules and Reasoning, RuleML+RR 2018, (Lecture Notes in Computer Science), Christoph Benzmüller, Francesco Ricca, Xavier Parent, and Dumitru Roman (Eds.), Vol. 11092. Springer, 48--64.
[11]
Alin Deutsch, Alan Nash, and Jeffrey B. Remmel. 2008. The chase revisited. In Proc. of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, Maurizio Lenzerini and Domenico Lembo (Eds.). ACM, 149--158.
[12]
Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, and Moshe Y. Vardi. 1993. Undecidable Optimization Problems for Database Logic Programs. J. ACM 40, 3 (1993), 683--713.
[13]
Georg Gottlob, Giorgio Orsi, and Andreas Pieris. 2014. Query Rewriting and Optimization for Ontological Databases. ACM Trans. Database Syst. 39, 3 (2014), 25:1--25:46.
[14]
Pavol Hell and Jaroslav Nesetril. 1992. The core of a graph. Discret. Math. 109, 1--3 (1992), 117--126.
[15]
Mélanie König, Michel Leclère, Marie-Laure Mugnier, and Michaël Thomazo. 2015. Sound, complete and minimal UCQ-rewriting for existential rules. Semantic Web 6, 5 (2015), 451--475.
[16]
Markus Krötzsch. 2020. What is First-Order Rewritable (and FOQuery)? https://cstheory.stackexchange.com/questions/4859/what-is-first-orderrewritable-and-fo-query. Accessed: 2020--11--27.
[17]
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, and Sebastian Rudolph. 2022. A Journey to the Frontiers of Query Rewritability (Extended Technical Report). In https://hal.archives-ouvertes.fr/hal-03599601v1.
[18]
Michaël Thomazo. 2013. Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms. Ph.D. Dissertation. Montpellier 2 University, France.
Index Terms
- A Journey to the Frontiers of Query Rewritability
Recommendations
Query Optimization for Ontology-Mediated Query Answering
WWW '24: Proceedings of the ACM Web Conference 2024Ontology-mediated query answering (OMQA) consists in asking database queries on knowledge bases (KBs); a KB is a set of facts called the KB's database, which is described by domain knowledge called the KB's ontology. A widely-investigated OMQA technique ...
Fast Query Answering over Existential Rules
Enhancing Datalog with existential quantification gives rise to Datalog∃, a powerful knowledge representation language widely used in ontology-based query answering. In this setting, a conjunctive query is evaluated over a Datalog∃ program consisting of ...
A tetrachotomy of ontology-mediated queries with a covering axiom
AbstractOur concern is the problem of efficiently determining the data complexity of answering queries mediated by description logic ontologies and constructing their optimal rewritings to standard database queries. Originated in ontology-...
Comments
Information & Contributors
Information
Published In
June 2022
462 pages
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 June 2022
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Deutsche Forschungsgemeinschaft
- Polish National Science Center
- Agence Nationale de la Recherche
Conference
SIGMOD/PODS '22
Sponsor:
SIGMOD/PODS '22: International Conference on Management of Data
June 12 - 17, 2022
PA, Philadelphia, USA
Acceptance Rates
Overall Acceptance Rate 642 of 2,707 submissions, 24%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 84Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in