Finding regular simple paths in graph databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The design and implementation of the redland RDF application framework
Proceedings of the 10th international conference on World Wide Web
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
Three Implementations of SquishQL, a Simple RDF Query Language
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Ρ-Queries: enabling querying for semantic associations on the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Discovering and ranking semantic associations over a Large RDF metabase
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Querying RDF data from a graph database perspective
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
An ontological approach to the document access problem of insider threat
ISI'05 Proceedings of the 2005 IEEE international conference on Intelligence and Security Informatics
Proceedings of the 15th international conference on World Wide Web
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Proceedings of the 16th international conference on World Wide Web
RDF data exploration and visualization
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
ACM Transactions on the Web (TWEB)
SPARQLeR: Extended Sparql for Semantic Association Discovery
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Exploring large readable and interactive RDF graphs
HSI'09 Proceedings of the 2nd conference on Human System Interactions
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
Proceedings of the 19th international conference on World wide web
Glycobrowser: a tool for contextual visualization of biological data and pathways using ontologies
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
RDFBroker: a signature-based high-performance RDF store
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Semantic analytics visualization
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
SemanticSpy: suspect tracking using semantic data in a multimedia environment
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
A framework for evaluating and ranking ontologies
International Journal of Metadata, Semantics and Ontologies
TripleBit: a fast and compact system for large scale RDF data
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
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.