Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
Proceedings of the 17th international conference on World Wide Web
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
Bridging query languages in semantic and graph technologies
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
A RPL through RDF: expressive navigation in RDF graphs
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Datalog relaunched: simulation unification and value invention
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
| Hi-index | 0.02 |
Path query languages have been previously shown to complement RDF rule languages in a natural way and have been used as a means to implement the RDFS derivation rules. RPL is a novel path query language specifically designed to be incorporated with RDF rules and comes in three flavors: Node -, edge - and path -flavored expressions allow to express conditional regular expressions over the nodes, edges, or nodes and edges appearing on paths within RDF graphs. Providing regular string expressions and negation, RPL is more expressive than other RDF path languages that have been proposed. We give a compositional semantics for RPL and show that it can be evaluated efficiently, while several possible extensions of it cannot.