Vectorization of Structure to Index Graph Databases

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

[1]  D.J. Cook,et al.  Structural mining of molecular biology data , 2001, IEEE Engineering in Medicine and Biology Magazine.

[2]  Alberto Del Bimbo,et al.  Efficient Matching and Indexing of Graph Models in Content-Based Retrieval , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Horst Bunke,et al.  Subgraph Isomorphism Detection in Polynominal Time on Preprocessed Model Graphs , 1995, ACCV.

[4]  Alfs T. Berztiss,et al.  A Backtrack Procedure for Isomorphism of Directed Graphs , 1973, JACM.

[5]  H. Agrawal,et al.  Query and Approximation A Flexible Retrieval Mechanism for Structural Data Using Multiple Vector Spaces , 2007 .

[6]  Euripides G. M. Petrakis,et al.  Similarity Searching in Medical Image Databases , 1997, IEEE Trans. Knowl. Data Eng..

[7]  D. Cook,et al.  Graph-based hierarchical conceptual clustering , 2002 .

[8]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[9]  Horst Bunke,et al.  Efficient Subgraph Isomorphism Detection: A Decomposition Approach , 2000, IEEE Trans. Knowl. Data Eng..

[10]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[11]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Thomas S. Huang,et al.  Spatial pattern discovering by learning the isomorphic subgraph from multiple attributed relation graphs , 2001, Electron. Notes Theor. Comput. Sci..

[13]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[14]  Robert J. Schalkoff,et al.  Pattern recognition - statistical, structural and neural approaches , 1991 .

[15]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Kaizhong Zhang,et al.  A System for Approximate Tree Matching , 1994, IEEE Trans. Knowl. Data Eng..