Graph Indexing: A Frequent Structure-based Approach

DMCA

Graph Indexing: A Frequent Structure-based Approach (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Xifeng Yan , Philip S. Yu , Jiawei Han

Citations:

200 - 25 self

BibTeX

@MISC{Yan04graphindexing:,
    author = {Xifeng Yan and Philip S. Yu and Jiawei Han},
    title = {Graph Indexing: A Frequent Structure-based Approach},
    year = {2004}
}

OpenURL

Abstract

Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is desirable to retrieve graphs quickly from a large database via graph-based indices. In this paper, we investigate the issues of indexing graphs and propose a novel solution by applying a graph mining technique. Di#erent from the existing path-based methods, our approach, called gIndex, makes use of frequent substructure as the basic indexing feature. Frequent substructures are ideal candidates since they explore the intrinsic characteristics of the data and are relatively stable to database updates. To reduce the size of index structure, two techniques, size-increasing support constraint and discriminative fragments, are introduced. Our performance study shows that gIndex has 10 times smaller index size, but achieves 3-10 times better performance in comparison with a typical path-based method, GraphGrep. The gIndex approach not only provides an elegant solution to the graph indexing problem, but also demonstrates how database indexing and query processing can benefit from data mining, especially frequent pattern mining. Furthermore, the concepts developed here can be applied to indexing sequences, trees, and other complicated structures as well.

Keyphrases

frequent structure-based approach graph indexing frequent substructure complicated structure 3-10 time basic indexing feature data mining graph query intrinsic characteristic size-increasing support constraint graph indexing problem ideal candidate di erent performance study schemaless data graph mining technique novel solution large database query processing gindex approach typical path-based method discriminative fragment index structure database indexing index size chemical compound path-based method xml document elegant solution graph-based index frequent pattern mining

DMCA