본문 바로가기
  • Home

The Scheme for Path-based Query Processing on the Semantic Data

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2009, 14(10), pp.31-41
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

김연희 1 김지현 2

1부천대학교
2서일대학

Accredited

ABSTRACT

In the Semantic Web, it is possible to provide intelligent information retrieval and automated web services by defining a concept of information resource and representing a semantic relation between resources with metadata and ontology. It is very important to manage semantic data such as ontology and metadata efficiently for implementing essential functions of the Semantic Web. Thus we propose an index structure to support more accurate search results and efficient query processing by considering semantic and structural features of the semantic data. Especially we use a graph data model to express semantic and structural features of the semantic data and process various type of queries by using graph model based path expressions. In this paper the proposed index aims to distinguish our approach from earlier studies and involve the concept of the Semantic Web in its entirety by querying on primarily extracted structural path information and secondary extracted one through semantic inferences with ontology. In the experiments, we show that our approach is more accurate and efficient than the previous approaches and can be applicable to various applications in the Semantic Web.

Citation status

* References for papers published after 2023 are currently being built.