Skip to main content
Article
A Distributed Graph Approach for Pre-processing Linked RDF Data Using Supercomputers
International Workshop on Semantic Big Data 2017 (SBD 2017)
  • Michael J Lewis, The University of Illinois at Chicago
  • George K. Thiruvathukal, Loyola University Chicago
  • Venkatram Vishwanath, Argonne National Laboratory
  • Michael J Papka, Argonne National Laboratory and Northern Illinois University
  • Andrew Johnson, The University of Illinois at Chicago
Document Type
Conference Proceeding
Publication Date
5-19-2017
Disciplines
Abstract
Efficient RDF, graph based queries are becoming more pertinent based on the increased interest in data analytics and its intersection with large, unstructured but connected data. Many commercial systems have adopted distributed RDF graph systems in order to handle increasing dataset sizes and complex queries. This paper introduces a distribute graph approach to pre-processing linked data. Instead of traversing the memory graph, our system indexes pre-processed join elements that are organized in a graph structure. We analyze the Dbpedia data-set (derived from the Wikipedia corpus) and compare our access method to the graph traversal access approach which we also devise. Results show from our experiments that the distributed, pre-processed graph approach to accessing linked data is faster than the traversal approach over a specific range of linked queries.
Citation Information
Michael J. Lewis, George K. Thiruvathukal, Venkatram Vishwanath, Michael E. Papka, and Andrew Johnson, A Distributed Graph Approach for Pre-Processing Linked Data Using Supercomputers, In Proceedings of International Workshop on Semantic Big Data 2017 (SBD 2017) at ACM SIGMOD 2017.