Graph Code Based Isomorphism Query on Graph Data

The field of graph datasets and graph query processing has received a lot of attention due to constantly increasing usage of graph data structures for representing data in different domains. Storing the graph in large dataset is a challenging task as it deals with efficient space and time management. To ensure the consistency of graph dataset, one of the necessary procedures required is a mechanism to checks whether two graphs are automorphic or not. Given a graph query, it is also desirable to query isomorphic graphs quickly and efficiently from a large dataset via its index. In this paper, we propose a graph isomorphism querying approach that based on graph code. Graph code is a graph representative structure that can preserve the structural information of the original graph. Graph isomorphism query can be efficiently processed via trie that is constructed on graph codes of the data graphs. The experimental results and comparisons offer a positive response to the proposed approach.