Scalable Semantics – The Silver Lining of Cloud Computing
- 1 December 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-118
Abstract
Semantic inferencing and querying across large-scale RDF triple stores is notoriously slow. Our objective is to expedite this process by employing Google's MapReduce framework to implement scale-out distributed querying and reasoning. This approach requires RDF graphs to be decomposed into smaller units that are distributed across computational nodes. RDF Molecules appear to offer an ideal approach - providing an intermediate level of granularity between RDF graphs and triples. However, the original RDF molecule definition has inherent limitations that will adversely affect performance. In this paper, we propose a number of extensions to RDF molecules (hierarchy and ordering) to overcome these limitations. We then present some implementation details for our MapReduce-based RDF molecule store. Finally we evaluate the benefits of our approach in the context of the Bio-MANTA project - an application that requires integration and querying across large-scale protein-protein interaction datasets.Keywords
This publication has 14 references indexed in Scilit:
- Social Meaning on the Web: From Wittgenstein to Search EnginesIEEE Intelligent Systems, 2009
- Pig latin2008
- Annotating Relationships Between Multiple Mixed-Media Digital Objects by Extending AnnoteaLecture Notes in Computer Science, 2007
- Scalability of the Nutch search engine2007
- Map-reduce-merge2007
- Advancing translational research with the Semantic WebBMC Bioinformatics, 2007
- Applying Semantic Web Technologies to Drug Safety DeterminationIEEE Intelligent Systems, 2006
- Named graphs, provenance and trust2005
- Signing individual fragments of an RDF graph2005
- Jena: a semantic Web toolkitIEEE Internet Computing, 2002