UCSY's Research Repository

An Efficient Indexing Mechanism for Graph Queries in Graph Databases

Show simple item record

dc.contributor.author Thaing, Aye Nwe
dc.date.accessioned 2019-07-03T04:11:22Z
dc.date.available 2019-07-03T04:11:22Z
dc.date.issued 2011-05-05
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/186
dc.description.abstract In recent years, graph has become a powerful tool for representing and modeling objects and their relationships in various application domains such as protein interactions, chemical compounds, social networks, XML documents and so on. The volume of graph data increases rapidly and the graph database becomes an essential role to store graph data. However, the performance of query processing on graph databases is still inadequate due to the high complexity of processing graph data. As a result, it is important to develop efficient indexing structure for query processing on the graph databases. In this paper, we propose both algorithms for graph indexing and subgraph isomorphism query for subgraph query processing in the graph database. We also propose a proficient index structure (AdE) to support both algorithms to quickly index and identify the isomorphic graphs for the given query graph. Like canonical code, AdE checks whether the query graph is a subgraph isomorphic to the database graph. Our proposed index structure significantly reduces the computational time complexity compared to the DGIndex structure. en_US
dc.language.iso en en_US
dc.publisher Ninth International Conference On Computer Applications (ICCA 2011) en_US
dc.subject Graph Database en_US
dc.subject Graph Decomposition en_US
dc.subject Graph Indexing en_US
dc.subject Graph Query Processing en_US
dc.subject Chemical Compound en_US
dc.title An Efficient Indexing Mechanism for Graph Queries in Graph Databases 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