UCSY's Research Repository

GCTrie for Efficient Querying in Cheminformatics

Show simple item record

dc.contributor.author Hlaing, Yu Wai
dc.contributor.author Oo, Kyaw May
dc.date.accessioned 2019-08-09T07:48:31Z
dc.date.available 2019-08-09T07:48:31Z
dc.date.issued 2015-12
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1987
dc.description.abstract The field of graph indexing and query processing has received a lot of attention due to the constantly increasing usage of graph data structures for representing data in different application domains. To support efficient querying technique is a key issue in all graph based application. In this paper, we propose an index trie structure (GCTrie) that is constructed with our proposed graph representative structure called graph code. Our proposed GCtrie can support all types of graph query. In this paper, we focus on index construction, subgraph query and supergraph query processing. The experimental results and comparisons offer a positive response to the proposed approach. en_US
dc.language.iso en en_US
dc.publisher International Journal of Computer Science and Information Security (IJCSIS) en_US
dc.relation.ispartofseries ;Vol 13, No.12, pp.11-16
dc.subject graph indexing and querying en_US
dc.subject graph representative structure en_US
dc.subject index en_US
dc.subject subgraph query en_US
dc.subject supergraph query en_US
dc.title GCTrie for Efficient Querying in Cheminformatics 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