A General Powerful Graph Pattern Matching System for Data Analysis
Graph pattern matching is a powerful mechanism for searching on network data. Most of the graph pattern matching tools available are based on subgraph isomorphism, i.e. finding a one-to-one correspondence between nodes of a query graph and nodes of a target graph. Often this approach is not flexible enough, since it does not allow the query to represent sets of nodes of any size that share the same profile of connectivity. We propose a novel powerful graph matching approach that overcomes the existing limits and allows the user to define complex patterns in a simple and intuitive way. In our approach, queries are expressed as graphs, whose nodes and edges specify structural constraints and filtering criteria. We show that, despite its simplicity, the proposed approach can solve a large variety of practical problems.
KeywordsGraph pattern matching Network analysis Subgraph isomorphism
This work is supported by the CLARA - CLoud plAtform and smart underground imaging for natural Risk Assessment - project, SCN 00451, funded by the Italian Ministry of Education, Universities and Research, within the “Smart Cities and Communities and Social Innovation” initiative.
- 6.Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-oriented Software. Addison-Wesley, Boston (1994)Google Scholar
- 7.He, H., Singh, A.K.: Closure-tree: an index structure for graph queries. In: Proceedings of International Conference on Data Engineering (ICDE), pp. 38–38. IEEE (2006)Google Scholar
- 8.Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proceedings of Annual Symposium on Foundations of Computer Science, pp. 453–462. IEEE (1995)Google Scholar
- 14.Pienta, R., Tamersoy, A., Tong, H., Chau, D.H.: Mage: Matching approximate patterns in richly-attributed graphs. In: Proceedings of International Conference on Big Data (Big Data), pp. 585–590. IEEE (2014)Google Scholar
- 16.Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: Proceedings of International Conference on Data Engineering (ICDE), pp. 966–975. IEEE (2007)Google Scholar
- 17.Zhang, S., Li, S., Yang, J.: GADDI: distance index based subgraph matching in biological networks. In: Proceedings of International Conference on Extending Database Technology: Advances in Database Technology, pp. 192–203. ACM (2009)Google Scholar