Storage and Retrieval of Large RDF Graph Using Hadoop and MapReduce

  • Mohammad Farhan Husain
  • Pankil Doshi
  • Latifur Khan
  • Bhavani Thuraisingham
Conference paper

DOI: 10.1007/978-3-642-10665-1_72

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5931)
Cite this paper as:
Farhan Husain M., Doshi P., Khan L., Thuraisingham B. (2009) Storage and Retrieval of Large RDF Graph Using Hadoop and MapReduce. In: Jaatun M.G., Zhao G., Rong C. (eds) Cloud Computing. CloudCom 2009. Lecture Notes in Computer Science, vol 5931. Springer, Berlin, Heidelberg

Abstract

Handling huge amount of data scalably is a matter of concern for a long time. Same is true for semantic web data. Current semantic web frameworks lack this ability. In this paper, we describe a framework that we built using Hadoop to store and retrieve large number of RDF triples. We describe our schema to store RDF data in Hadoop Distribute File System. We also present our algorithms to answer a SPARQL query. We make use of Hadoop’s MapReduce framework to actually answer the queries. Our results reveal that we can store huge amount of semantic web data in Hadoop clusters built mostly by cheap commodity class hardware and still can answer queries fast enough. We conclude that ours is a scalable framework, able to handle large amount of RDF data efficiently.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Mohammad Farhan Husain
    • 1
  • Pankil Doshi
    • 1
  • Latifur Khan
    • 1
  • Bhavani Thuraisingham
    • 1
  1. 1.University of Texas at DallasDallasUSA

Personalised recommendations