Incremental graph pattern matching

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 925-936

  Fan, Wenfei ^a,b   Li, Jianzhong ^b   Luo, Jizhou ^b   Tan, Zijing ^c   Wang, Xin ^a   Wu, Yinghui ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b HARBIN INSTITUTE OF TECHNOLOGY   (China)

^c FUDAN UNIVERSITY   (China)

Author keywords

affected area; bounded incremental matching algorithms

Indexed keywords

PATTERN MATCHING;

AFFECTED AREA; BATCH ALGORITHMS; BOUNDED INCREMENTAL MATCHING ALGORITHM; DATA GRAPH; EMERGING APPLICATIONS; GRAPH PATTERN MATCHING; INCREMENTAL ALGORITHM; INCREMENTAL GRAPH PATTERN MATCHING; MATCHING ALGORITHM; SUBGRAPH ISOMORPHISM;

SET THEORY;

EID: 79960022349     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989420     Document Type: Conference Paper

References (32)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web. From Relations to Semistructured Data and XML. Morgan Kaufman, 2000.
2. S. Abiteboul, J. McHugh, M. Rys, V. Vassalos, and J. L. Wiener. Incremental maintenance for materialized views over semistructured data. In VLDB, 1998.
3. J. Brynielsson, J. Högberg, L. Kaati, C. Martenson, and P. Svenson. Detecting social positions using simulation. In ASONAM, 2010.
4. Z. Chen, H. T. Shen, X. Zhou, and J. X. Yu. Monitoring path nearest neighbor in road networks. In SIGMOD, 2009.
5. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. IJPRAI, 18(3), 2004.
6. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In IAPR TC- 15 Workshop on Graph-based Representations in Pattern Recognition, 2001.
7. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. Commun. ACM, 51(1), 2008.
8. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu, and Y. Wu. Graph pattern matching: From intractability to polynomial time. In PVLDB, 2010.
9. P. Foggia, C. Sansone, and M. Vento. A performance comparison of five algorithms for graph isomorphism. In IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition, 2001.
10. B. Gallagher. Matching structure and semantics: A survey on graph-based pattern matching. AAAI FS., 2006.
11. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
12. S. Garg, T. Gupta, N. Carlsson, and A. Mahanti. Evolution of an online social aggregation network: An empirical study. In IMC, 2009.
13. A. Gupta and I. Mumick. Materialized Views. MIT Press, 2000.
14. M. R. Henzinger, T. Henzinger, and P. Kopke. Computing simulations on finite and infinite graphs. In FOCS, 1995.
15. M. F. Husain, P. Doshi, L. Khan, and B. M. Thuraisingham. Storage and retrieval of large rdf graph using hadoop and mapreduce. In CloudCom, 2009.
16. R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In KDD, 2006.
17. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data, 1(1):2, 2007.
18. A. Ntoulas, J. Cho, and C. Olston. What's new on the Web? The evolution of the Web from a search engine perspective. In WWW, 2004.
19. M. Potamias, F. Bonchi, C. Castillo, and A. Gionis. Fast shortest path distance estimation in large networks. In CIKM, 2009.
20. N. Przulj, D. G. Corneil, and I. Jurisica. Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinformatics, 22(8):974-980, 2006.
21. G. Ramalingam and T. Reps. An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms, 21(2):267-305, 1996. (Pubitemid 126412538)
22. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. TCS, 158(1-2), 1996.
23. G. Ramalingam and T. W. Reps. A categorized bibliography on incremental computation. In POPL, 1993.
24. D. Saha. An incremental bisimulation algorithm. In FSTTCS, 2007.
25. S. K. Shukla, E. K. Shukla, D. J. Rosenkrantz, H. B. H. Iii, and R. E. Stearns. The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach. In DIMACS Ser. Discrete, 1997.
26. A. Stotz, R. Nagi, and M. Sudit. Incremental graph matching for situation awareness. FUSION, 2009.
27. J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su. Arnetminer: extraction and mining of academic social networks. In KDD, 2008.
28. J. R. Ullmann. An algorithm for subgraph isomorphism. JACM, 23(1):31-42, 1976.
29. V. V. Vazirani. Approximation Algorithms. Springer, 2003.
30. C. Wang and L. Chen. Continuous subgraph pattern search over graph streams. In ICDE, 2009.
31. S. White and P. Smyth. Algorithms for estimating relative importance in networks. In KDD, 2003.
32. Y. Zhuge and H. Garcia-Molina. Graph structured views and their incremental maintenance. In ICDE, 1998.