Counting in SPARQL Property Paths: Perspectives from Theory and Practice

  • Wim Martens
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8071)


RDF and SPARQL are becoming increasingly popular and are bringing many new and interesting research challenges. During the development of these standards, the World Wide Web Consortium (W3C) does not necessarily always have all the cards on the table in order to make perfectly informed design decisions and therefore it partly relies on input from the research community. This is a very interesting situation for researchers since it can give the opportunity to immediately have research results incorporated into practice. In this talk I will discuss some experiences from our interaction with the W3C concerning the semantics of property paths in SPARQL. Property paths are a relatively new feature in SPARQL 1.1 and essentially correspond to regular expressions that should be evaluated over RDF graphs.


Resource Description Framework Graph Database Property Path Resource Description Framework Data Resource Description Framework Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    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: World Wide Web Conference (WWW), pp. 629–638 (2012)Google Scholar
  2. 2.
    Barcelo, P.: Querying graph databases. In: Symposium on Principles of Database Systems (PODS), Invited tutorial (to appear, 2013)Google Scholar
  3. 3.
    Harris, S., Seaborne, A., Prud’hommeaux, E.: SPARQL 1.1 query language. Technical report, W3C (January 2012),
  4. 4.
    Hayes, P., McBride, B.: RDF semantics. Technical report, W3C (February 2004),
  5. 5.
    Klyne, G., Carroll, J.J., McBride, B.: RDF 1.1 concepts and abstract syntax. Technical report, W3C (January 2013),
  6. 6.
    Losemann, K., Martens, W.: The complexity of evaluating path expressions in SPARQL. In: Symposium on Principles of Database Systems (PODS), pp. 101–112 (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Wim Martens
    • 1
  1. 1.Institute for Computer ScienceUniversity of BayreuthGermany

Personalised recommendations