Skip to main content
SpringerLink
Log in

Federation and Navigation in SPARQL 1.1

  • Chapter
Reasoning Web. Semantic Technologies for Advanced Query Answering (Reasoning Web 2012)

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

Included in the following conference series:

Abstract

SPARQL is now widely used as the standard query language for RDF. Since the release of its first version in 2008, the W3C group in charge of the standard has been working on extensions of the language to be included in the new version, SPARQL 1.1. These extensions include several interesting and very useful features for querying RDF.

In this paper, we survey two key features of SPARQL 1.1: Federation and navigation capabilities. We first introduce the SPARQL standard presenting its syntax and formal semantics. We then focus on the formalization of federation and navigation in SPARQL 1.1. We analyze some classical theoretical problems such as expressiveness and complexity, and discuss algorithmic properties. Moreover, we present some important recently discovered issues regarding the normative semantics of federation and navigation in SPARQL 1.1, specifically, on the impossibility of answering some unbounded federated queries and the high computational complexity of the evaluation problem for queries including navigation functionalities. Finally, we discuss on possible alternatives to overcome these issues and their implications on the adoption of the standard.

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

Access this chapter

Log in via an institution
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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alkhateeb, F., Baget, J.-F., Euzenat, J.: Constrained regular expressions in SPARQL. In: SWWS, pp. 91–99 (2008)

    Google Scholar 

  2. Alkhateeb, F., Baget, J.-F., Euzenat, J.: Extending SPARQL with regular expression patterns (for querying RDF). JWS 7(2), 57–73 (2009)

    Article  Google Scholar 

  3. Àlvarez, C., Jenner, B.: A very hard log-space counting class. Theor. Comput. Sci. 107(1), 3–30 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Anyanwu, K., Maduko, A., Sheth, A.P.: Sparq2l: towards support for subgraph extraction queries in rdf databases. In: WWW, pp. 797–806 (2007)

    Google Scholar 

  5. Arenas, M., Conca, S., Pérez, J.: Counting beyond a yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard. In: WWW, pp. 629–638 (2012)

    Google Scholar 

  6. Barceló, P., Hurtado, C.A., Libkin, L., Wood, P.T.: Expressive languages for path queries over graph-structured data. In: PODS, pp. 3–14 (2010)

    Google Scholar 

  7. Buil-Aranda, C., Arenas, M., Corcho, O.: Semantics and Optimization of the SPARQL 1.1 Federation Extension. In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., De Leenheer, P., Pan, J. (eds.) ESWC 2011, Part II. LNCS, vol. 6644, pp. 1–15. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Buil-Aranda, C., Arenas, M., Corcho, Ó., Polleres, A.: Federating queries in SPARQL 1.1: Syntax, semantics and evaluation. Submitted for Journal Publication

    Google Scholar 

  9. Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Rewriting of regular expressions and regular path queries. In: PODS, pp. 194–204 (1999)

    Google Scholar 

  10. Carroll, J.J., Dickinson, I., Dollin, C., Reynolds, D., Seaborne, A., Wilkinson, K.: Jena: implementing the semantic web recommendations. In: WWW (Alternate Track Papers & Posters), pp. 74–83 (2004)

    Google Scholar 

  11. Corby, O., Faron-Zucker, C.: The kgram abstract machine for knowledge graph querying. In: Web Intelligence, pp. 338–341 (2010)

    Google Scholar 

  12. Durst, M., Suignard, M.: Rfc 3987, internationalized resource identifiers (iris) (2005)

    Google Scholar 

  13. Eggan, L.C.: Transition graphs and the star-height of regular events. The Michigan Mathematical Journal 10(4), 385–397 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  14. Glimm, B., Ogbuji, C.: Sparql 1.1 entailment regimes (2010)

    Google Scholar 

  15. Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. TODS 30(2), 444–491 (2005)

    Article  Google Scholar 

  16. Harris, S., Seaborne, A.: SPARQL 1.1 query language. W3C Working Draft, (January 5, 2012), http://www.w3.org/TR/2012/WD-sparql11-query-20120105/

  17. Hartig, O., Bizer, C., Freytag, J.-C.: Executing SPARQL Queries over the Web of Linked Data. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 293–309. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Kochut, K.J., Janik, M.: SPARQLeR: Extended Sparql for Semantic Association Discovery. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 145–159. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Losemann, K., Martens, W.: The complexity of evaluating path expressions in sparql. In: PODS, pp. 101–112 (2012)

    Google Scholar 

  20. Marx, M.: Conditional XPath. TODS 30(4), 929–959 (2005)

    Article  Google Scholar 

  21. Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235–1258 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  22. Olson, M., Ogbuji, U.: The Versa specification, http://uche.ogbuji.net/tech/rdf/versa/etc/versa-1.0.xml

  23. Pérez, J., Arenas, M., Gutierrez, C.: Semantics and Complexity of SPARQL. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 30–43. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  24. Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. TODS 34(3) (2009)

    Google Scholar 

  25. Pérez, J., Arenas, M., Gutierrez, C.: nSPARQL: A navigational language for RDF. JWS 8(4), 255–270 (2010)

    Article  Google Scholar 

  26. Prud’hommeaux, E., Seaborne, A.: SPARQL query language for RDF (January 2008)

    Google Scholar 

  27. Prud’hommeaux, E., Buil-Aranda, C.: SPARQL 1.1 federated query. W3C Working Draft (November 17, 2011), http://www.w3.org/TR/2011/+WD-sparql11-federated-query-20111117/

  28. Prud’hommeaux, E., Seaborne, A.: SPARQL query language for RDF. W3C Recommendation (January 15 (2008), http://www.w3.org/TR/rdf-sparql-query/

  29. Selman, A.L.: A taxonomy of complexity classes of functions. J. Comput. Syst. Sci. 48(2), 357–381 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  30. Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189–201 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  31. Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC, pp. 137–146 (1982)

    Google Scholar 

  32. Wagner, K.W.: More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci. 51, 53–80 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  33. ARQ, http://sourceforge.net/projects/jena/files/ARQ/

  34. KGRAM, http://www-sop.inria.fr/edelweiss/software/corese/

  35. RDF: Query, http://search.cpan.org/~gwilliams/RDF-Query

  36. Sesame, http://sourceforge.net/projects/sesame/

  37. Psparql, http://exmo.inrialpes.fr/software/psparql/

  38. RDF data access working group mailing list, http://lists.w3.org/Archives/Public/public-rdf-dawg-comments/

  39. Gleen, http://sig.biostr.washington.edu/projects/ontviews/gleen/

  40. Semantic Web Client Library, http://www4.wiwiss.fu-berlin.de/bizer/ng4j/semwebclient/

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Pontificia Universidad Católica de Chile, Chile

    Marcelo Arenas

  2. Department of Computer Science, Universidad de Chile, Chile

    Jorge Pérez

Authors
  1. Marcelo Arenas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorge Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Systems, Knowledge-Based Systems Group, Vienna University of Technology, Favoritenstraße 9–11/1843, A-1040, Vienna, Austria

    Thomas Eiter  & Thomas Krennwallner  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Arenas, M., Pérez, J. (2012). Federation and Navigation in SPARQL 1.1. In: Eiter, T., Krennwallner, T. (eds) Reasoning Web. Semantic Technologies for Advanced Query Answering. Reasoning Web 2012. Lecture Notes in Computer Science, vol 7487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33158-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33158-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33157-2

  • Online ISBN: 978-3-642-33158-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation