Abstract
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important in many areas, including information integration, query optimization, and reasoning about Entity-Relationship diagrams. We encode this problem into an expressive logic called μ-calculus: where RDF graphs become transition systems, queries and schema axioms become formulas. Thus, the containment problem is reduced to formula satisfiability test. Beyond the logic’s expressive power, satisfiability solvers are available for it. Hence, this study allows to exploit these advantages.
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.
References
Alkhateeb, F., Baget, J.-F., Euzenat, J.: Extending SPARQL with regular expression patterns (for querying RDF). J. Web Semantics 7(2), 57–73 (2009)
Angles, R., Gutierrez, C.: The Expressive Power of SPARQL. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 114–129. Springer, Heidelberg (2008)
Barceló, P., Hurtado, C., Libkin, L., Wood, P.: Expressive languages for path queries over graph-structured data. In: PODS 2010, pp. 3–14. ACM (2010)
Bonatti, P.A., Lutz, C., Murano, A., Vardi, M.Y.: The Complexity of Enriched μ-Calculi. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 540–551. Springer, Heidelberg (2006)
Calvanese, D., De Giacomo, G., Lenzerini, M.: Conjunctive Query Containment and Answering under Description Logics Constraints. ACM Trans. on Computational Logic 9(3), 22.1–22.31 (2008)
Calvanese, D., Ortiz, M., Simkus, M.: Containment of regular path queries under description logic constraints. In: Proc. of the 22nd Int. Joint Conf. on Artificial Intelligence, IJCAI 2011 (2011)
Calvanese, D., Rosati, R.: Answering Recursive Queries under Keys and Foreign Keys is Undecidable. In: Proc. of the 10th Int. Workshop on Knowledge Representation meets Databases (KRDB 2003), vol. 79, pp. 3–14 (2003)
Chekol, M.W., Euzenat, J., Genevès, P., Layaïda, N.: PSPARQL query containment. In: DBPL 2011 (August 2011)
Genevès, P., Layaïda, N., Schmitt, A.: Efficient Static Analysis of XML Paths and Types. In: PLDI 2007, pp. 342–351. ACM, New York (2007)
Glimm, B.: Using SPARQL with RDFS and OWL entailment. In: Polleres, A., d’Amato, C., Arenas, M., Handschuh, S., Kroner, P., Ossowski, S., Patel-Schneider, P. (eds.) Reasoning Web 2011. LNCS, vol. 6848, pp. 137–201. Springer, Heidelberg (2011)
Hayes, P.: RDF Semantics. W3C Recommendation (2004)
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: Proc. of KR 2006, pp. 57–67 (2006)
Horrocks, I., Sattler, U., Tobies, S.: Practical Reasoning for Expressive Description Logics. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705, pp. 161–180. Springer, Heidelberg (1999)
Ioannidis, Y.E.: Query Optimization. ACM Comput. Surv. 28(1), 121–123 (1996)
Kozen, D.: Results on the propositional μ-calculus. Theor. Comp. Sci. 27, 333–354 (1983)
Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM Transactions on Database Systems (TODS) 34(3), 16 (2009)
Prud’hommeaux, E., Seaborne, A.: SPARQL Query Language for RDF. W3C Rec (2008)
Tanabe, Y., Takahashi, K., Hagiya, M.: A Decision Procedure for Alternation-Free Modal μ-calculi. In: Advances in Modal Logic, pp. 341–362 (2008)
Tanabe, Y., Takahashi, K., Yamamoto, M., Tozawa, A., Hagiya, M.: A Decision Procedure for the Alternation-Free Two-Way Modal μ-Calculus. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 277–291. Springer, Heidelberg (2005)
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
Chekol, M.W., Euzenat, J., Genevès, P., Layaïda, N. (2012). SPARQL Query Containment under RDFS Entailment Regime. In: Gramlich, B., Miller, D., Sattler, U. (eds) Automated Reasoning. IJCAR 2012. Lecture Notes in Computer Science(), vol 7364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31365-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-31365-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31364-6
Online ISBN: 978-3-642-31365-3
eBook Packages: Computer ScienceComputer Science (R0)