Graph indexing: A frequent structure-based approach

Xifeng Yan, Philip S. Yu, Jiawei Han

Research output: Contribution to journalArticlepeer-review

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. Different 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.

Original languageEnglish (US)
Pages (from-to)335-346
Number of pages12
JournalProceedings of the ACM SIGMOD International Conference on Management of Data
StatePublished - 2004

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Graph indexing: A frequent structure-based approach'. Together they form a unique fingerprint.

Cite this