skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Dynamic graph system for a semantic database

Abstract

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

Inventors:
Publication Date:
Research Org.:
Cray Inc, Seattle, WA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1168730
Patent Number(s):
8,943,068
Application Number:
13/777,884
Assignee:
Cray Inc (Seattle, WA) PNNL
Resource Type:
Patent
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

Mizell, David. Dynamic graph system for a semantic database. United States: N. p., 2015. Web.
Mizell, David. Dynamic graph system for a semantic database. United States.
Mizell, David. Tue . "Dynamic graph system for a semantic database". United States. doi:. https://www.osti.gov/servlets/purl/1168730.
@article{osti_1168730,
title = {Dynamic graph system for a semantic database},
author = {Mizell, David},
abstractNote = {A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Jan 27 00:00:00 EST 2015},
month = {Tue Jan 27 00:00:00 EST 2015}
}

Patent:

Save / Share: