Advertisement

NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs

  • Ke Zhu
  • Ying Zhang
  • Xuemin Lin
  • Gaoping Zhu
  • Wei Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5981)

Abstract

Considerable efforts have been spent in studying subgraph problem. Traditional subgraph containment query is to retrieve all database graphs which contain the query graph g. A variation to that is to find all occurrences of a particular pattern(the query) in a large database graph. We call it subgraph matching problem. The state of art solution to this problem is GADDI. In this paper, we will propose a more efficient index and algorithm to answer subgraph matching problem. The index is based on the label distribution of neighbourhood vertices and it is structured as a multi-dimensional vector signature. A novel algorithm is also proposed to further speed up the isomorphic enumeration process. This algorithm attempts to maximize the computational sharing. It also attempts to predict some enumeration state is impossible to lead to a final answer by eagerly pruning strategy. We have performed extensive experiments to demonstrate the efficiency and the effectiveness of our technique.

Keywords

Candidate List Large Graph Enumeration Process Subgraph Isomorphism Pruning Strategy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cheng, J., Ke, Y., Ng, W., Lu, A.: Fg-index: towards verification-free query processing on graph databases. In: SIGMOD Conference (2007)Google Scholar
  2. 2.
    Jiang, H., Wang, H., Yu, P.S., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE (2007)Google Scholar
  3. 3.
    Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD Conference (2004)Google Scholar
  4. 4.
    Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE (2007)Google Scholar
  5. 5.
    Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta >= graph. In: VLDB (2007)Google Scholar
  6. 6.
    Zou, L., Chen 0002, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT (2008)Google Scholar
  7. 7.
    Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1) (2008)Google Scholar
  8. 8.
    Backstrom, L., Dwork, C., Kleinberg, J.M.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: WWW (2007)Google Scholar
  9. 9.
    Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. In: ICPR (2) (2002)Google Scholar
  10. 10.
    Zhang, S., Li, S., Yang, J.: Gaddi: distance index based subgraph matching in biological networks. In: EDBT (2009)Google Scholar
  11. 11.
    Tian, Y., Patel, J.M.: Tale: A tool for approximate large graph matching. In: ICDE (2008)Google Scholar
  12. 12.
    Human protein reference database, http://www.hprd.org/download
  13. 13.
    The gene ontology, http://www.geneontology.org
  14. 14.
    Adamic, L.A., Glance, N.: The political blogosphere and the 2004 us election. In: WWW 2005 Workshop on the Weblogging Ecosystem (2005)Google Scholar
  15. 15.
    Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C.: Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 133–145. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  16. 16.
    Wang, C., Chen 0002, L.: Continuous subgraph pattern search over graph streams. In: ICDE (2009)Google Scholar
  17. 17.
    Chen, J., Hsu, W., Lee, M.L., Ng, S.K.: Nemofinder: Dissecting genome-wide protein-protein interactions with meso-scale network motifs. In: KDD (2006)Google Scholar
  18. 18.
    Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph (2005)Google Scholar
  19. 19.
    Chen, C., Lin, C.X., Fredrikson, M., Christodorescu, M., Yan, X., Han, J.: Mining graph patterns efficiently via randomized summaries. In: VLDB (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ke Zhu
    • 1
  • Ying Zhang
    • 1
  • Xuemin Lin
    • 1
  • Gaoping Zhu
    • 1
  • Wei Wang
    • 1
  1. 1.School of Computer Science and EngineeringUniversity of New South WalesAustralia

Personalised recommendations