BRAHMS: A WorkBench RDF Store and High Performance Memory System for Semantic Association Discovery

Discovery of semantic associations in Semantic Web ontologies is an important task in various analytical activities. Several query languages and storage systems have been designed and implemented for storage and retrieval of information in RDF ontologies. However, they are inadequate for semantic association discovery. In this paper we present the design and implementation of BRAHMS, an efficient RDF storage system, specifically designed to support fast semantic association discovery in large RDF bases. We present memory usage and timing results of several tests performed with BRAHMS and compare them to similar tests performed using Jena, Sesame, and Redland, three of the well-known RDF storage systems. Our results show that BRAHMS handles basic association discovery well, while the RDF query languages and even the low-level APIs in the other three tested systems are not suitable for the implementation of semantic association discovery algorithms.

[1]  Dave J. Beckett,et al.  The design and implementation of the redland RDF application framework , 2001, WWW '01.

[2]  Brian McBride,et al.  Jena: Implementing the RDF Model and Syntax Specification , 2001, SemWeb.

[3]  Vassilis Christophides,et al.  RQL: a declarative query language for RDF , 2002, WWW.

[4]  Frank van Harmelen,et al.  Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema , 2002, SEMWEB.

[5]  Amit P. Sheth,et al.  Semantic Association Identification and Knowledge Discovery for National Security Applications , 2005, J. Database Manag..

[6]  Jeff Heflin,et al.  An Evaluation of Knowledge Base Systems for Large OWL Datasets , 2004, SEMWEB.

[7]  Jeffrey M. Bradshaw,et al.  Applying KAoS Services to Ensure Policy Compliance for Semantic Web Services Workflow Composition and Enactment , 2004, SEMWEB.

[8]  Claudio Gutiérrez,et al.  Querying RDF Data from a Graph Database Perspective , 2005, ESWC.

[9]  Valdis E. Krebs,et al.  Mapping Networks of Terrorist Cells , 2001 .

[10]  Amit P. Sheth,et al.  An Ontological Approach to the Document Access Problem of Insider Threat , 2005, ISI.

[11]  Amit P. Sheth,et al.  SWETO: Large-Scale Semantic Web Test-bed , 2004 .

[12]  Vipul Kashyap,et al.  Relationships at the Heart of Semantic Web: Modeling, Discovering, and Exploiting Complex Semantic Relationships , 2004 .

[13]  Amit P. Sheth,et al.  Discovering and Ranking Semantic Associations over a Large RDF Metabase , 2004, VLDB.

[14]  Andy Seaborne,et al.  Three Implementations of SquishQL, a Simple RDF Query Language , 2002, SEMWEB.

[15]  Steffen Staab,et al.  04391 Executive Summary -- Semantic Interoperability and Integration , 2005 .

[16]  Serge Abiteboul,et al.  Regular path queries with constraints , 1997, J. Comput. Syst. Sci..

[17]  Amit P. Sheth.  From Semantic Search & Integration to Analytics , 2005, Semantic Interoperability and Integration.

[18]  Amit P. Sheth,et al.  Discovering Informative Subgraphs in RDF Graphs , 2005 .

[19]  Amit P. Sheth,et al.  Ρ-Queries: enabling querying for semantic associations on the semantic web , 2003, WWW '03.

[20]  Enrico Motta,et al.  The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6-10, 2005, Proceedings , 2005, SEMWEB.

[21]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[22]  James A. Hendler,et al.  The Semantic Web — ISWC 2002 , 2002, Lecture Notes in Computer Science.