Abstract
Datalog ∃ is the extension of Datalog allowing existentially quantified variables in rule heads. This language is highly expressive and enables easy and powerful knowledge-modelling, but the presence of existentially quantified variables makes reasoning over Datalog ∃ undecidable in the general case. Restricted classes of Datalog ∃ , such as shy, have been proposed in the literature with the aim of enabling powerful, yet decidable query answering on top of Datalog ∃ programs. However, in order to make such languages attractive it is necessary to guarantee good performance for query answering tasks. This paper works in this direction: improving the performance of query answering on Datalog ∃ . To this end, we design a rewriting method extending the well-known Magic-Sets technique to any Datalog ∃ program. We demonstrate that our rewriting method preserves query equivalence on Datalog ∃ , and can be safely applied to shy programs. We therefore incorporate the Magic-Sets method in DLV ∃ , a system supporting shy. Finally, we carry out an experiment assessing the positive impact of Magic-Sets on DLV ∃ , and the effectiveness of the enhanced DLV ∃ system compared to a number of state-of-the-art systems for ontology-based query answering.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: The Logical Level. Addison-Wesley Longman Publishing Co., Inc. (1995)
Alviano, M., Faber, W., Greco, G., Leone, N.: Magic sets for disjunctive datalog programs. Artificial Intelligence 187–188, 156–192 (2012)
Alviano, M., Faber, W., Leone, N.: Disjunctive ASP with functions: Decidable queries and effective computation. Theory and Practice of Logic Programming 10(4–6), 497–512 (2010)
Alviano, M., Leone, N., Manna, M., Terracina, G., Veltri, P.: Magic-Sets for Datalog with Existential Quantifiers (Extended Version). Technical report, Department of Mathematics, University of Calabria, Italy (June 2012), http://www.mat.unical.it/datalog-exists/pub/12dl2.pdf
Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic Sets and Other Strange Ways to Implement Logic Programs. In: Proc. Int. Symposium on Principles of Database Systems, pp. 1–16 (1986)
Beeri, C., Ramakrishnan, R.: On the power of magic 10(1-4), 255–259 (1991)
Bishop, B., Kiryakov, A., Ognyanoff, D., Peikov, I., Tashev, Z., Velkov, R.: OWLIM: A family of scalable semantic repositories. Semant. Web 2, 33–42 (2011)
Calì, A., Gottlob, G., Kifer, M.: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In: Proc. of the 11th KR Int. Conf., pp. 70–80 (2008), http://dbai.tuwien.ac.at/staff/gottlob/CGK.pdf
Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: Proc. of the 28th PODS Symp., pp. 77–86 (2009)
Calì, A., Gottlob, G., Pieris, A.: Advanced Processing for Ontological Queries. PVLDB 3(1), 554–565 (2010)
Calì, A., Gottlob, G., Pieris, A.: New Expressive Languages for Ontological Query Answering. In: Proc. of the 25th AAAI Conf. on AI, pp. 1541–1546 (2011)
Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 71–86. Springer, Heidelberg (2009)
Calvanese, D., Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family. J. Autom. Reason. 39, 385–429 (2007)
Faber, W., Greco, G., Leone, N.: Magic Sets and their Application to Data Integration. Journal of Computer and System Sciences 73(4), 584–609 (2007)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. TCS 336(1), 89–124 (2005)
Greco, S.: Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries 15(2), 368–385 (2003)
Kollia, I., Glimm, B., Horrocks, I.: SPARQL Query Answering over OWL Ontologies. In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., De Leenheer, P., Pan, J. (eds.) ESWC 2011, Part I. LNCS, vol. 6643, pp. 382–396. Springer, Heidelberg (2011)
Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently Computable Datalog ∃ Programs. In: Proc. of the 13th KR Int. Conf. (page forthcoming, 2012)
Sirin, E., Parsia, B., Grau, B.C., Kalyanpur, A., Katz, Y.: Pellet: A practical OWL-DL reasoner. Web Semant. 5(2), 51–53 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alviano, M., Leone, N., Manna, M., Terracina, G., Veltri, P. (2012). Magic-Sets for Datalog with Existential Quantifiers. In: Barceló, P., Pichler, R. (eds) Datalog in Academia and Industry. Datalog 2.0 2012. Lecture Notes in Computer Science, vol 7494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32925-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-32925-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32924-1
Online ISBN: 978-3-642-32925-8
eBook Packages: Computer ScienceComputer Science (R0)