Abstract
Labeled graphs are used to represent entities and their relationships in a plethora of Web applications. Graph pattern matching is a fundamental operation for the analysis and exploration of data graphs. In this paper, we address the problem of efficiently finding homomorphic matches for hybrid patterns, where each edge may be mapped either to an edge or to a path, thus allowing for higher expressiveness and flexibility in query formulation. We design a novel holistic graph simulation-based algorithm, called GraphMatch-Sim, which leverages simulation to precisely identify, in advance, all the graph nodes that participate in the pattern matches returned. GraphMatch-Sim can flexibly employ any reachability index as a plug-in component. Unlike existing methods, it produces no redundant intermediate results, thus achieving worst-case optimality. An extensive experimental evaluation on both real and synthetic datasets shows that our method evaluates hybrid patterns orders of magnitude faster than existing algorithms and has much better scalability.
The research of the first author was supported by the National Natural Science Foundation of China under Grant No. 61872276.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aberger, C.R., Tu, S., Olukotun, K., Ré, C.: Emptyheaded: a relational engine for graph processing. In: SIGMOD, pp. 431–446 (2016)
Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: SIGMOD, pp. 1199–1214 (2016)
Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on dags. In: VLDB, pp. 493–504 (2005)
Cheng, J., Yu, J.X., Yu, P.S.: Graph pattern matching: a join/semijoin approach. IEEE Trans. Knowl. Data Eng. 23(7), 1006–1021 (2011)
Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractable to polynomial time. Proc. VLDB Endowment 3(1), 264–275 (2010)
Kaushik, R., Bohannon, P., Naughton, J.F., Korth, J.F.: Covering indexes for branching path queries. In: SIGMOD, pp. 133–144 (2002)
Liang, R., Zhuge, H., Jiang, X., Zeng, Q., He, X.: Scaling hop-based reachability indexing for fast graph pattern query processing. IEEE Trans. Knowl. Data Eng. 26(11), 2803–2817 (2014)
Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Strong simulation: capturing topology in graph pattern matching. ACM Trans. Database Syst. 39(1), 1–46 (2014)
Mennicke, S., Kalo, J., Nagel, D., Kroll, H., Balke, W.: Fast dual simulation processing of graph database queries. In: ICDE, pp. 244–255 (2019)
Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? IEEE Trans. Knowl. Data Eng. 29(3), 683–697 (2017)
Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. Proc. VLDB Endowment 5(9), 788–799 (2012)
Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31–42 (1976)
Wu, X., Theodoratos, D., Skoutas, D., Lan, M.: Efficiently computing homomorphic matches of hybrid pattern queries on large graphs. In: Ordonez, C., Song, I.-Y., Anderst-Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DaWaK 2019. LNCS, vol. 11708, pp. 279–295. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-27520-4_20
Zeng, Q., Zhuge, H.: Comments on stack-based algorithms for pattern matching on dags. Proc. VLDB Endowment 5(7), 668–679 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Wu, X., Theodoratos, D., Skoutas, D., Lan, M. (2020). Leveraging Double Simulation to Efficiently Evaluate Hybrid Patterns on Data Graphs. In: Huang, Z., Beek, W., Wang, H., Zhou, R., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2020. WISE 2020. Lecture Notes in Computer Science(), vol 12342. Springer, Cham. https://doi.org/10.1007/978-3-030-62005-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-62005-9_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62004-2
Online ISBN: 978-3-030-62005-9
eBook Packages: Computer ScienceComputer Science (R0)