A Graph Representative Structurefor Efficient Querying

Graphs are prevalently used to model therelationships between objects in various domains. Withthe increasing usage of graph data, it has become moreand more demanding to efficiently process graphqueries. Querying graph data is costly since it involvesexhausted graph isomorphism testing. In Ph.Dresearch work, we propose a graph representation andquerying approach. There are 2 main phases in ourapproach: code generation phase and query phase. Inthis paper, an efficient graph representative structurethat is generated by code generation phase ispresented. In code generation phase, there are twomain processes: preprocessing of graph data and codegeneration. Our proposed graph representativestructure is called graph code.Edge dictionary isefficiently used to narrow down the search space ofgraph codes. To generate graph code, edge dictionaryand adjacent edge information are used.Ourexperiment also shows that for storage space requiredby our graph code is smaller than other formats suchas XML file and image file