Searching Semantic Relation Paths Using an RDF Digraph Retrieval Model

In order to retrieve the semantic relations among RDF data, a new query pattern is introduced to SPARQL [1]. This paper presents the research work of extending the ARQ engine to realize the new SPARQL query in a more efficient way by using a digraph retrieval model for searching RDF data instead of the iterator model adopted by the original ARQ engine. The design and implementation of the digraph retrieval model and its application to the semantic relation retrieval are discussed in detail. With the new query pattern, many interesting semantic relations among the RDF data can be explicitly and easily enquired.