Efficient Parallel Dictionary Encoding for RDF Data
Refereed Conference Meeting Proceeding
he 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.
17th International Workshop on the Web and Databases
Proc. 17th International Workshop on the Web and Databases (WebDB'14
Digital Object Identifer (DOI):
United States of America
Open access repository: