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.
