• Aucun résultat trouvé

Achieving Ontology-Assisted Query of Graph Databases

N/A
N/A
Protected

Academic year: 2022

Partager "Achieving Ontology-Assisted Query of Graph Databases"

Copied!
2
0
0

Texte intégral

(1)

Achieving Ontology-Assisted Query of Graph Databases

David Silberberg, Wayne Bethea, Dennis Patrone, Paul Frank, David Patrone, John Gersh, Elisabeth Immer

Johns Hopkins University Applied Physics Laboratory 11100 Johns Hopkins Road

Laurel, MD 20723-6099

Abstract

We describe an approach for enabling ontology-assisted queries onto existing schema-based graph database systems without altering the graph query language or the corresponding graph database system. Typical schema-based graph database systems enable analysts to formulate queries using terms from a schema. Our approach enables analysts to formulate queries using terms from a virtual schema, which is composed of an ontology, a graph schema, and mappings between them. A software system can then assist the analyst by extracting the predicates and terms from queries, and in conjunction with the ontology and a reasoner, produce a set of corresponding graph queries that contain only terms from the graph schema. These queries are then sent to the graph database for evaluation. This approach enables intelligence analysts to focus on analysis that is more complex while the ontology-assisted query capability performs lower level reasoning. A distinction is maintained between the ontology reasoning and graph query systems to 1) take advantage of the performance of graph query engines while exploiting the semantics of the ontologies, 2) provide multiple analysts with an explicit and consistent semantic model of the graph data, and 3) enable multiple analysts with different semantic models of the data to use their own personal ontologies for analysis.

PLEASE NOTE:

PERMISSION TO PUBLISH THIS PAPER HAS NOT BEEN GRANTED AS OF THE TIME OF PRINTING OF PROCEEDINGS.

Ontology for the Intelligence Community (OIC-2007) November 28-29, 2007 · Columbia, Maryland Ontology for the Intelligence Community (OIC-2007) November 28-29, 2007 · Columbia, Maryland

53

(2)

 

54

Références

Documents relatifs

The current paper presents an extension to the EMF-IncQuery model query tool that lets users point out, using familiar concrete syntax, an example of what the query results should

After this transformation, NµSMV verifies the correctness of the model written in NµSMV language with temporal logic in order to verify the consistency of the

In this paper, based on SPARQL CONSTRUCT query, we present a new query form called SPARQL Analyze Query, which inte- grates graph analytics with graph querying.. SPARQL Analyze

We will present the mv-index, a novel indexing structure that allows for fast containment checking between a single RDF-conjunctive query and an arbitrary number of stored queries..

Not only has the state of the art in database query processing reached a level where doing IR as database queries is not unimagin- able, advancing retrieval effectiveness has

In this paper, we presented two approaches to predicting, whether alignment statements need to change after an ontology update: a two-step approach that consists of

More precisely, we have theoretical, practical, and socio- technological difficulties such as how to understand the subsumption concept described in RDF Semantics [2] with respect

first, an occurrence time for the batch is selected uniformly at randomly from the id of queries; then, a type uniformly selected from {ADD, DEL, UA, UR}, a graph uniformly