A RPL through RDF: Expressive Navigation in RDF Graphs
RPL (pronounced “ripple”) is the most expressive path language for navigating in RDF graphs proposed to date that can still be evaluated with polynomial combined complexity. RPL is a lean language well-suited for integration into RDF rule languages. This integration enables a limited form of recursion for traversing RDF paths of unknown length at almost no additional cost over conjunctive triple patterns.
We demonstrate the power, ease, and efficiency of RPL with two applications on top of the RPL Web interface. The demonstrator implements RPL by transformation to extended nested regular expressions (NREs). For these extended NREs we have implemented an evaluation algorithm with polynomial data complexity. To the best of our knowledge, this demo is the first implementation of NREs (or similarly expressive RDF path languages) with this complexity.
Unable to display preview. Download preview PDF.
- 1.Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.: The Lorel query language for semistructured data. Int. J. on Digital Libraries 1(1) (1997)Google Scholar
- 2.Alkhateeba, F., Baget, J.-F., Euzenat, J.: Extending SPARQL with regular expression patterns. J. of Web Semantics (2009)Google Scholar
- 3.Bry, F., Furche, T., Linse, B.: The perfect match: RPL and RDF rule languages. In: RR (2009)Google Scholar
- 4.Bry, F., Furche, T., Linse, B., Pohl, A., Weinzierl, A., Yestekhina, O.: Four lessons in versatility or how query languages adapt to the web. In: Bry, F., Maluszynski, J. (eds.) Semantic Techniques for the Web, The Rewerse Perspective. LNCS, vol. 5500, pp. 50–160. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 7.Marx, M.: Conditional XPath. ACM Trans. on Database Sys. (TODS) 30(4) (2005)Google Scholar