2026-05-01T09:30:22Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/4241 2021-12-13T01:33:56Z 1582963302567:1597824175385 user-ucsy

Graph Code Based Isomorphism Query on Graph Data Hlaing, Yu Wai Oo, Kyaw May The field of graph datasets and graph queryprocessing has received a lot of attention due to constantlyincreasing usage of graph data structures for representing datain different domains. Storing the graph in large dataset is achallenging task as it deals with efficient space and timemanagement. To ensure the consistency of graph dataset, one ofthe necessary procedures required is a mechanism to checkswhether two graphs are automorphic or not. Given a graphquery, it is also desirable to query isomorphic graphs quickly andefficiently from a large dataset via its index. In this paper, wepropose a graph isomorphism querying approach that based ongraph code. Graph code is a graph representative structure thatcan preserve the structural information of the original graph.Graph isomorphism query can be efficiently processed via triethat is constructed on graph codes of the data graphs. Theexperimental results and comparisons offer a positive response tothe proposed approach. 2015 http://hdl.handle.net/20.500.12678/0000004241 https://meral.edu.mm/records/4241