Indexing and Mining of Graph Database Based on Interconnected Subgraph.

This paper proposes an efficient method for indexing and mining graph database. Most existing approaches are based on frequent sub-structures such as edges, paths, or subgraphs. However, as the size of graphs increases, such index structure grows drastically in size for avoiding performance degradation. This yields a requirement for constructing a more compact index structure and introducing more informative indexing items into this index to increase its pruning power. In this paper, we demonstrate that degree information can help solve this problem. Based on this idea, we propose a new index structure (D-index) which uses the subgraph and its degree information as the indexing item. Our empirical study shows that D-index achieves remarkable improvement in performance over the state-of-the-art approach. [ABSTRACT FROM AUTHOR]