Taming Verification Hardness: an efficient algorithm for testing sub graph isomorphism

Publisher:
ACM
Publication Type:
Conference Proceeding
Citation:
Proceedings of the VLDB Endowment, 2008, 1 pp. 364 - 375
Issue Date:
2008-01
Full metadata record
Files in This Item:
Filename Description Size
2013005473OK.pdf604.31 kB
Adobe PDF
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 filtering-and-verification 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
Please use this identifier to cite or link to this item: