-
- Haichuan Shang
- University of New South Wales & NICTA, Sydney, Australia
-
- Ying Zhang
- University of New South Wales & NICTA, Sydney, Australia
-
- Xuemin Lin
- University of New South Wales & NICTA, Sydney, Australia
-
- Jeffrey Xu Yu
- Chinese university of Hong Kong, Hong Kong, China
書誌事項
- タイトル別名
-
- an efficient algorithm for testing subgraph isomorphism
- 公開日
- 2008-08
- DOI
-
- 10.14778/1453856.1453899
- 公開者
- Association for Computing Machinery (ACM)
この論文をさがす
説明
<jats:p> Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of <jats:italic>filtering</jats:italic> -and- <jats:italic>verification</jats:italic> to reduce the precise computation costs; consequently various novel feature-based indexes have been developed. While the existing techniques work well for small query graphs, the verification phase becomes a bottleneck when the query graph size increases. Motivated by this, in the paper we firstly propose a novel and efficient algorithm for testing subgraph isomorphism, QuickSI. Secondly, we develop a new feature-based index technique to accommodate QuickSI in the filtering phase. Our extensive experiments on real and synthetic data demonstrate the efficiency and scalability of the proposed techniques, which significantly improve the existing techniques. </jats:p>
収録刊行物
-
- Proceedings of the VLDB Endowment
-
Proceedings of the VLDB Endowment 1 (1), 364-375, 2008-08
Association for Computing Machinery (ACM)