Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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 ll-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.#R##N##R##N# demonstrate the por, ease, and efficiency of RPL with two applications on top of the RPL b interface. The demonstrator implements RPL by transformation to extended nested regular expressions (NREs). For these extended NREs  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.
['Harald Zauner', 'Benedikt Linse', 'Tim Furche', 'François Bry']
I am writing a research paper on a idea A RPL through RDF: expressive navigation in RDF graphs
[{"from": "human", "value": "I am writing a research paper on a idea A RPL through RDF: expressive navigation in RDF graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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 ll-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.#R##N##R##N# demonstrate the por, ease, and efficiency of RPL with two applications on top of the RPL b interface. The demonstrator implements RPL by transformation to extended nested regular expressions (NREs). For these extended NREs  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."}]