SPARQ2L: towards support for subgraph extraction queries in rdf databases
Proceedings of the 16th international conference on World Wide Web
Product Life-Cycle Metadata Modeling and Its Application with RDF
IEEE Transactions on Knowledge and Data Engineering
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
An Experimental Comparison of RDF Data Management Approaches in a SPARQL Benchmark Scenario
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
SW-Store: a vertically partitioned DBMS for Semantic Web data management
The VLDB Journal — The International Journal on Very Large Data Bases
MashUp web data sources and services based on semantic queries
Information Systems
gStore: answering SPARQL queries via subgraph matching
Proceedings of the VLDB Endowment
Object modeling of RDF schema for converting UML class diagram
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
FlexTable: using a dynamic relation model to store RDF data
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
A distributed graph engine for web scale RDF data
Proceedings of the VLDB Endowment
TripleBit: a fast and compact system for large scale RDF data
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
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.