Title: Discovery of semantic associations in an RDF graph using bi-directional BFS on massively parallel hardware

Authors: V. Viswanathan

Addresses: School of Computing Science and Engineering, VIT University, Chennai Campus, Chennai – 600127, India

Abstract: Resource description framework (RDF) data model provides a framework to capture the meaning of an entity by specifying how it relates to other entities. Large RDF graph involving millions of entities are common in many semantic graph applications and are challenging to process. For example, finding complex relationships called semantic associations between two entities in an RDF graph is a tedious process. Graphics processing units (GPUs) provides high computation power at low price. Today, the GPUs expose a general data-parallel programming model in the form of CUDA. In this paper, we present the implementation of bi-directional breadth-first-search algorithm to discover the semantic association in RDF graph using CUDA programming model. In the experimental evaluation, we prove that our proposed algorithm is faster than the existing algorithms.

Keywords: semantic web; semantic associations; resource description framework; RDF graphs; CUDA; bi-directional BFS; breadth first search; massively parallel hardware.

DOI: 10.1504/IJBDI.2016.078399

International Journal of Big Data Intelligence, 2016 Vol.3 No.3, pp.176 - 181

Available online: 10 Aug 2016

Full-text access for editors Access for subscribers Purchase this article Comment on this article