Searching Semantic Relation Paths Using an RDF Digraph Retrieval Model

Author

Zhang, Wenping ; Deng, Zhonghua

fYear

2012

fDate

19-22 Oct. 2012

Firstpage

486

Lastpage

490

Abstract

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.

Keywords

automatic repeat request; query languages; query processing; resource allocation; ARQ engine; RDF data searching; RDF digraph retrieval model; SPARQL query; iterator model; new query pattern; resource description framework; semantic relation path search; Algebra; Algorithm design and analysis; Automatic repeat request; Data models; Resource description framework; Semantics; Sorting; ARQ extension; RDF digraph retrieval model; RDF triples; SPARQL extension; semantic relation retrieval;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing and Applications to Business, Engineering & Science (DCABES), 2012 11th International Symposium on

Conference_Location

Guilin

Print_ISBN

978-1-4673-2630-8

Type

conf

DOI

10.1109/DCABES.2012.41

Filename

6385337