{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:27Z","timestamp":1740123867585,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10766-016-0468-8","type":"journal-article","created":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T04:49:09Z","timestamp":1477975749000},"page":"1259-1272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["FOG: A Fast Out-of-Core Graph Processing Framework"],"prefix":"10.1007","volume":"45","author":[{"given":"Zhiyuan","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiming","family":"Lv","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":[[2016,11,1]]},"reference":[{"key":"468_CR1","unstructured":"Apache: Apache Giraph. http:\/\/giraph.apache.org\/ (2012)"},{"key":"468_CR2","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: Proceedings of KDD, pp. 44\u201354 (2006)","DOI":"10.1145\/1150402.1150412"},{"key":"468_CR3","doi-asserted-by":"crossref","unstructured":"Beamer, S., Asanovi\u0107, K., Patterson, D.: Direction-optimizing breadth-first search. In: Proceedings of SC, pp. 12:1\u201312:10 (2012)","DOI":"10.1109\/SC.2012.50"},{"key":"468_CR4","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Brodal, G.S., Fagerberg, R., Jacob, R., Vicari, E.: Optimal sparse matrix dense vector multiplication in the I\/O-model. In: Proceedings of SPAA, pp. 61\u201370 (2007)","DOI":"10.1145\/1248377.1248391"},{"key":"468_CR5","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of WWW, pp. 587\u2013596 (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"468_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Liu, Q., Li, Z., Fan, W., Lui, J., He, C.: VENUS: vertex-centric streamlined graph computation on a single PC. In: ICDE, pp. 1131\u20131142 (2015)","DOI":"10.1109\/ICDE.2015.7113362"},{"key":"468_CR7","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: Proceedings of OSDI, pp. 17\u201330 (2012)"},{"issue":"12","key":"468_CR8","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.14778\/2732977.2732980","volume":"7","author":"M Han","year":"2014","unstructured":"Han, M., Daudjee, K., Ammar, K., \u00d6zsu, M.T., Wang, X., Jin, T.: An experimental comparison of pregel-like graph processing systems. Proc VLDB Endow 7(12), 1047\u20131058 (2014)","journal-title":"Proc VLDB Endow"},{"key":"468_CR9","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":"468_CR10","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: Proceedings of WWW, pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"468_CR11","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: GraphChi: large-scale graph computation on just a PC. In: Proceedings of OSDI, pp. 31\u201346 (2012)"},{"key":"468_CR12","unstructured":"Lawrence, P., Sergey, B., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford University (1998)"},{"key":"468_CR13","doi-asserted-by":"crossref","unstructured":"Lin, Z., Chau, D.H., U K: Leveraging memory mapping for fast and scalable graph computation on a PC. In: Proceedings of Big Data, pp. 95\u201398 (2013)","DOI":"10.1109\/BigData.2013.6691739"},{"issue":"8","key":"468_CR14","doi-asserted-by":"crossref","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed GraphLab: a framework for machine learning and data mining in the cloud. Proc VLDB Endow 5(8), 716\u2013727 (2012)","journal-title":"Proc VLDB Endow"},{"key":"468_CR15","unstructured":"Prabhakaran, V., Wu, M., Weng, X., McSherry, F., Zhou, L., Haridasan, M.: Managing large graphs on multi-cores with graph awareness. In: Proceedings of USENIX ATC, pp. 4\u20134 (2012)"},{"key":"468_CR16","doi-asserted-by":"crossref","unstructured":"Roy A, Mihailovic I, Zwaenepoel W: X-Stream: edge-centric graph processing using streaming partitions. In: Proceedings of SOSP, pp. 472\u2013488 (2013)","DOI":"10.1145\/2517349.2522740"},{"key":"468_CR17","unstructured":"Yahoo: Yahoo WebScope. Yahoo! altavista web page hyperlink connectivity graph. http:\/\/webscope.sandbox.yahoo.com\/ (2002)"},{"key":"468_CR18","unstructured":"Zheng, D., Mhembere, D., Burns, R., Vogelstein, J., Priebe, C.E., Szalay, A.S.: FlashGraph: processing billion-node graphs on an array of commodity SSDs. In: Proceedings of FAST, pp. 45\u201358 (2015)"},{"key":"468_CR19","unstructured":"Zhu, X., Han, W., Chen, W.: GridGraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: Proceedings of USENIX ATC, pp. 375\u2013386 (2015)"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-016-0468-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-016-0468-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-016-0468-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T01:32:44Z","timestamp":1568511164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-016-0468-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,1]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["468"],"URL":"https:\/\/doi.org\/10.1007\/s10766-016-0468-8","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2016,11,1]]}}}