UCSY's Research Repository

A Graph Representative Structurefor Efficient Querying

Show simple item record

dc.contributor.author Hlaing, Yu Wai
dc.contributor.author Oo, Kyaw May
dc.date.accessioned 2019-07-03T03:10:20Z
dc.date.available 2019-07-03T03:10:20Z
dc.date.issued 2015-02-05
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/124
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Thirteenth International Conferences on Computer Applications(ICCA 2015) en_US
dc.title A Graph Representative Structurefor Efficient Querying en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account