본문 바로가기
  • Home

Processing of ρ-intersect Operation on RDF DataUsing Suffix Array

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2011, 16(7), pp.95-104
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sung Wan Kim 1 김연희 2

1삼육대학교
2부천대학

Accredited

ABSTRACT

The actual utilization of Semantic Web technology which aims to provide more intelligent and automated service for information retrieval over the Web becomes gradually reality. RDF is widely used as the one of standard formats to present and manage the voluminous data on the Web. Efficient query processing on RDF data, therefore, is one of the ongoing research topics. Retrieving resources having a specific association from a given resource is the typical query processing type and several researches for this have done. However the most of previous researches have not fully considered discovering the complex relationship among resources such as returning the association between resources as the query processing result. This paper introduces the indexing and query processing for ρ-intersect operation which is one of the semantic association retrieval types. It includes an indexing scheme using suffix array and optimal processing approaches for handling ρ-intersect operation. The experimental evaluations shows that the average execution times for the proposed approach is 3~7 times faster than the previous approach.

Citation status

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