Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Most of the recent approaches to keyword search employ graph structured representation of data. Ansrs to queries are generally sub-structures of the graph, containing one or more keywords. While finding the nodes matching keywords is relatively easy, determining the connections beten such nodes is a complex problem requiring on-the-fly time consuming graph exploration. Current techniques suffer from poorly performing worst case scenario or from indexing schemes that provide little support to the discovery of connections beten nodes.#R##N##R##N#,  present an indexing scheme for RDF that exposes the structural characteristics of the graph, its paths and the information on the reachability of nodes. This knowledge is exploited to expedite the retrieval of the substructures representing the query results. In addition, the index is organized to facilitate maintenance operations as the dataset evolves. Experimental results demonstrates the feasibility of our index that significantly improves the query execution performance.
['Paolo Cappellari', 'Roberto De Virgilio', 'Antonio Maccioni', 'Mark Roantree']
I am writing a research paper on a idea A path-oriented RDF index for keyword search query processing
[{"from": "human", "value": "I am writing a research paper on a idea A path-oriented RDF index for keyword search query processing"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Most of the recent approaches to keyword search employ graph structured representation of data. Ansrs to queries are generally sub-structures of the graph, containing one or more keywords. While finding the nodes matching keywords is relatively easy, determining the connections beten such nodes is a complex problem requiring on-the-fly time consuming graph exploration. Current techniques suffer from poorly performing worst case scenario or from indexing schemes that provide little support to the discovery of connections beten nodes.#R##N##R##N#,  present an indexing scheme for RDF that exposes the structural characteristics of the graph, its paths and the information on the reachability of nodes. This knowledge is exploited to expedite the retrieval of the substructures representing the query results. In addition, the index is organized to facilitate maintenance operations as the dataset evolves. Experimental results demonstrates the feasibility of our index that significantly improves the query execution performance."}]