{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:26:43Z","timestamp":1765546003400,"version":"3.41.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,7]],"date-time":"2015-03-07T00:00:00Z","timestamp":1425686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00778-015-0381-6","type":"journal-article","created":{"date-parts":[[2015,3,6]],"date-time":"2015-03-06T06:33:12Z","timestamp":1425623592000},"page":"369-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Efficient distributed subgraph similarity matching"],"prefix":"10.1007","volume":"24","author":[{"given":"Ye","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jeffery Yu","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,7]]},"reference":[{"key":"381_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Fotakis, D., Ullman, J.D.: Enumerating subgraph instances using map-reduce. In: ICDE (2013)","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"381_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and Mining Graph Data","author":"C Aggarwal","year":"2010","unstructured":"Aggarwal, C., Wang, H.: Managing and Mining Graph Data. Springer, Berlin (2010)"},{"issue":"6","key":"381_CR3","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., Racke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929\u2013939 (2006)","journal-title":"Theory Comput. Syst."},{"key":"381_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: SDM, vol. 4, pp. 442\u2013446. SIAM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"381_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"issue":"1","key":"381_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"381_CR7","doi-asserted-by":"crossref","unstructured":"Fan, W., Wang, X., Wu, Y.: Performance guarantees for distributed reachability queries. In: VLDB, pp. 1304\u20131316 (2012)","DOI":"10.14778\/2350229.2350248"},{"issue":"1","key":"381_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"key":"381_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"381_CR10","doi-asserted-by":"crossref","unstructured":"Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems. PWS (1997)","DOI":"10.1145\/261342.571216"},{"key":"381_CR11","unstructured":"http:\/\/research.microsoft.com\/en-us\/projects\/trinity\/"},{"key":"381_CR12","unstructured":"http:\/\/www.facebook.com\/press\/info.php?statistics"},{"key":"381_CR13","unstructured":"http:\/\/www.w3.org\/"},{"key":"381_CR14","unstructured":"http:\/\/www.worldwidewebsize.com\/"},{"key":"381_CR15","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E.: Pegasus: a peta-scale graph mining system implementation and observations. In: ICDM (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"381_CR16","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.B.: What is twitter, a social network or a news media? In: WWW, pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"381_CR17","doi-asserted-by":"crossref","unstructured":"Ma, S., Cao, Y., Huai, J., Wo, T.: Distributed graph pattern matching. In: WWW, pp. 949\u2013958. ACM (2012)","DOI":"10.1145\/2187836.2187963"},{"key":"381_CR18","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"381_CR19","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD (2003)","DOI":"10.1145\/872757.872814"},{"issue":"2","key":"381_CR20","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.jpdc.2012.10.005","volume":"73","author":"T Plantenga","year":"2013","unstructured":"Plantenga, T.: Inexact subgraph isomorphism in mapreduce. J. Parallel Distrib. Comput. 73(2), 164\u2013175 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"381_CR21","doi-asserted-by":"crossref","unstructured":"Shang, Z., Yu, J.X.: Catch the wind: graph workload balancing on cloud. In: ICDE, pp.553\u2013564 (2013)","DOI":"10.1109\/ICDE.2013.6544855"},{"key":"381_CR22","doi-asserted-by":"crossref","unstructured":"Shang, H., Zhu, K., Lin, X., Zhang, Y., Ichise, R.: Similarity search on supergraph containment. In: Proceedings of ICDE, pp. 637\u2013648 (2010)","DOI":"10.1109\/ICDE.2010.5447846"},{"key":"381_CR23","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: MSST, pp. 1\u201310. IEEE (2010)","DOI":"10.1109\/MSST.2010.5496972"},{"key":"381_CR24","doi-asserted-by":"crossref","unstructured":"Srivatsa, M., Kawadia, V., Yang, S.: Distributed graph query processing in dynamic networks. In: Pervasive Computing and Communications Workshops (PERCOM Workshops), 2012 IEEE International Conference on, pp. 20\u201325. IEEE (2012)","DOI":"10.1109\/PerComW.2012.6197481"},{"key":"381_CR25","doi-asserted-by":"crossref","unstructured":"Stanton, I., Kliot, G.: Streaming graph partitioning for large distributed graphs. In: KDD, pp. 1222\u20131230. ACM (2012)","DOI":"10.1145\/2339530.2339722"},{"key":"381_CR26","doi-asserted-by":"crossref","unstructured":"Sun, Z., Wang, H., Shao, B., Wang, H., Li, J.: Efficient subgraph matching on billion node graphs. In: VLDB (2012)","DOI":"10.14778\/2311906.2311907"},{"key":"381_CR27","volume-title":"Principles of Distributed Database Systems","author":"MT Ozsu","year":"2011","unstructured":"Ozsu, M.T., Valduriez, P.: Principles of Distributed Database Systems. Springer, Berlin (2011)"},{"key":"381_CR28","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: Proceedings of SIGMOD, pp. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"381_CR29","doi-asserted-by":"crossref","unstructured":"Yang, S., Yan, X., Zong, B., Khan, A.: Towards effective partition management for large graphs. In: SIGMOD, pp. 517\u2013528 (2012)","DOI":"10.1145\/2213836.2213895"},{"key":"381_CR30","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient subgraph similarity search on large probabilistic graph databases. In: Proceedings of VLDB, pp. 800\u2013811 (2012)","DOI":"10.14778\/2311906.2311908"},{"key":"381_CR31","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Graph similarity search on large uncertain graph databases. VLDB J. pp. 1\u201326 (2014)","DOI":"10.1007\/s00778-014-0373-y"},{"key":"381_CR32","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient subgraph search over large uncertain graphs. In: Proceedings of VLDB, pp. 876\u2013886 (2011)","DOI":"10.14778\/3402707.3402726"},{"issue":"12","key":"381_CR33","first-page":"2767","volume":"25","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient keyword search on uncertain graph data. TKDE 25(12), 2767\u20132779 (2013)","journal-title":"TKDE"},{"key":"381_CR34","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Zhou, L., Feng, J.: Comparing stars: on approximating graph edit distance. In: VLDB (2009)","DOI":"10.14778\/1687627.1687631"},{"key":"381_CR35","doi-asserted-by":"crossref","unstructured":"Zeng, K., Yang, J., Wang, H., Shao, B., Wang, Z.: A distributed graph engine for web scale rdf data. In: VLDB (2013)","DOI":"10.14778\/2535570.2488333"},{"key":"381_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, J., Jin, W.: Sapper: subgraph indexing and approximate matching in large graphs. In: VLDB (2010)","DOI":"10.14778\/1920841.1920988"},{"issue":"1\u20132","key":"381_CR37","doi-asserted-by":"crossref","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. Proc. VLDB Endow. 3(1\u20132), 340\u2013351 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"381_CR38","doi-asserted-by":"crossref","unstructured":"Zhu, G., Lin, X., Zhu, K., Zhang, W., Yu, J.X.: Treespan: efficiently computing similarity all-matching. In: SIGMOD (2012)","DOI":"10.1145\/2213836.2213896"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0381-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-015-0381-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0381-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T19:23:05Z","timestamp":1747768985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-015-0381-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,7]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s00778-015-0381-6","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2015,3,7]]}}}