[PDF][PDF] A database for storage and fast retrieval of structure data: a demonstration
S Kumar, S Srinivasa - PROCEEDINGS OF THE INTERNATIONAL …, 2003 - researchgate.net
This demonstration presents a database system called GRACE for storage and retrieval of
graph structures. Structural queries are supported which retrieve graphs based on
approximate subgraph isomorphism. Since subgraph isomorphism is NP-complete, GRACE
performs retrieval based on inexact graph matching. The underlying model is of a concept
called “Vectorization of Structure” that represents structural features of member graphs as
vectors in one or more hypothetical spaces. Queries are mapped onto regions in these …
graph structures. Structural queries are supported which retrieve graphs based on
approximate subgraph isomorphism. Since subgraph isomorphism is NP-complete, GRACE
performs retrieval based on inexact graph matching. The underlying model is of a concept
called “Vectorization of Structure” that represents structural features of member graphs as
vectors in one or more hypothetical spaces. Queries are mapped onto regions in these …
[PDF][PDF] A database for storage and fast retrieval of structure data: A demonstration
S Srinivasa - academia.edu
This demonstration presents a database system called GRACE for storage and retrieval of
graph structures. Structural queries are supported which retrieve graphs based on
approximate subgraph isomorphism. Since subgraph isomorphism is NP-complete, GRACE
performs retrieval based on inexact graph matching. The underlying model is of a concept
called “Vectorization of Structure” that represents structural features of member graphs as
vectors in one or more hypothetical spaces. Queries are mapped onto regions in these …
graph structures. Structural queries are supported which retrieve graphs based on
approximate subgraph isomorphism. Since subgraph isomorphism is NP-complete, GRACE
performs retrieval based on inexact graph matching. The underlying model is of a concept
called “Vectorization of Structure” that represents structural features of member graphs as
vectors in one or more hypothetical spaces. Queries are mapped onto regions in these …
Showing the best results for this search. See all results