Loading...
Thumbnail Image
Item

Storing RDF as a Graph

Abstract
RDF is the first W3C standard for enriching information resources of the Web with detailed meta data. The semantics of RDF data is defined using a RDF schema. The most expressive language for querying RDF is RQL, which enables querying of semantics. In order to support RQL, a RDF storage system has to map the RDF graph model onto its storage structure. Several storage systems for RDF data have been developed, which store the RDF data as triples in a relational database. To evaluate an RQL query on those triple structures, the graph model has to be rebuilt from the triples. In this paper, we presented a new approach to store RDF data as a graph in a object-oriented database. Our approach avoids the costly rebuilding of the graph and efficiently queries the storage structure directly. The advantages of our approach have been shown by performance test on our prototype implementation OO-Store.
Type
Conference Contribution
Type of thesis
Series
Citation
Bönström, V., Hinze, A. & Schweppe, H. (2003). Storing RDF as a Graph. In Proceedings of the First Conference on Latin American Web Congress, November 10-12, 2003(pp. 27-36). Washington: IEEE Computer Society.
Date
2003
Publisher
IEEE Computer Society, Washington, DC, USA
Degree
Supervisors
Rights
This article has been published in the Proceedings of the First Conference on Latin American Web Congress, November 10-12, 2003. Copyright © 2008 IEEE Computer Society.