Skip to main content

SPARQL Query Containment with ShEx Constraints

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10509))

Abstract

ShEx (Shape Expressions) is a language for expressing constraints on RDF graphs. We consider the problem of SPARQL query containment in the presence of ShEx constraints. We first propose a sound and complete procedure for the problem of containment with ShEx, considering several SPARQL fragments. Particularly our procedure considers OPTIONAL query patterns, that turns out to be an important fragment to be studied with schemas. We then show the complexity bounds of our problem with respect to the fragments considered. To the best of our knowledge, this is the first work addressing SPARQL query containment in the presence of ShEx constraints.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Arenas, M., Pérez, J.: Querying semantic web data with SPARQL. In: Proceedings of the Thirtieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, pp. 305–316. ACM, New York (2011)

    Google Scholar 

  2. Boneva, I., Gayo, J.E.L., Hym, S., Prud’hommeaux, E.G., Solbrig, H.R., Staworko, S.: Validating RDF with shape expressions. CoRR, abs/1404.1270 (2014)

    Google Scholar 

  3. 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 

  4. Chekol, M.W.: On the containment of SPARQL queries under entailment regimes. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 936–942. AAAI Press (2016)

    Google Scholar 

  5. Chekol, M.W., Euzenat, J., Genevès, P., Layaïda, N.: PSPARQL query containment. In: DBPL (2011)

    Google Scholar 

  6. 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). doi:10.1007/978-3-642-31365-3_13

    Chapter  Google Scholar 

  7. Chekol, M.W., Euzenat, J., Genevès, P., Layaïda, N.: SPARQL query containment under SHI axioms. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2012, pp. 10–16. AAAI Press (2012)

    Google Scholar 

  8. Colazzo, D., Sartiani, C.: Typing regular path query languages for data graphs. In: Proceedings of the 15th Symposium on Database Programming Languages, DBPL 2015, pp. 69–78. ACM, New York (2015)

    Google Scholar 

  9. Gayo, J.E.L., Prud’hommeaux, E., Boneva, I., Staworko, S., Solbrig, H.R., Hym, S.: Towards an RDF validation language based on regular expression derivatives, pp. 197–204 (2015)

    Google Scholar 

  10. Genevès, P., Layaïda, N.: A system for the static analysis of XPath. ACM Trans. Inf. Syst. 24(4), 475–502 (2006)

    Article  Google Scholar 

  11. Genevès, P., Layaïda, N.: Deciding XPath containment with MSO. Data Knowl. Eng. 63(1), 108–136 (2007). Data Warehouse and Knowledge Discovery (DAWAK ?05)7th International Congress on Data Warehouse and Knowledge Discovery (DAWAK?05)

    Article  Google Scholar 

  12. Genevès, P., Layaïda, N.: XML reasoning made practical. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 1169–1172, March 2010

    Google Scholar 

  13. Grädel, E., Kolaitis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. Bull. Symbolic Logic 3(1), 53–69 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kostylev, E.V., Reutter, J.L., Romero, M., Vrgoč, D.: SPARQL with property paths. In: Arenas, M., Corcho, O., Simperl, E., Strohmaier, M., d’Aquin, M., Srinivas, K., Groth, P., Dumontier, M., Heflin, J., Thirunarayan, K., Staab, S. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 3–18. Springer, Cham (2015). doi:10.1007/978-3-319-25007-6_1

    Chapter  Google Scholar 

  15. Lanthaler, M., Cyganiak, R., Wood, D.: RDF 1.1 concepts and abstract syntax. W3C recommendation, W3C, February 2014. http://www.w3.org/TR/2014/REC-rdf11-concepts-20140225/

  16. Letelier, A., Pérez, J., Pichler, R., Skritek, S.: Static analysis and optimization of semantic web queries, pp. 89–100 (2012)

    Google Scholar 

  17. Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM Trans. Database Syst. 34(3), 16:1–16:45 (2009)

    Article  Google Scholar 

  18. Pichler, R., Skritek, S.: Containment and equivalence of well-designed SPARQL. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2014, pp. 39–50. ACM, New York (2014)

    Google Scholar 

  19. Prud’hommeaux, E.: Shape expressions (ShEx) primer. Technical report, W3C and MIT, February 2017. http://shexspec.github.io/primer/

  20. Prud’hommeaux, E., Gayo, J.E.L., Solbrig, H.: Shape expressions: an RDF validation and transformation language. In: Proceedings of the 10th International Conference on Semantic Systems, SEM 2014, pp. 32–40. ACM, New York (2014)

    Google Scholar 

  21. Schreiber, G., Raimond, Y.: RDF 1.1 primer. W3C note, W3C, June 2014. http://www.w3.org/TR/2014/NOTE-rdf11-primer-20140624/

  22. Seaborne, A., Harris, S.: SPARQL 1.1 query language. W3C recommendation, W3C, March 2013. http://www.w3.org/TR/2013/REC-sparql11-query-20130321/

  23. Staworko, S., Boneva, I., Gayo, J.E.L., Hym, S., Prud’hommeaux, E.G., Solbrig, H.: Complexity and expressiveness of ShEx for RDF. In: Arenas, M., Ugarte, M. (eds.) 18th International Conference on Database Theory (ICDT 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol. 31, pp. 195–211. Dagstuhl, Germany (2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik

    Google Scholar 

  24. Zhang, X., Van Den Bussche, J., Picalausa, F.: On the satisfiability problem for sparql patterns. J. Artif. Int. Res. 56(1), 403–428 (2016)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abdullah Abbas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Abbas, A., Genevès, P., Roisin, C., Layaïda, N. (2017). SPARQL Query Containment with ShEx Constraints. In: Kirikova, M., Nørvåg, K., Papadopoulos, G. (eds) Advances in Databases and Information Systems. ADBIS 2017. Lecture Notes in Computer Science(), vol 10509. Springer, Cham. https://doi.org/10.1007/978-3-319-66917-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66917-5_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66916-8

  • Online ISBN: 978-3-319-66917-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics