Abstract
Weakly-sticky (WS) Datalog\(^\pm \) is an expressive member of the family of Datalog\(^\pm \) programs that is based on the syntactic notions of stickiness and weak-acyclicity. Query answering over the WS programs has been investigated, but there is still much work to do on the design and implementation of practical query answering (QA) algorithms and their optimizations. Here, we study sticky and WS programs from the point of view of the behavior of the chase procedure, extending the stickiness property of the chase to that of generalized stickiness of the chase (gsch-property). With this property we specify the semantic class of GSCh programs, which includes sticky and WS programs, and other syntactic subclasses that we identify. In particular, we introduce joint-weakly-sticky (JWS) programs, that include WS programs. We also propose a bottom-up QA algorithm for a range of subclasses of GSCh. The algorithm runs in polynomial time (in data) for JWS programs. Unlike the WS class, JWS is closed under a general magic-sets rewriting procedure for the optimization of programs with existential rules. We apply the magic-sets rewriting in combination with the proposed QA algorithm for the optimization of QA over JWS programs.
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.
When \({\mathcal {Q}}\) is Boolean, \({ ans}_{{\mathcal {Q}}}\) is a propositional atom; and if \({\mathcal {Q}}\) is true in I, then \({ ans}_{\mathcal {Q}}\) can be reinterpreted as the query answer.
- 2.
A query of this form can be seen and treated as a new TGD containing a fresh head predicate.
References
Alviano, M., Leone, N., Manna, M., Terracina, G., Veltri, P.: Magic-sets for datalog with existential quantifiers. In: Proceedings of Datalog 2012, vol. 12, pp. 701–718 (2012)
Arenas, M., Gottlob, G., Pieris, A.: Expressive languages for querying the semantic web. In: Proceedings of PODS, pp. 14–26 (2014)
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-lite family and relations. J. Artif. Intell. 36, 1–69 (2009)
Baget, J.F., Leclère, M., Mugnier, M.L., Salvat, E.: Extending decidable cases for rules with existential variables. In: Proceedings of IJCAI, pp. 677–682 (2009)
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 proof procedure for data dependencies. J. ACM 31(4), 718–741 (1984)
Beeri, C., Ramakrishnan, R.: On the power of magic. In: Proceedings of PODS, pp. 269–284 (1987)
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.: Ontological query answering under expressive entity-relationship schemata. Inf. Syst. 37(4), 320–335 (2012)
Calì, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: the query answering problem. Artif. Intell. 193, 87–128 (2012)
Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)
Deutsch, A., Nash, A., Remmel, J.: 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)
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\(^\exists \) programs. In: Proceedings of KR, pp. 13–23 (2012)
Maier, D., Mendelzon, A., Sagiv, Y.: Testing implications of data dependencies. In: Proceedings of TODS, pp. 152–152 (1979)
Marnette, B.: Generalized schema-mappings: from termination to tractability. In: Proceedings of PODS, pp. 13–22 (2009)
Meier, M., Schmidt, M., Lausen, G.: Efficiently computable datalog\(^\exists \) programs. In: Proceedings of VLDB Endowment, pp. 970–981 (2009)
Milani, M., Bertossi, L.: Ontology-based multidimensional contexts with applications to quality data specification and extraction. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 277–293. Springer, Heidelberg (2015)
Milani, M., Calì, A., Bertossi, L.: A hybrid approach to query answering under expressive datalog\(^\pm \). Conference Submission (2016)
Milani, M., Bertossi, L.: Extending Weakly-sticky Datalog\(^\pm \): Query-answering Tractability and Optimizations. https://goo.gl/bJ8MGA
Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. In: Spaccapietra, S. (ed.) Journal on Data Semantics X. LNCS, vol. 4900, pp. 133–173. Springer, Heidelberg (2008)
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., Bertossi, L. (2016). Extending Weakly-Sticky Datalog\(^\pm \): Query-Answering Tractability and Optimizations. 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_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-45276-0_10
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)