Abstract
There are two major approaches for graph pattern matching: subgraph isomorphism and graph simulation. With the former approach, each answer is a subgraph that exactly matches a given pattern graph. However, this feature is sometimes too restrictive since strongly-related nodes may be in different answers even if such nodes should be in the same answer. With the latter approach, we can find an answer efficiently but the answer is a single relation in which a number of unrelated subgraphs are intermingled together. In this paper, we propose a hybrid approach of subgraph isomorphism and graph simulation for graph pattern matching. The distinctive feature of our approach is that we can find answer subgraphs so that each answer subgraph consists of strongly-related subgraphs that match a given pattern and that unrelated subgraphs are not intermingled in the same answer unlike graph simulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: Proceedings of the 2016 International Conference on Management of Data. SIGMOD 2016, pp. 1199–1214 (2016)
Fan, W., Wang, X., Wu, Y.: Incremental graph pattern matching. ACM Trans. Database Syst. 38(3), 18:1–18:47 (2013)
Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science. FOCS 1995, pp. 453–462 (1995)
Lee, J., Han, W.-S., Kasperovics, R., Lee, J.-H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. In: Proceedings of the 39th International Conference on Very Large Data Bases. PVLDB 2013, pp. 133–144 (2013)
Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Strong simulation: capturing topology in graph pattern matching. ACM Trans. Database Syst. 39(1), 4:1–4:46 (2014)
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)
Schmidt, M., Hornung, T., Lausen, G., Pinkel, C.: SP2Bench: a SPARQL performance benchmark. In: ICDE 2009, pp. 222–233 (2009)
Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc. VLDB Endow. 1(1), 364–375 (2008)
Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31–42 (1976)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Sugawara, K., Suzuki, N. (2018). A Hybrid Approach of Subgraph Isomorphism and Graph Simulation for Graph Pattern Matching. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2018. Lecture Notes in Computer Science(), vol 11030. Springer, Cham. https://doi.org/10.1007/978-3-319-98812-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-98812-2_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98811-5
Online ISBN: 978-3-319-98812-2
eBook Packages: Computer ScienceComputer Science (R0)