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:
- Issue Date:
- Research Org.:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1246888
- Patent Number(s):
- 9,311,731
- Application Number:
- 14/570,073
- Assignee:
- Cray Inc. (Seattle, WA)
- Resource Type:
- Patent
- Resource Relation:
- Patent File Date: 2014 Dec 15
- 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., 2016.
Web.
Mizell, David. Dynamic graph system for a semantic database. United States.
Mizell, David. Tue .
"Dynamic graph system for a semantic database". United States. https://www.osti.gov/servlets/purl/1246888.
@article{osti_1246888,
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 = {2016},
month = {4}
}
Works referenced in this record:
The Combinatorial BLAS: design, implementation, and applications
journal, May 2011
- Buluç, Aydın; Gilbert, John R.
- The International Journal of High Performance Computing Applications, Vol. 25, Issue 4
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
conference, December 2013
- Lugowski, Adam; Alber, David; Buluç, Aydm
- Proceedings of the 2012 SIAM International Conference on Data Mining
Scalable complex graph analysis with the knowledge discovery toolbox
conference, March 2012
- Lugowski, Adam; Buluc, Aydin; Gilbert, John R.
- ICASSP 2012 - 2012 IEEE International Conference on Acoustics, Speech and Signal Processing, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)