A Scalable Scheme for Bulk Loading Large RDF Graphs into Oracle

  • Authors:
  • Souripriya Das;Eugene Inseok Chong;Zhe Wu;Melliyal Annamalai;Jagannathan Srinivasan

  • Affiliations:
  • Oracle, 1 Oracle Drive, Nashua, NH 03062, USA. Souripriya.Das@oracle.com;Oracle, 1 Oracle Drive, Nashua, NH 03062, USA. Eugene.Chong@oracle.com;Oracle, 1 Oracle Drive, Nashua, NH 03062, USA. Alan.Wu@oracle.com;Oracle, 1 Oracle Drive, Nashua, NH 03062, USA. Melliyal.Annamalai@oracle.com;Oracle, 1 Oracle Drive, Nashua, NH 03062, USA. Jagannathan.Srinivasan@oracle.com

  • Venue:
  • ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.