Cheng, Long and Malik, Avinash and Kotoulas, Spyros and Ward, Tomas E. and Theodoropoulos, Georgios (2014) Efficient Parallel Dictionary Encoding for RDF Data. In: 17th International Workshop on the Web and Databases. Snowbird, Utah.

Preview

Download (182kB) | Preview

Abstract

The SemanticWeb comprises enormous volumes of semi-structured data elements. For interoperability, these elements are represented by long strings. Such representations are not efficient for the purposes of SemanticWeb applications that perform computations over large volumes of information. A typical method for alleviating the impact of this problem is through the use of compression methods that produce more compact representations of the data. The use of dictionary encoding for this purpose is particularly prevalent in Semantic Web database systems. However, centralized implementations present performance bottlenecks, giving rise to the need for scalable, efficient distributed encoding schemes. In this paper, we describe a straightforward but very efficient encoding algorithm and evaluate its performance on a cluster of up to 384 cores and datasets of up to 11 billion triples (1.9 TB). Compared to the state-of-art MapReduce algorithm, we demonstrate a speedup of 2:6 - 7:4x and excellent scalability.

Item Type:	Book Section
Keywords:	parallel dictionary encoding; rdf data; rdf;
Academic Unit:	Faculty of Science and Engineering > Computer Science Faculty of Science and Engineering > Electronic Engineering
Item ID:	9549
Depositing User:	Dr Tomas Ward
Date Deposited:	14 Jun 2018 09:17
Publisher:	Snowbird
Refereed:	Yes
URI:
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads