Abstract
Datalog\(^\pm \) is a family of ontology languages that combine good computational properties with high expressive power. Datalog\(^\pm \) languages are provably able to capture many relevant Semantic Web languages. In this paper we consider the class of weakly-sticky (WS) Datalog\(^\pm \) programs, which allow for certain useful forms of joins in rule bodies as well as extending the well-known class of weakly-acyclic TGDs. So far, only nondeterministic algorithms were known for answering queries on WS Datalog\(^\pm \) programs. We present novel deterministic query answering algorithms under WS Datalog\(^\pm \). In particular, we propose: (1) a bottom-up grounding algorithm based on a query-driven chase, and (2) a hybrid approach based on transforming a WS program into a so-called sticky one, for which query rewriting techniques are known. We discuss how our algorithms can be optimized and effectively applied for query answering in real-world scenarios.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Here we adopt the usual notation for conjuntive queries, where the head appears on the left-hand side.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)
Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) Automata, Languages and Programming. LNCS, vol. 115, pp. 73–85. Springer, Heidelberg (1981)
Beeri, C., Vardi, M.Y.: A procedure for data dependencies. J. ACM 31(4), 718–741 (1984)
Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Semant. 14, 57–83 (2012)
Calì, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: the query answering problem. Artif. Intell. 193, 87–128 (2012)
Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: Proceedings of PODS, pp. 149–158 (2008)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. TCS 336, 89–124 (2005)
Gottlob, G., Orsi, G., Pieris, A.: Query rewriting and optimization for ontological databases. Proc. TODS 39(3), 25 (2014)
Johnson, D.S., Klug, A.: Testing containment of conjunctive queries under functional and inclusion dependencies. In: Proceedings of PODS, pp. 164–169 (1984)
Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proceedings of IJCAI, pp. 963–968 (2011)
Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable datalog\(^\pm \) programs. In: Proceedings of KR, pp. 13–23 (2012)
Maier, D., Mendelzon, A., Sagiv, Y.: Testing implications of data dependencies. In: Proceedings of TODS, p. 152 (1979)
Milani, M., Bertossi, L.: Tractable query answering and optimization for extensions of weakly-sticky datalog+-. In: Proceedings of AMW (2015)
Milani, M., Calì, A., Bertossi, L.: A Hybrid Approach to Query Answering under Expressive Datalog\(^\pm \). Technical report. https://goo.gl/edg9FK
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Milani, M., Calì, A., Bertossi, L. (2016). A Hybrid Approach to Query Answering Under Expressive Datalog\(^\pm \) . In: Ortiz, M., Schlobach, S. (eds) Web Reasoning and Rule Systems. RR 2016. Lecture Notes in Computer Science(), vol 9898. Springer, Cham. https://doi.org/10.1007/978-3-319-45276-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-45276-0_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45275-3
Online ISBN: 978-3-319-45276-0
eBook Packages: Computer ScienceComputer Science (R0)