Advertisement

Containment of Expressive SPARQL Navigational Queries

  • Melisachew Wudage ChekolEmail author
  • Giuseppe Pirrò
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9981)

Abstract

Query containment is one of the building block of query optimization techniques. In the relational world, query containment is a well-studied problem. At the same time it is well-understood that relational queries are not enough to cope with graph-structured data, where one is interested in expressing queries that capture navigation in the graph. This paper contributes a study on the problem of query containment for an expressive class of navigational queries called Extended Property Paths (EPPs). EPPs are more expressive than previous navigational extension of SPARQL (e.g., nested regular expressions) as they allow to express path conjunction and path negation, among others. We attack the problem of EPPs containment and provide complexity bounds.

References

  1. 1.
    Barcelo, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. (TODS) 37, 31 (2012)CrossRefGoogle Scholar
  2. 2.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: Proceedings of 7th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2000), pp. 176–185 (2000)Google Scholar
  3. 3.
    Calvanese, D., Giacomo, G.D., Lenzerini, M.: Conjunctive query containment and answering under description logic constraints. ACM Trans. Comput. Logic (TOCL) 9(3), 22 (2008)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Calvanese, D., Ortiz, M., Simkus, M.: Containment of regular path queries under description logic constraints. In: IJCAI Proceedings-International Joint Conference on Artificial Intelligence, vol. 22, p. 805 (2011)Google Scholar
  5. 5.
    Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, STOC 1977, pp. 77–90. ACM, New York (1977)Google Scholar
  6. 6.
    Chaudhuri,S., Vardi, M.Y.: Optimization of real conjunctive queries. In: Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 1993, pp. 59–70. ACM, New York (1993)Google Scholar
  7. 7.
    Chekol, M.W.: Static analysis of semantic web queries. Ph.D. thesis, Université de Grenoble (2012)Google Scholar
  8. 8.
    Chekol, M.W., Euzenat, J., Genevès, P., Layaïda, N.: PSPARQL query containment. In: Proceedings of DBPL (2011)Google Scholar
  9. 9.
    Chekol, M.W., Euzenat, J., Genevès, P., Layaïda, N.: SPARQL query containment under RDFS entailment regime. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol. 7364, pp. 134–148. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  10. 10.
    Chekol, M.W., Euzenat, J., Genevès, P., Layaïda, N.: SPARQL query containment under SHI axioms. In: Proceedings of AAAI, pp. 10–16 (2012)Google Scholar
  11. 11.
    Fionda, V., Pirrò, G.: Querying graphs with preferences. In: 22nd ACM International Conference on Information and Knowledge Management, CIKM 2013, San Francisco, CA, USA, October 27– November 1, pp. 929–938 (2013)Google Scholar
  12. 12.
    Fionda, V., Pirrò, G., Consens, M.P.: Extended property paths: writing more SPARQL queries in a succinct way. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 25–30 January, Austin, Texas, USA, pp. 102–108 (2015)Google Scholar
  13. 13.
    Fionda, V., Pirrò, G., Gutierrez, C.: NautiLOD: a formal language for the web of data graph. Trans. Web 9(1), 5: 1–5: 43 (2015)Google Scholar
  14. 14.
    Genevès, P., Layaïda, N.: A system for the static analysis of XPath. ACM Trans. Inf. Syst. 24(4), 475–502 (2006)CrossRefGoogle Scholar
  15. 15.
    Genevès, P., Layaïda, N., Schmitt, A.: Efficient static analysis of XML paths and types. In: Proceedings of PLDI, pp. 342–351. ACM (2007)Google Scholar
  16. 16.
    Genevès, P., Schmitt, A. : Expressive logical combinators for free. In: IJCAI, pp. 311–317 (2015)Google Scholar
  17. 17.
    Göller, S., Lohrey, M., Lutz, C.: PDL with intersection and converse: satisfiability and infinite-state model checking. J. Symb. Logic 74(01), 279–314 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)zbMATHGoogle Scholar
  19. 19.
    Ioannidis, Y.E., Ramakrishnan, R.: Containment of conjunctive queries: beyond relations as sets. ACM Trans. Database Syst. 20(3), 288–324 (1995)CrossRefGoogle Scholar
  20. 20.
    Kostylev, E.V., Reutter, J.L., Romero, M., Vrgoč, D.: SPARQL with property paths. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 3–18. Springer, Heidelberg (2015)Google Scholar
  21. 21.
    Kostylev, E.V., Reutter, J.L., Vrgoc, D.: Containment of data graph queries. In: ICDT, pp. 131–142 (2014)Google Scholar
  22. 22.
    Kostylev, E.V., Reutter, J.L., Vrgoč, D.: Static analysis of navigational XPath over graph databases. Inf. Process. Lett. 116(7), 467–474 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Kozen, D.: Results on the propositional \(\mu \)-calculus. Theoret. Comput. Sci. 27(3), 333–354 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Krötzsch, M., Rudolph, S.: Conjunctive queries for EL with composition of roles. In: Proceedings of the 2007 International Workshop on Description Logics (DL 2007), Brixen-Bressanone, near Bozen-Bolzano, 8–10 Italy 2007, June 2007Google Scholar
  25. 25.
    Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM Trans. Database Syst. (TODS) 34(3), 16 (2009)CrossRefGoogle Scholar
  26. 26.
    Pérez, J., Arenas, M., Gutierrez, C.: nSPARQL: a navigational language for RDF. Web Semant. Sci. Serv. Agents WWW 8(4), 255–270 (2010)CrossRefGoogle Scholar
  27. 27.
    Pichler, R., Skritek, S.: Containment and Equivalence of Well-designed SPARQL, pp. 39–50 (2014)Google Scholar
  28. 28.
    Reutter, J.L.: Containment of nested regular expressions. CoRR, abs/1304.2637 (2013)Google Scholar
  29. 29.
    Sagiv, Y., Yannakakis, M.: Equivalences among relational expressions with the union and difference operators. J. ACM 27(4), 633–655 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  30. 30.
    ten Cate, B., Lutz, C.: The complexity of query containment in expressive fragments of XPath 2.0. J. ACM (JACM) 56(6), 31 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Vardi, M.Y., Murano, A., Lutz, C., Bonatti, P.A.: The complexity of enriched mu-calculi. Log. Methods Comput. Sci. 4, 1–27 (2008)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Data and Web Science GroupUniversity of MannheimMannheimGermany
  2. 2.Institute for High Performance Computing and NetworkingICAR-CNRRendeItaly

Personalised recommendations