{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:30Z","timestamp":1740123870728,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T00:00:00Z","timestamp":1508716800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Fundamental Reseach Funds for the Central Universities of China","award":["2017KFYXJJ066"],"award-info":[{"award-number":["2017KFYXJJ066"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61433019"],"award-info":[{"award-number":["61433019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Planning Project of Guangdong Province, China","award":["2016B030306003","2016B030305002"],"award-info":[{"award-number":["2016B030306003","2016B030305002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10766-017-0532-z","type":"journal-article","created":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T20:54:40Z","timestamp":1508792080000},"page":"668-685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BlockGraphChi: Enabling Block Update in Out-of-Core Graph Processing"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2139-6465","authenticated-orcid":false,"given":"Zhiyuan","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenjie","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,23]]},"reference":[{"key":"532_CR1","unstructured":"Auroux, L., Burelle, M., Erra, R.: Reordering very large graphs for fun and profit. In: International Symposium on Web AlGorithms(2015)"},{"key":"532_CR2","doi-asserted-by":"crossref","unstructured":"Baluja, S., Seth, R., Sivakumar, D., Jing, Y., Yagnik, J., Kumar, S., Ravichandran, D., Aly, M.: Video suggestion and discovery for youtube: taking random walks through the view graph. In: Proceedings of the 17th International Conference on World Wide Web, WWW \u201908, pp. 895\u2013904 (2008)","DOI":"10.1145\/1367497.1367618"},{"issue":"1","key":"532_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"532_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L","volume":"36","author":"M Erwig","year":"2000","unstructured":"Erwig, M., Hagen, F.: The graph voronoi diagram with applications. Networks 36(3), 156\u2013163 (2000)","journal-title":"Networks"},{"key":"532_CR5","doi-asserted-by":"crossref","unstructured":"Fleischer, L.K., Hendrickson, B., P\u0131nar, A.: On identifying strongly connected components in parallel. In: Parallel and Distributed Processing, Springer, New York, pp. 505\u2013511 (2000)","DOI":"10.1007\/3-540-45591-4_68"},{"key":"532_CR6","first-page":"177","volume":"9","author":"J Gonzalez","year":"2009","unstructured":"Gonzalez, J., Low, Y., Guestrin, C.: Residual splash for optimally parallelizing belief propagation. AISTATS 9, 177\u2013184 (2009)","journal-title":"AISTATS"},{"key":"532_CR7","doi-asserted-by":"crossref","unstructured":"Han, W.S., Lee, S., Park, K., Lee, J.H., Kim, M.S., Kim, J., Yu, H.: TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC. In: Proceedings of KDD, pp. 77\u201385 (2013)","DOI":"10.1145\/2487575.2487581"},{"key":"532_CR8","doi-asserted-by":"crossref","unstructured":"Hong, S., Rodia, N.C., Olukotun, K.: On fast parallel detection of strongly connected components (SCC) in small-world graphs. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC \u201913, pp. 92:1\u201392:11 (2013)","DOI":"10.1145\/2503210.2503246"},{"key":"532_CR9","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: Pegasus: A peta-scale graph mining system implementation and observations. In: Proceedings of the 2009 Ninth IEEE International Conference on Data Mining, ICDM \u201909, pp. 229\u2013238 (2009)","DOI":"10.1109\/ICDM.2009.14"},{"issue":"1","key":"532_CR10","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevelk-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"532_CR11","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: Large-scale graph computation on just a pc. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201912, pp. 31\u201346 (2012)"},{"key":"532_CR12","doi-asserted-by":"crossref","unstructured":"Kyrola, A., Shun, J., Blelloch, G.: Beyond synchronous: new techniques for external-memory graph connectivity and minimum spanning forest. In: International Symposium on Experimental Algorithms, Springer, New York, pp. 123\u2013137 (2014)","DOI":"10.1007\/978-3-319-07959-2_11"},{"key":"532_CR13","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: stanford large network dataset collection. \n                    http:\/\/snap.stanford.edu\/data\n                    \n                   (2014)"},{"key":"532_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th International Conference on World Wide Web, ACM, New York, NY, USA, WWW \u201908, pp. 695\u2013704 (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"532_CR15","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"532_CR16","unstructured":"Mihalcea, R., Tarau, P.: Textrank: bringing order into texts. In: Lin, D., Wu, D. (eds.) Proceedings of EMNLP 2004, Association for Computational Linguistics, Barcelona, Spain, pp.\u00a0404\u2013411 (2004)"},{"issue":"2","key":"532_CR17","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"532_CR18","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. In: Proceedings of the 7th International World Wide Web Conference, Brisbane, Australia, pp. 161\u2013172 (1998)"},{"key":"532_CR19","doi-asserted-by":"crossref","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-stream: edge-centric graph processing using streaming partitions. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, ACM, pp. 472\u2013488 (2013)","DOI":"10.1145\/2517349.2522740"},{"issue":"6","key":"532_CR20","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1007\/s10766-016-0468-8","volume":"45","author":"Z Shao","year":"2017","unstructured":"Shao, Z., He, J., Lv, H., Jin, H.: Fog: A fast out-of-core graph processing framework. Int. J. Parallel Program. 45(6), 1259\u20131272 (2017)","journal-title":"Int. J. Parallel Program."},{"key":"532_CR21","unstructured":"Sminia, T., Orzan, S.: On distributed verification and verified distribution. Ph.D. thesis, Vrije Universiteit (2004)"},{"issue":"2","key":"532_CR22","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"532_CR23","doi-asserted-by":"publisher","first-page":"193","DOI":"10.14778\/2732232.2732238","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., McPherson, J.: From think like a vertex to think like a graph. Proc. VLDB Endow. 7(3), 193\u2013204 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"532_CR24","doi-asserted-by":"crossref","unstructured":"Wei, H., Yu, J.X., Lu, C., Lin, X.: Speedup graph processing by graph ordering. In: Proceedings of the 2016 International Conference on Management of Data, ACM, pp. 1813\u20131828 (2016)","DOI":"10.1145\/2882903.2915220"},{"issue":"14","key":"532_CR25","doi-asserted-by":"publisher","first-page":"2014","DOI":"10.14778\/2556549.2556581","volume":"6","author":"W Xie","year":"2013","unstructured":"Xie, W., Wang, G., Bindel, D., Demers, A., Gehrke, J.: Fast iterative graph computation with block updates. Proc. VLDB Endow. 6(14), 2014\u20132025 (2013)","journal-title":"Proc. VLDB Endow."},{"issue":"14","key":"532_CR26","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.14778\/2733085.2733103","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Blogel: a block-centric framework for distributed computation on real-world graphs. Proc. VLDB Endow. 7(14), 1981\u20131992 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"1\u20132","key":"532_CR27","doi-asserted-by":"publisher","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":"532_CR28","unstructured":"Zhu, X., Ghahramani, Z.: Learning from labeled and unlabeled data with label propagation. Tech. rep., CMU CLAD (2002)"},{"key":"532_CR29","unstructured":"Zhu, X., Han, W., Chen, W.: Gridgraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: 2015 USENIX Annual Technical Conference (USENIX ATC 15), pp. 375\u2013386 (2015)"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-017-0532-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-017-0532-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-017-0532-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T21:40:59Z","timestamp":1568929259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-017-0532-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,23]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["532"],"URL":"https:\/\/doi.org\/10.1007\/s10766-017-0532-z","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2017,10,23]]},"assertion":[{"value":"5 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}