A RPL through RDF: expressive navigation in RDF graphs

Authors:
Harald Zauner;Benedikt Linse;Tim Furche;François Bry
Affiliations:
Institute for Informatics, University of Munich, München, Germany;Institute for Informatics, University of Munich, München, Germany and Thomson Reuters, München, Germany;Institute for Informatics, University of Munich, München, Germany and Oxford University Computing Laboratory, Oxford, England;Institute for Informatics, University of Munich, München, Germany
Venue:
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Year:
2010

Citing 6
Cited 3

Conditional XPath

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
SPARQLeR: Extended Sparql for Semantic Association Discovery

ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
nSPARQL: A Navigational Language for RDF

ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Extending SPARQL with regular expression patterns (for querying RDF)

Web Semantics: Science, Services and Agents on the World Wide Web
The Perfect Match: RPL and RDF Rule Languages

RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Four lessons in versatility or how query languages adapt to the web

Semantic techniques for the web

RDFPath: path query processing on large RDF graphs with mapreduce

ESWC'11 Proceedings of the 8th international conference on The Semantic Web
Semantic navigation on the web of data: specification of routes, web fragments and actions

Proceedings of the 21st international conference on World Wide Web
Regular path queries on large graphs

SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.