Load Balanced Semantic Aware Distributed RDF Graph

Abstract

Modern day application development requires efficient management of huge RDF data. The major approaches for RDF data management are Relational and Graph based techniques. As the relational approach suffers from query joins, we propose a semantic aware graph based partitioning method. The partitioned fragments are further allocated in a load balanced way. For efficient query processing, partial replication is implemented. It reduces Inter node Communication thereby accelerating queries on distributed RDF Graph. This approach has been demonstrated in two phases partitioning and Distribution of Linked Observation Data (LOD). The time complexity for partitioning and distribution of Load Balanced Semantic Aware RDF Graph (LBSD) is O(n) where n is the number of triples which is demonstrated by linear increment in algorithm execution time (AET) for LOD data scaled from 1x to 5x. LBSD has been found to behave well till 4x. LBSD is compared with the state of the art relational and graph-based partitioning techniques. LBSD records 71% QET gain when averaged over all the four query types. For most frequent query types, Linear and Star, on an average 65% QET gain is recorded over original configuration for scaling experiments. The optimal replication level has been found to be 12% of original data.