A Graph Representative Structurefor Efficient Querying

Abstract

Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph data, it has become more and more demanding to efficiently process graph queries. Querying graph data is costly since it involves exhausted graph isomorphism testing. In Ph.D research work, we propose a graph representation and querying approach. There are 2 main phases in our approach: code generation phase and query phase. In this paper, an efficient graph representative structure that is generated by code generation phase is presented. In code generation phase, there are two main processes: preprocessing of graph data and code generation. Our proposed graph representative structure is called graph code.Edge dictionary is efficiently used to narrow down the search space of graph codes. To generate graph code, edge dictionary and adjacent edge information are used.Our experiment also shows that for storage space required by our graph code is smaller than other formats such as XML file and image file.