Skip to main content

Recursive Expressions for SPARQL Property Paths

  • Conference paper
  • First Online:
ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium (TPDL 2020, ADBIS 2020)

Abstract

Regular expressions are used in SPARQL property paths to query RDF graphs. However, regular expressions can only define the most limited class of languages, called regular languages. Context-free languages are a wider class containing all regular languages. There are no context-free expressions to define them, so it is necessary to write grammars. We propose an extension of regular expressions, called recursive expressions, to support the definition of a subset of context-free languages. The goal of our work is therefore to provide simple operators allowing the definition of languages as close as possible to context-free languages.

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

Access this chapter

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

Institutional subscriptions

Notes

  1. 1.

    https://github.com/thobe/openCypher/blob/rpq/cip/1.accepted/CIP2017-02-06-Path-Patterns.adoc#153-compared-to-context-free-languages.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)

    MATH  Google Scholar 

  2. Azimov, R., Grigorev, S.: Context-free path querying by matrix multiplication. In: Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) GRADES-NDA 2018. Association for Computing Machinery, New York (2018). https://doi.org/10.1145/3210259.3210264

  3. Coronel, C., Morris, S.: Database Systems: Design, Implementation, & Management. Cengage Learning, Boston (2016)

    Google Scholar 

  4. Grigorev, S., Ragozina, A.: Context-free path querying with structural representation of result. In: Proceedings of the 13th Central & Eastern European Software Engineering Conference in Russia CEE-SECR 2017. Association for Computing Machinery, New York (2017). https://doi.org/10.1145/3166094.3166104

  5. Hellings, J.: Conjunctive context-free path queries. In: Schweikardt, N., Christophides, V., Leroy, V. (eds.) Proceedings of 17th International Conference on Database Theory (ICDT), Athens, Greece, 24–28 March 2014, pp. 119–130. OpenProceedings.org (2014). https://doi.org/10.5441/002/icdt.2014.15

  6. Hellings, J.: Path results for context-free grammar queries on graphs. CoRR abs/1502.02242 (2015)

    Google Scholar 

  7. Kuijpers, J., Fletcher, G., Yakovets, N., Lindaaker, T.: An experimental study of context-free path query evaluation methods. In: Proceedings of the 31st International Conference on Scientific and Statistical Database Management, pp. 121–132. ACM (2019)

    Google Scholar 

  8. Medeiros, C.M., Musicante, M.A., Costa, U.S.: LL-based query answering over RDF databases. J. Comput. Lang. 51, 75–87 (2019). https://doi.org/10.1016/j.cola.2019.02.002. http://www.sciencedirect.com/science/article/pii/S1045926X18301915

    Article  Google Scholar 

  9. Miao, H., Deshpande, A.: Understanding data science lifecycle provenance via graph segmentation and summarization. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1710–1713. IEEE (2019)

    Google Scholar 

  10. Pérez, J., Arenas, M., Gutierrez, C.: nSPARQL: a navigational language for RDF. Web Semant.: Sci. Serv. Agents WWW 8(4), 255–270 (2010). https://doi.org/10.1016/j.websem.2010.01.002. http://www.sciencedirect.com/science/article/pii/S157082681000003X. Semantic Web Challenge 2009User Interaction in Semantic Web research

    Article  Google Scholar 

  11. Prud’hommeaux, E., Seaborne, A.: SPARQL query language for RDF, January 2008. http://www.w3.org/TR/rdf-sparql-query/. http://www.w3.org/TR/2008/REC-rdf-sparql-query-20080115/

  12. Santos, F.C., Costa, U.S., Musicante, M.A.: A bottom-up algorithm for answering context-free path queries in graph databases. In: Mikkonen, T., Klamma, R., Hernández, J. (eds.) ICWE 2018. LNCS, vol. 10845, pp. 225–233. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91662-0_17

    Chapter  Google Scholar 

  13. W3C: SPARQL 1.1 query language (2012). https://www.w3.org/TR/2012/PR-sparql11-query-20121108/

  14. W3C: RDF - semantics web standards (2014). https://www.w3.org/RDF/

  15. Yntema, M.: Inclusion relations among families of context-free languages. Inf. Control 10(6), 572–597 (1967). https://doi.org/10.1016/S0019-9958(67)91032-7. http://www.sciencedirect.com/science/article/pii/S0019995867910327

    Article  MATH  Google Scholar 

Download references

Acknowledgements

This work is partly supported by INES grant CNPq/465614/2014-0 (Brazil) and Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brazil (CAPES) - Finance Code 001.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ciro Medeiros .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Medeiros, C., Costa, U., Grigorev, S., Musicante, M.A. (2020). Recursive Expressions for SPARQL Property Paths. In: Bellatreche, L., et al. ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium. TPDL ADBIS 2020 2020. Communications in Computer and Information Science, vol 1260. Springer, Cham. https://doi.org/10.1007/978-3-030-55814-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-55814-7_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-55813-0

  • Online ISBN: 978-3-030-55814-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics