Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Logic, Language, Information, and Computation

WoLLIC 2013: Logic, Language, Information, and Computation pp 29–30Cite as

Counting in SPARQL Property Paths: Perspectives from Theory and Practice

  • Conference paper

  • 760 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8071))

Abstract

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.

This is a preview of subscription content, 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   49.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., 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. Barcelo, P.: Querying graph databases. In: Symposium on Principles of Database Systems (PODS), Invited tutorial (to appear, 2013)

    Google Scholar 

  3. Harris, S., Seaborne, A., Prud’hommeaux, E.: SPARQL 1.1 query language. Technical report, W3C (January 2012), http://www.w3.org/TR/2012/WD-sparql11-query-20120105/

  4. Hayes, P., McBride, B.: RDF semantics. Technical report, W3C (February 2004), http://www.w3.org/TR/2004/REC-rdf-mt-20040210/

  5. Klyne, G., Carroll, J.J., McBride, B.: RDF 1.1 concepts and abstract syntax. Technical report, W3C (January 2013), http://www.w3.org/TR/2013/WD-rdf11-concepts-20130115/

  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 

Download references

Author information

Authors and Affiliations

  1. Institute for Computer Science, University of Bayreuth, Germany

    Wim Martens

Authors
  1. Wim Martens
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Informatics, University of Edinburgh, EH8 9AB, Edinburgh, UK

    Leonid Libkin

  2. Fachbereich Mathematik, TU Darmstadt, Schlossgartenstrasse 7, 64289, Darmstadt, Germany

    Ulrich Kohlenbach

  3. Centro de Informática, Universidade Federal de Pernambuco (UFPE), Av. Jornalista Anibal Fernandes, s/n, Cidade Universitária, 50.740-560, Recife, PE, Brazil

    Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martens, W. (2013). Counting in SPARQL Property Paths: Perspectives from Theory and Practice. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds) Logic, Language, Information, and Computation. WoLLIC 2013. Lecture Notes in Computer Science, vol 8071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39992-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39992-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39991-6

  • Online ISBN: 978-3-642-39992-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation