A Scalable Scheme for Bulk Loading Large RDF Graphs into Oracle

Author

Das, Souripriya ; Chong, Eugene Inseok ; Wu, Zhe ; Annamalai, Melliyal ; Srinivasan, Jagannathan

Author_Institution

Oracle, Nashua, NH

fYear

2008

fDate

7-12 April 2008

Firstpage

1297

Lastpage

1306

Abstract

The growth of RDF data makes it imperative that an efficient mechanism for bulk-loading RDF graphs be supported. Thus, the paper proposes a bulk-load scheme that allows fast loading of arbitrarily large RDF graphs into a database. Specifically, three modes of load are supported: i) loading into an empty RDF graph, ii) appending to a non-empty RDF graph, and iii) concurrent loads into multiple graphs. The bulk-load scheme is implemented as part of Oracle database semantic technologies and the performance experiments conducted with a variety of RDF graphs (from UniProt and synthesized data of Lehigh University Benchmark) demonstrate the scalability of the approach. The paper outlines the challenges involved in bulk- loading of large RDF graphs, describes the bulk-load scheme, discusses its implementation, and presents a performance study.

Keywords

file organisation; graph theory; knowledge representation; relational databases; semantic Web; Oracle database semantic technologies; RDF graph bulk-loading; hash function; normalized relational representation; relational database; semantic Web applications; Computer languages; Data models; Database languages; Intrusion detection; OWL; Pattern matching; Query processing; Resource description framework; Scalability; Semantic Web;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on

Conference_Location

Cancun

Print_ISBN

978-1-4244-1836-7

Electronic_ISBN

978-1-4244-1837-4

Type

conf

DOI

10.1109/ICDE.2008.4497539

Filename

4497539