Approximating Diversified Top-k Graph Pattern Matching

  • Xin WangEmail author
  • Huayi Zhan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11029)


Graph pattern matching has been increasingly used in e.g., social network analysis. As the matching semantic is typically defined in terms of subgraph isomorphism, several problems are raised: (1) matching computation is often very expensive, due to the intractability of the problem, (2) the semantic is often too strict to identify meaningful matches, and (3) there may exist excessive matches which makes inspection very difficult. On the other hand, users are often interested in diversified top-k matches, rather than entire match set, since result diversification has been proven effective in improving users’ satisfaction, and top-k matches not only eases result understanding but also can save the cost of matching computation. Motivated by these, this paper investigates approximating diversified top-k graph pattern matching. (1) We extend traditional notion of subgraph isomorphism by allowing edge to path mapping, and define matching based on the revised notion. With the extension, more meaningful matches could be captured. (2) We propose two functions for ranking matches: a relevance function \(w(\cdot )\) based on tightness of connectivity, and a distance function \(d(\cdot )\) measuring match diversity. Based on relevance and distance functions, we propose diversification function \(F(\cdot )\), and formalize the diversified top-k graph pattern matching problem using \(F(\cdot )\). (3) Despite hardness of the problem, we provide two approximation algorithms with performance guarantees, and one of them even preserves early termination property. (4) Using real-life and synthetic data, we experimentally verify that our approximation algorithms are effective, and outperform traditional matching algorithms.



This work is supported by NSFC 71490722, Fundamental Research Funds for the Central Universities, and National Key R&D Program No. 2017YFA0700800, China.


  1. 1.
  2. 2.
    Alonso, O., Gamon, M., Haas, K., Pantel, P.: Diversity and relevance in social search. In: DDR (2012)Google Scholar
  3. 3.
    Borodin, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. In: PODS, pp. 155–166. ACM (2012)Google Scholar
  4. 4.
    Brynielsson, J., Högberg, J., Kaati, L., Martenson, C., Svenson, P.: Detecting social positions using simulation. In: ASONAM (2010)Google Scholar
  5. 5.
    Cheng, J., Zeng, X., Yu, J.X.: Top-k graph pattern matching over large graphs. In: ICDE, pp. 1033–1044 (2013)Google Scholar
  6. 6.
    Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. TPAMI 26(10), 1367–1372 (2004)CrossRefGoogle Scholar
  7. 7.
    Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractable to polynomial time. PVLDB 3(1), 264–275 (2010)Google Scholar
  8. 8.
    Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. PVLDB 6(13), 1510–1521 (2013)Google Scholar
  9. 9.
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  10. 10.
    Garg, S., Gupta, T. Carlsson, N., Mahanti, A.: Evolution of an online social aggregation network: an empirical study. In: IMC 2009Google Scholar
  11. 11.
    Gollapudi, S. Sharma, A.: An axiomatic approach for result diversification. In: WWW (2009)Google Scholar
  12. 12.
    Gong, N.Z., et al.: Evolution of social-attribute networks: measurements, modeling, and implications using Google+. In: IMC (2012)Google Scholar
  13. 13.
    Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: SIGMOD (2008)Google Scholar
  14. 14.
    Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3), 133–137 (1997)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: FOCS (1995)Google Scholar
  16. 16.
    Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)zbMATHGoogle Scholar
  17. 17.
    Qin, L., Yu, J.X., Chang, L.: Diversifying top-k results. PVLDB 5(11), 1124–1135 (2012)Google Scholar
  18. 18.
    Terveen, L.G., McDonald, D.W.: Social matching: a framework and research agenda. ACM Trans. Comput. Hum. Interact. 12(3), 401–434 (2005)CrossRefGoogle Scholar
  19. 19.
    Vieira, M.R., et al.: On query result diversification. In: ICDE (2011)Google Scholar
  20. 20.
    Yang, Z., Fu, A.W., Liu, R.: Diversified top-k subgraph querying in a large graph. In: SIGMOD, pp. 1167–1182 (2016)Google Scholar
  21. 21.
    Zou, L., Chen, L., Lu, Y.: Top-k subgraph matching query in a large graph. In: Ph.D. workshop in CIKM (2007)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Southwest Jiaotong UniversityChengduChina
  2. 2.ChangHong Inc.MianyangChina

Personalised recommendations