Abstract
Graphs have been prevalently used to represent complex data, such as social networks, citation networks and biological protein interaction networks. The subgraph matching problem has wide applications in the graph data computing area. Recently, many parallel matching algorithms have been proposed to speed up subgraph matching queries, among which the filter-join framework is attracting increasingly attentions in recent years. Existing filtering strategies are able to compress candidate vertex sets to a certain size. However, quite a few invalid vertices are still left, leading to unnecessary computation in later joining phases. We observed that the shortest distance between vertices can act as an important condition to further refine the candidate set. In this paper, we propose a method of shortest distance estimation based on the observation and design a new method based on distance coding. By this means we improve the efficiency of subgraph matching. The experimental results suggests that our method is more efficient and scalable than the state-of-the-art method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Carletti, V., Foggia, P., Ritrovato, P., Vento, M., Vigilante, V.: A parallel algorithm for subgraph isomorphism. In: Conte, D., Ramel, J.-Y., Foggia, P. (eds.) GbRPR 2019. LNCS, vol. 11510, pp. 141–151. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-20081-7_14
Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 442–446. SIAM (2004)
Tran, H.-N., Kim, J., He, B.: Fast Subgraph Matching on Large Graphs using Graphics Processors. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 299–315. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18120-2_18
Wang, Z., Gu, R., Hu, W., Yuan, C., Huang, Y.: BENU: distributed subgraph enumeration with backtracking-based framework. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 136–147. IEEE (2019)
Zeng, L., Zou, L., Özsu, M.T., Hu, L., Zhang, F.: GSI: GPU-friendly subgraph isomorphism. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1249–1260. IEEE (2020)
Acknowledgements
This work is supported by the National Nature Science Foundation of China (61872071, 61872070).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Jiang, S., Wang, Y., Lu, G., Li, C. (2021). DLSM: Distance Label Based Subgraph Matching on GPU. In: U, L.H., Spaniol, M., Sakurai, Y., Chen, J. (eds) Web and Big Data. APWeb-WAIM 2021. Lecture Notes in Computer Science(), vol 12859. Springer, Cham. https://doi.org/10.1007/978-3-030-85899-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-85899-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85898-8
Online ISBN: 978-3-030-85899-5
eBook Packages: Computer ScienceComputer Science (R0)