RDF packages: a scheme for efficient reasoning and querying over large-scale RDF data

  • Authors:
  • Shohei Ohsawa;Toshiyuki Amagasa;Hiroyuki Kitagawa

  • Affiliations:
  • University of Tsukuba, Japan;University of Tsukuba, Japan;University of Tsukuba, Japan

  • Venue:
  • Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

When querying RDF and RDFS data, for improving the performance, it is common to derive all triples according to RDFS entailment rules before query processing. An undesirable drawback of this approach is that a large number of triples are generated by the RDFS reasoning, and hence considerable amount of storage space is required if we materialize the RDFS closure. In this paper, we propose RDF packages, which is a time and space efficient format for RDF data. In an RDF package, a set of triples of the same class or triples having the same predicate are grouped into a dedicated node named Package. Using Packages, we can represent any metadata that can be expressed by RDF. An important feature of the RDF packages is that, when performing RDFS reasoning, the same rules can be applied without any modification, thereby allowing us to use existing RDFS reasoners. In this paper, we discuss the model of RDF packages and its rules, followed by the transformation between RDF and RDF packages. We also discuss the implementation RDF packages using an existing RDF framework. Finally, we demonstrate the performance of the proposed scheme in triple size, reasoning speed, and querying speed.