{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T05:03:31Z","timestamp":1744261411674,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072083"],"award-info":[{"award-number":["62072083"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872071"],"award-info":[{"award-number":["61872071"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CCF-Huawei Database Innovation Research Funding"},{"DOI":"10.13039\/501100018617","name":"Liao Ning Revitalization Talents Program","doi-asserted-by":"crossref","award":["XLYC1807158"],"award-info":[{"award-number":["XLYC1807158"]}],"id":[{"id":"10.13039\/501100018617","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11280-021-00952-w","type":"journal-article","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T04:02:42Z","timestamp":1635220962000},"page":"1377-1402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Unified-memory-based hybrid processing for partition-oriented subgraph matching on GPU"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3588-4822","authenticated-orcid":false,"given":"Jing","family":"Chen","sequence":"first","affiliation":[]},{"given":"Qiange","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Chuanwen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,26]]},"reference":[{"key":"952_CR1","doi-asserted-by":"crossref","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: SIGMOD Conference 2016, June 26 - July 01, 2016, pp. 1199\u20131214 (2016)","DOI":"10.1145\/2882903.2915236"},{"issue":"3","key":"952_CR2","first-page":"265","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"key":"952_CR3","first-page":"53","volume":"12317","author":"J Chen","year":"2020","unstructured":"Chen, J., Gu, Y., Wang, Q., Li, C., Yu, G.: Partition-oriented subgraph matching on GPU. APWeb\/WAIM 2020, LNCS 12317, 53\u201368 (2020)","journal-title":"APWeb\/WAIM 2020, LNCS"},{"key":"952_CR4","unstructured":"Garey, MR, Johnson, DS: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman (1979)"},{"issue":"7","key":"952_CR5","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.14778\/3384345.3384358","volume":"13","author":"P Gera","year":"2020","unstructured":"Gera, P., Kim, H., Sao, P., Kim, H., Bader, DA: Traversing large graphs on GPUs with unified memory. Proc. VLDB Endow. 13(7), 1119\u20131133 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"952_CR6","unstructured":"Gonzalez, JE, Low, Y., Haijie, G., Bickson, D., Guestrin, C.: Powergraph: Distributed graph-parallel computation on natural graphs. In: OSDI 2012, October 8\u201310, 2012, pp. 17\u201330 (2012)"},{"key":"952_CR7","doi-asserted-by":"crossref","unstructured":"Ha, N.T., Kim, J.-J., He, B.: Fast subgraph matching on large graphs using graphics processors. In: DASFAA 2015, April 20\u201323, 2015 Proceedings, Part I, pp. 299\u2013315 (2015)","DOI":"10.1007\/978-3-319-18120-2_18"},{"key":"952_CR8","doi-asserted-by":"crossref","unstructured":"Han, W., Mawhirter, D., Wu, B., Buland, M.: Graphie: Large-scale asynchronous graph traversals on just a GPU. PACT 233\u2013245 (2017)","DOI":"10.1109\/PACT.2017.41"},{"key":"952_CR9","unstructured":"Han, W.-S., Lee, J., Lee, J.-H.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD 2013, June 22\u201327, 2013, pp. 337\u2013348 (2013)"},{"key":"952_CR10","unstructured":"He, B., Fang, W., Luo, Q., Govindaraju, N.K., Wang, T.: Mars: a mapreduce framework on graphics processors. In: PACT 2008, October 25\u201329, 2008, pp. 260\u2013269 (2008)"},{"key":"952_CR11","doi-asserted-by":"crossref","unstructured":"Hong, S., Kim, S.K., Oguntebi, T., Olukotun, K.: Accelerating CUDA graph algorithms at maximum warp. In: PPOPP 2011, February 12\u201316, 2011, pp. 267\u2013276 (2011)","DOI":"10.1145\/2038037.1941590"},{"key":"952_CR12","unstructured":"https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html (2020)"},{"key":"952_CR13","unstructured":"https:\/\/developer.nvidia.com\/zh-cn\/cuda-toolkit (2020)"},{"key":"952_CR14","unstructured":"https:\/\/opencv.org\/opencl (2020)"},{"key":"952_CR15","doi-asserted-by":"crossref","unstructured":"Kim, M.-S., An, K., Park, H., Seo, H., Kim, J.: GTS: A fast and scalable graph processing method based on streaming topology to GPUs. SIGMOD June 26-July 01, 2016, 447\u2013461 (2020)","DOI":"10.1145\/2882903.2915204"},{"key":"952_CR16","doi-asserted-by":"crossref","unstructured":"Kim, S., Song, I., Lee, Y.-J.: An edge-based framework for fast subgraph matching in a large graph. In: DASFAA 2011, April 22\u201325, 2011, Proceedings, Part I, pp. 404\u2013417 (2011)","DOI":"10.1007\/978-3-642-20149-3_30"},{"key":"952_CR17","unstructured":"konect network dataset \u2013 KONECT, April 2017. http:\/\/konect.uni-koblenz.de\/"},{"key":"952_CR18","unstructured":"Li, Z., Zou, L., Tamer \u00d6zsu, M., Lin, H., Zhang, F.: GSI: gpu-friendly subgraph isomorphism. arXiv:1906.03420 (2019)"},{"key":"952_CR19","doi-asserted-by":"crossref","unstructured":"Liu, G., Zheng, K., Wang, Y., Orgun, MA, An, L., Zhao, L., Zhou, X.: Multi-constrained graph pattern matching in large-scale contextual social graphs. In: ICDE 2015, April 13\u201317, 2015, pp. 351\u2013362 (2015)","DOI":"10.1109\/ICDE.2015.7113297"},{"key":"952_CR20","unstructured":"Liu, H., Keselj, V., Blouin, C.: Biological event extraction using subgraph matching. In ISSMB (2010)"},{"key":"952_CR21","doi-asserted-by":"publisher","first-page":"66621","DOI":"10.1109\/ACCESS.2018.2875262","volume":"6","author":"T Ma","year":"2018","unstructured":"Ma, T., Siyang, Y u, Cao, J., Tian, Y., Al-Dhelaan, A., Al-Rodhaan, M.: A comparative study of subgraph matching isomorphic methods in social networks. IEEE Access 6, 66621\u201366631 (2018)","journal-title":"IEEE Access"},{"key":"952_CR22","unstructured":"Ma, L., Yang, Z., Chen, H., Xue, J., Garaph, Y.D.: Efficient GPU-accelerated graph processing on a single machine with balanced replication. In: USENIX Annual Technical Conference, pp. 195\u2013207 (2017)"},{"key":"952_CR23","doi-asserted-by":"crossref","unstructured":"Merrill, D., Garland, M., Grimshaw, A.S.: Scalable GPU graph traversal. In: PPOPP 2012, February 25\u201329, 2012, pp. 117\u2013128 (2012)","DOI":"10.1145\/2370036.2145832"},{"issue":"5","key":"952_CR24","first-page":"617","volume":"8","author":"X Ren","year":"2015","unstructured":"Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. PVLDB 8(5), 617\u2013628 (2015)","journal-title":"PVLDB"},{"key":"952_CR25","unstructured":"Sabet, A.H.N., Zhao, Z., Gupta, R.: Subway: minimizing data transfer during out-of-GPU-memory graph processing. EuroSys April 27\u201330, 2020, 12:1\u201312:16 (2020)"},{"key":"952_CR26","unstructured":"Sengupta, D., Song, S.L., Agarwal, K., Schwan, K.: GraphReduce: processing large-scale graphs on accelerator-based systems. SC November 15\u201320, 2015, 28:1\u201328:12 (2020)"},{"key":"952_CR27","unstructured":"Seungwon, M., Vikram, S.M., Zaid, Q., Jinjun, X., Eiman, E., Hwu, W.-M.W. : EMOGI: Efficient memory-access for out-of-memory graph-traversal. In GPUs. arXiv:2006.06890 (2020)"},{"issue":"1","key":"952_CR28","first-page":"364","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1), 364\u2013375 (2008)","journal-title":"PVLDB"},{"key":"952_CR29","unstructured":"Son, M.-Y., Kim, Y.-H., Oh, B.-W.: An efficient parallel algorithm for graph isomorphism on GPU using CUDA. In: IJET, 7(5) Oct-Nov, pp. 1840\u20131848 (2015)"},{"issue":"1","key":"952_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"952_CR31","doi-asserted-by":"crossref","unstructured":"Wang, H., Geng, L., Lee, R., Hou, K., Zhang, Y., Zhang, X.: SEP-graph: finding shortest execution paths for graph processing under a hybrid framework on GPU. PPoPP February 16\u201320, 2019, 38\u201352 (2019)","DOI":"10.1145\/3293883.3295733"},{"key":"952_CR32","doi-asserted-by":"crossref","unstructured":"Wang, Y., Davidson, A.A., Pan, Y., Yuduo, W., Riffel, A., Owens, J.D.: Gunrock: a high-performance graph processing library on the GPU. In: PPoPP 2016, March 12\u201316, 2016, pp. 11:1\u201311:12 (2016)","DOI":"10.1145\/3016078.2851145"},{"key":"952_CR33","doi-asserted-by":"crossref","unstructured":"Yan, X, Yu, PS, Jiawei Han.: Graph indexing: A frequent structure-based approach. In: SIGMOD June 13\u201318, 2004, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"issue":"3","key":"952_CR34","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s41019-021-00163-3","volume":"6","author":"W Yanping","year":"2021","unstructured":"Yanping, W., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. Data Sci. Eng. 6(3), 310\u2013322 (2021)","journal-title":"Data Sci. Eng."},{"key":"952_CR35","unstructured":"Zheng, L., Li, X., Zheng, Y., Huang, Y., Liao, X., Jin, H., Xue, J., Shao, Z., Hua, Q.-S.: Scaph: Scalable GPU-accelerated graph processing with value-driven differential scheduling. In: USENIX Annual Technical Conference, pp. 573\u2013588 (2020)"},{"issue":"8","key":"952_CR36","first-page":"482","volume":"4","author":"L Zou","year":"2011","unstructured":"Zou, L., Mo, J., Chen, L., Tamer \u00d6zsu, M., Zhao, D.: gstore: Answering SPARQL queries via subgraph matching. PVLDB 4(8), 482\u2013493 (2011)","journal-title":"PVLDB"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00952-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00952-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00952-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T12:09:49Z","timestamp":1652270989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00952-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["952"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00952-w","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2021,10,26]]},"assertion":[{"value":"16 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}