Abstract
Due to its wide applications, subgraph matching problem has been studied extensively in the past decade. In this paper, we consider the subgraph match query in a more general scenario. We build a structural index that does not depend on any vertex content. Our method can be applied in graphs with any kind of vertex/edge content. Based on the index, we design a holistic subgraph matching algorithm. This paper is the first effort of the holistic pattern matching approach in the subgraph query problem. It can dramatically reduce the search space. Extensive experiments on real graphs show that our method outperforms state-of-the-art algorithms.
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
Preview
Unable to display preview. Download preview PDF.
References
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) (2004)
Han, W.-S., Lee, J., Lee, J.-H.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD Conference, pp. 337–348 (2013)
Lee, J., Han, W.-S., Kasperovics, R., Lee, J.-H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. In: PVLDB, vol. 6(2), pp. 133–144 (2012)
Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. In: PVLDB, vol. 5(9) (2012)
Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACMÂ 23(1) (1976)
Zhang, S., Li, S., Yang, J.: Gaddi: distance index based subgraph matching in biological networks. In: EDBT (2009)
Zhao, P., Han, J.: On graph query optimization in large networks. In: VLDB (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Peng, P., Zou, L., Wang, D., Zhao, D. (2014). Holistic Subgraph Search over Large Graphs. In: Li, F., Li, G., Hwang, Sw., Yao, B., Zhang, Z. (eds) Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science, vol 8485. Springer, Cham. https://doi.org/10.1007/978-3-319-08010-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-08010-9_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08009-3
Online ISBN: 978-3-319-08010-9
eBook Packages: Computer ScienceComputer Science (R0)