Advertisement

Answering Subgraph Queries over Large Graphs

  • Weiguo Zheng
  • Lei Zou
  • Dongyan Zhao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6897)

Abstract

Recently, subgraph queries over large graph-structured data have attracted lots of attentions. Most of the recent algorithms proposed to solve this problem apply the structural features of graphs to construct the index, such as path, tree and subgraph. However, there is no a solid theory foundation of which structure is the best one to construct the index. What is more, the cost of mining these structures is rather expensive. In this paper, we present a high performance graph query algorithm, SMS, based on the simple yet effective neighborhood structure. To further improve the query performance, a graph partition solution is proposed and the efficient codes of vertices and blocks are carefully designed. Extensive experimental studies demonstrate the effectiveness and scalability of our algorithm in the issue of subgraph queries on large graph-structured data.

Keywords

Match Sequence Large Graph Query Performance Subgraph Isomorphism Database Graph 
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.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)Google Scholar
  2. 2.
    Cheng, J., Ke, Y., Ng, W., Lu, A.: fg-index: Towards verification-free query processing on graph databases. In: SIGMOD (2007)Google Scholar
  3. 3.
    Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367–1372 (2004)CrossRefGoogle Scholar
  4. 4.
    Dost, B., Shlomi, T., Gupta, N., Ruppin, E., Bafna, V., Sharan, R.: Qnet: A tool for querying protein interaction networks. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol. 4453, pp. 1–15. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Williams, J.H.D.W., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE (2007)Google Scholar
  6. 6.
    Jiang, P.Y.H., Wang, H., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE (2007)Google Scholar
  7. 7.
    He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE (2006)Google Scholar
  8. 8.
    Jiang, H., Wang, H., Yu, P.S., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE (2007)Google Scholar
  9. 9.
    Karypis, G., Kumar, V.: Analysis of multilevel graph partitioning. In: SC (1995)Google Scholar
  10. 10.
    Liu, J., Lee, Y.T.: A graph-based method for face identification from a single 2d line drawing. IEEE Trans. Pattern Anal. Mach. Intell. 23(10) (2001)Google Scholar
  11. 11.
    Mandreoli, F., Martoglia, R., Villani, G., Penzo, W.: Flexible query answering on graph-modeled data. In: EDBT, pp. 216–227 (2009)Google Scholar
  12. 12.
    Milgram, S.: The small-world problem. In: PT, vol. 1, pp. 61–67 (1967)Google Scholar
  13. 13.
    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
  14. 14.
    Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)Google Scholar
  15. 15.
    Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1) (1976)Google Scholar
  16. 16.
    Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD (2004)Google Scholar
  17. 17.
    Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE (2007)Google Scholar
  18. 18.
    Zhang, S., Li, S., Yang, J.: Gaddi: distance index based subgraph matching in biological networks. In: EDBT, pp. 192–203 (2009)Google Scholar
  19. 19.
    Zhang, S., Yang, J., Jin, W.: Sapper: Subgraph indexing and approximate matching in large graphs. PVLDB 3(1), 1185–1194 (2010)Google Scholar
  20. 20.
    Zhao, P., Han, J.: On graph query optimization in large networks. In: VLDB (2010)Google Scholar
  21. 21.
    Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta > = graph. In: VLDB (2007)Google Scholar
  22. 22.
    Zhu, K., Zhang, Y., Lin, X., Zhu, G., Wang, W.: Nova: A novel and efficient framework for finding subgraph isomorphism mappings in large graphs. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5981, pp. 140–154. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Weiguo Zheng
    • 1
  • Lei Zou
    • 1
  • Dongyan Zhao
    • 1
  1. 1.Peking UniversityBeijingChina

Personalised recommendations