Next Article in Journal
A Greedy Algorithm for Neighborhood Overlap-Based Community Detection
Next Article in Special Issue
Algorithms for Managing, Querying and Processing Big Data in Cloud Environments
Previous Article in Journal
Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows
Previous Article in Special Issue
A Data Analytic Algorithm for Managing, Querying, and Processing Uncertain Big Data in Cloud Environments
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(1), 7; doi:10.3390/a9010007

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

1
DIA Department, University of Trieste and ICAR-CNR, Trieste 34127, Italy
2
Department of Computer Science, University of Craiova, Craiova 200585, Romania
3
Dipartimento di Informatica e Automazione, Universit√° Roma Tre, Rome 00146, Italy
*
Author to whom correspondence should be addressed.
Academic Editor: Bruno Carpentieri
Received: 2 September 2015 / Revised: 30 December 2015 / Accepted: 4 January 2016 / Published: 11 January 2016
View Full-Text   |   Download PDF [2170 KB, uploaded 12 January 2016]   |  

Abstract

Nowadays, a leading instance of big data is represented by Web data that lead to the definition of so-called big Web data. Indeed, extending beyond to a large number of critical applications (e.g., Web advertisement), these data expose several characteristics that clearly adhere to the well-known 3V properties (i.e., volume, velocity, variety). Resource Description Framework (RDF) is a significant formalism and language for the so-called Semantic Web, due to the fact that a very wide family of Web entities can be naturally modeled in a graph-shaped manner. In this context, RDF graphs play a first-class role, because they are widely used in the context of modern Web applications and systems, including the emerging context of social networks. When RDF graphs are defined on top of big (Web) data, they lead to the so-called large-scale RDF graphs, which reasonably populate the next-generation Semantic Web. In order to process such kind of big data, MapReduce, an open source computational framework specifically tailored to big data processing, has emerged during the last years as the reference implementation for this critical setting. In line with this trend, in this paper, we present an approach for efficiently implementing traversals of large-scale RDF graphs over MapReduce that is based on the Breadth First Search (BFS) strategy for visiting (RDF) graphs to be decomposed and processed according to the MapReduce framework. We demonstrate how such implementation speeds-up the analysis of RDF graphs with respect to competitor approaches. Experimental results clearly support our contributions. View Full-Text
Keywords: MapReduce algorithms; BFS-traversals of RDF graphs; effective and efficient algorithms for big data processing MapReduce algorithms; BFS-traversals of RDF graphs; effective and efficient algorithms for big data processing
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Cuzzocrea, A.; Cosulschi, M.; de Virgilio, R. An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs. Algorithms 2016, 9, 7.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top