Advertisement

The VLDB Journal

, Volume 20, Issue 4, pp 521–539 | Cite as

Fast graph query processing with a low-cost index

  • James Cheng
  • Yiping Ke
  • Ada Wai-Chee Fu
  • Jeffrey Xu Yu
Regular Paper

Abstract

This paper studies the problem of processing supergraph queries, that is, given a database containing a set of graphs, find all the graphs in the database of which the query graph is a supergraph. Existing works usually construct an index and performs a filtering-and-verification process, which still requires many subgraph isomorphism testings. There are also significant overheads in both index construction and maintenance. In this paper, we design a graph querying system that achieves both fast indexing and efficient query processing. The index is constructed by a simple but fast method of extracting the commonality among the graphs, which does not involve any costly operation such as graph mining. Our query processing has two key techniques, direct inclusion and filtering. Direct inclusion allows partial query answers to be included directly without candidate verification. Our filtering technique further reduces the candidate set by operating on a much smaller projected database. Experimental results show that our method is significantly more efficient than the existing works in both indexing and query processing, and our index has a low maintenance cost.

Keywords

Graph query processing Graph indexing Supergraph queries 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: PODS, pp. 1–16. (2002)Google Scholar
  2. 2.
    Chen, C., Yan, X., Yu, P.S., Han, J., Zhang, D.-Q., Gu X.: Towards graph containment search and indexing. In: VLDB, pp. 926–937. (2007)Google Scholar
  3. 3.
    Cheng, J., Ke, Y., Ng, W., Lu, A.: Fg-index: towards verification-free query processing on graph databases. In: SIGMOD Conference, pp. 857–872. (2007)Google Scholar
  4. 4.
    Golab L., Özsu M.T.: Issues in data stream management. SIGMOD Rec. 32(2), 5–14 (2003)CrossRefGoogle Scholar
  5. 5.
    He, H., Singh, A.K.: Closure-tree: an index structure for graph queries. In: ICDE, pp. 38. (2006)Google Scholar
  6. 6.
    Huan, J., Wang, W., Bandyopadhyay, D., Snoeyink, J., Prins, J., Tropsha A.: Mining protein family specific residue packing patterns from protein structure graphs. In: RECOMB, pp. 308–315. (2004)Google Scholar
  7. 7.
    Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: KDD, pp. 581–586. (2004)Google Scholar
  8. 8.
    Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: PKDD, pp. 13–23. (2000)Google Scholar
  9. 9.
    James C.A., Weininger D., Delany J.: Daylight theory manual daylight version 4.82. Daylight Chemical Information Systems Inc., Irvine, CA (2003)Google Scholar
  10. 10.
    Jiang, H., Wang, H., Yu, P.S., Zhou, S.: Gstring: a novel approach for efficient search in graph databases. In: ICDE, pp. 566–575. (2007)Google Scholar
  11. 11.
    Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity in networks. In: KDD, pp. 245–255. (2006)Google Scholar
  12. 12.
    Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In: VLDB, (2008)Google Scholar
  13. 13.
    Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS, pp.39–52. (2002)Google Scholar
  14. 14.
    Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp. 404–413. (2006)Google Scholar
  15. 15.
    Urhan T., Franklin M.J.: Xjoin: a reactively-scheduled pipelined join operator. IEEE Data Eng. Bull. 23(2), 27–33 (2000)Google Scholar
  16. 16.
    Williams, D.W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE, pp. 976–985. (2007)Google Scholar
  17. 17.
    Xin, D., Han, J., Yan, X., Cheng, H.: Mining compressed frequent-pattern sets. In: VLDB, pp. 709–720. (2005)Google Scholar
  18. 18.
    Yan, X., Han, J.: gspan: graph-based substructure pattern mining. In: ICDM, pp. 721–724. (2002)Google Scholar
  19. 19.
    Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: KDD, pp. 286–295. (2003)Google Scholar
  20. 20.
    Yan X., Yu P.S., Han J.: Graph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst. 30(4), 960–993 (2005)CrossRefGoogle Scholar
  21. 21.
    Zhang, S., Hu, M., Yang, J.: Treepi: a novel graph indexing method. In: ICDE, pp. 966–975. (2007)Google Scholar
  22. 22.
    Zhang, S., Li, J., Gao, H., Zou, Z.: A novel approach for efficient supergraph query processing on graph databases. In: EDBT, pp. 204–215. (2009)Google Scholar
  23. 23.
    Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: tree + delta >= graph. In: VLDB, pp. 938–949. (2007)Google Scholar
  24. 24.
    Zou, L., 0002, L.C., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT, pp. 181–192. (2008)Google Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  • James Cheng
    • 1
  • Yiping Ke
    • 2
  • Ada Wai-Chee Fu
    • 3
  • Jeffrey Xu Yu
    • 2
  1. 1.School of Computer EngineeringNanyang Technological UniversityNanyangSingapore
  2. 2.Department of Systems Engineering and Engineering ManagementThe Chinese University of Hong KongSha TinHong Kong
  3. 3.Department of Computer Science and EngineeringThe Chinese University of Hong KongSha TinHong Kong

Personalised recommendations