RAPID: Enabling scalable ad-hoc analytics on the semantic Web

16Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

As the amount of available RDF data continues to increase steadily, there is growing interest in developing efficient methods for analyzing such data. While recent efforts have focused on developing efficient methods for traditional data processing, analytical processing which typically involves more complex queries has received much less attention. The use of cost effective parallelization techniques such as Google's Map-Reduce offer significant promise for achieving Web scale analytics. However, currently available implementations are designed for simple data processing on structured data. In this paper, we present a language, RAPID, for scalable ad-hoc analytical processing of RDF data on Map-Reduce frameworks. It builds on Yahoo's Pig Latin by introducing primitives based on a specialized join operator, the MD-join, for expressing analytical tasks in a manner that is more amenable to parallel processing, as well as primitives for coping with semi-structured nature of RDF data. Experimental evaluation results demonstrate significant performance improvements for analytical processing of RDF data over existing Map-Reduce based techniques. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Sridhar, R., Ravindra, P., & Anyanwu, K. (2009). RAPID: Enabling scalable ad-hoc analytics on the semantic Web. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5823 LNCS, pp. 715–730). Springer Verlag. https://doi.org/10.1007/978-3-642-04930-9_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free