Vectorization of Structure to Index Graph Databases.
Srinath Srinivas, Sumit Acharya, Himanshu Agrawal, Rajat Khare · 2002
Abstract This paper addresses the problem of retrieval from graphdatabases. Graph databases store graph structures in-stead of tables. Typically, graph databases are appli-cable in domains that require storage and retrieval ofstructural information. One of the main issues in graphdatabases is retrieval of member graphs based on struc-ture matching. Structure matching of graphs is a knownNP-completeproblem. In graph databases, this is com-pounded by the fact that structure matching has to be per-formed against a large number of graphs in the database.This paper addresses graph databases as a domain in-dependent concept. They are shown to be defined by aproperty of dominance of either structure over attributesor vice versa. Retrieval from structure dominated graphdatabases are much more difficult than retrieval from at-tribute dominated graph databases. The paper also pro-poses a concept called “structure vectorization” for re-trieval for indexing and retrieval from structure domi-nated graph databases.Keywords: Graph databases, Architecture, Struc-ture vectorization, Information retrieval