June 2, 2011
Conference Paper

High Performance Descriptive Semantic Analysis of Semantic Graph Databases

Abstract

As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to understand their inherent semantic structure, whether codified in explicit ontologies or not. Our group is researching novel methods for what we call {\em descriptive semantic analysis} of RDF triplestores, to serve purposes of analysis, interpretation, visualization, and optimization. But data size and computational complexity makes it increasingly necessary to bring high performance computational resources to bear on this task. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multi-threaded architecture of the Cray XMT platform, conventional servers, and large data stores. In this paper we describe that architecture and our methods, and present the results of our analyses of basic properties, connected components, namespace interaction, and typed paths such for the Billion Triple Challenge 2010 dataset.

Revised: December 2, 2011 | Published: June 2, 2011

Citation

Joslyn C.A., R.D. Adolf, S. al-Saffar, J.T. Feo, D.J. Haglin, G.E. Mackey, and D.W. Mizell. 2011. High Performance Descriptive Semantic Analysis of Semantic Graph Databases. In Proceedings of the 1st High Performance Computing for the Semantic Web (HPCSW 2011), collocated with the 8th Extended Semantic Web Conference (ESWC 2011), May 29-30, 2011, Heraklion, Greece, edited by J Weaver, et al, 736. Aachen:Sun SITE, Informatik V, RWTH Aachen. PNNL-SA-78284.