{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T22:57:42Z","timestamp":1756076262218},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T00:00:00Z","timestamp":1542672000000},"content-version":"tdm","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":["61772229"],"award-info":[{"award-number":["61772229"]}],"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":["61472162"],"award-info":[{"award-number":["61472162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s12083-018-0697-2","type":"journal-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T00:08:26Z","timestamp":1542672506000},"page":"1385-1402","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["QuickSquad: A new single-machine graph computing framework for detecting fake accounts in large-scale social networks"],"prefix":"10.1007","volume":"12","author":[{"given":"Xinyang","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mianxiong","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,20]]},"reference":[{"issue":"9","key":"697_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal A, Vitter J, et al. (1988) The input\/output complexity of sorting and related problems. Commun ACM 31(9):1116\u20131127","journal-title":"Commun ACM"},{"key":"697_CR2","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/ACCESS.2017.2656635","volume":"5","author":"M Al-Qurishi","year":"2017","unstructured":"Al-Qurishi M, Al-Rakhami M, Alamri A, Alrubaian M, Mizanur Rahman Sk Md, Shamim Hossain M (2017) Sybil defense techniques in online social networks A survey. IEEE Access 5:1200\u20131219","journal-title":"IEEE Access"},{"key":"697_CR3","first-page":"P10008","volume":"10","author":"VD Blondel","year":"2011","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre \u00c9 (2011) The louvain method for community detection in large networks. J Stat Mech Theory Exper 10:P10008","journal-title":"J Stat Mech Theory Exper"},{"key":"697_CR4","doi-asserted-by":"crossref","unstructured":"Boshmaf Y, Logothetis D, Siganos G, Ler\u00eda J, Lorenzo J, Ripeanu M, Beznosov K (2015) Integro: Leveraging victim prediction for robust fake account detection in osns. In: NDSS. Citeseer, vol 15, pp 8\u201311","DOI":"10.14722\/ndss.2015.23260"},{"issue":"Supplement C","key":"697_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ins.2017.02.030","volume":"394-395","author":"J Cao","year":"2017","unstructured":"Cao J, Fu Q, Li Q, Guo D (2017) Discovering hidden suspicious accounts in online social networks. Inform Sci 394-395(Supplement C):123\u2013140","journal-title":"Inform Sci"},{"issue":"1","key":"697_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10766-014-0330-9","volume":"44","author":"J Cao","year":"2016","unstructured":"Cao J, Li Q, Ji Y, He Y, Guo D (2016) Detection of forwarding-based malicious urls in online social networks. Int J Parallel Programm 44(1):163\u2013180","journal-title":"Int J Parallel Programm"},{"key":"697_CR7","unstructured":"Cao Q, Sirivianos M, Yang X, Pregueiro T (2012) Aiding the detection of fake accounts in large scale social online services. In: Presented as part of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12), pp 197\u2013210"},{"key":"697_CR8","doi-asserted-by":"crossref","unstructured":"Cao Q, Yang X, Yu J, Palow C (2014) Uncovering large groups of active malicious accounts in online social networks. Inproceedings of the 2014 ACM SIGSAC Conference On Computer and Communications Security. . ACMpages 477\u2013488","DOI":"10.1145\/2660267.2660269"},{"key":"697_CR9","doi-asserted-by":"crossref","unstructured":"Cha M, Haddadi H, Benevenuto F, Gummadi KP (2010) Measuring User Influence in Twitter: The Million Follower Fallacy. In: Inproceedings of the 4th International AAAI Conference on Weblogs and Social Media (ICWSM), Washington DC","DOI":"10.1609\/icwsm.v4i1.14033"},{"issue":"10-17","key":"697_CR10","first-page":"30","volume":"10","author":"M Cha","year":"2010","unstructured":"Cha M, Haddadi H, Benevenuto F, Krishna Gummadi P (2010) Measuring user influence in twitter The million follower fallacy. ICWSM 10(10-17):30","journal-title":"ICWSM"},{"key":"697_CR11","doi-asserted-by":"crossref","unstructured":"Chen R, Shi J, Chen Y, Chen H (2015) Powerlyra: Differentiated graph computation and partitioning on skewed graphs. In: Proceedings of the Tenth European Conference on Computer Systems. ACM, pp 1","DOI":"10.1145\/2741948.2741970"},{"key":"697_CR12","doi-asserted-by":"crossref","unstructured":"Cheng J, Liu Q, Li Z, Fan W, Lui JCS, He C (2015) Venus: Vertex-centric streamlined graph computation on a single pc. In: Proceedings of the IEEE 31st International Conference on Data Engineering, ICDE \u201915, pp 1131\u20131142","DOI":"10.1109\/ICDE.2015.7113362"},{"key":"697_CR13","doi-asserted-by":"crossref","unstructured":"Cheng S, Zhang G, Shu J, Hu Q, Zheng W (2016) Fastbfs: Fast breadth-first graph search on a single server. In: 2016 IEEE International Parallel and Distributed Processing Symposium, 2016, Chicago, pp 303\u2013312","DOI":"10.1109\/IPDPS.2016.71"},{"key":"697_CR14","doi-asserted-by":"crossref","unstructured":"Chi Y, Dai G, Wang Y, Sun G, Li G, Yang H (2016) Nxgraph: an efficient graph processing system on a single machine. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, pp 409\u2013420","DOI":"10.1109\/ICDE.2016.7498258"},{"key":"697_CR15","unstructured":"Danezis G, Mittal P (2009) Sybilinfer: Detecting sybil nodes using social networks. In: NDSS. San Diego"},{"issue":"1","key":"697_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: Simplified data processing on large clusters. Commun ACM 51 (1):107\u2013113","journal-title":"Commun ACM"},{"issue":"2","key":"697_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s12083-016-0457-0","volume":"10","author":"X Deng","year":"2017","unstructured":"Deng X, Li G, Dong M, Ota K (2017) Finding overlapping communities based on markov chain and link clustering. Peer-to-Peer Netw Appl 10(2):411\u2013420","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"4","key":"697_CR18","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/JIOT.2016.2517405","volume":"3","author":"M Dong","year":"2016","unstructured":"Dong M, Ota K, Liu A (2016) Rmer: Reliable and energy-efficient data collection for large-scale wireless sensor networks. IEEE Internet Things J 3(4):511\u2013519","journal-title":"IEEE Internet Things J"},{"key":"697_CR19","doi-asserted-by":"crossref","unstructured":"Dong M, Ota K, Liu A, Guo M (2016) Joint optimization of lifetime and transport delay under reliability constraint wireless sensor networks. IEEE Transactions on Parallel & Distributed Systems 27(1):225\u2013236","DOI":"10.1109\/TPDS.2015.2388482"},{"key":"697_CR20","unstructured":"Egele M, Stringhini G, Kruegel C, Vigna G (2013) Compa: Detecting compromised accounts on social networks. In: NDSS"},{"key":"697_CR21","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM \u201999, p 251\u2013262","DOI":"10.1145\/316188.316229"},{"key":"697_CR22","unstructured":"Apache Giraph. http:\/\/giraph.apache.org\/"},{"key":"697_CR23","unstructured":"Gonzalez J, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: Distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201912, pp 17\u201330"},{"key":"697_CR24","unstructured":"Gonzalez J, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) Graphx: Graph processing in a distributed dataflow framework. In: Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201914, pp 599\u2013613"},{"key":"697_CR25","unstructured":"Gualdron H, Cordeiro R, Rodrigues Jr JF, Chau DHP, Kahng M, Kang U (2015) M-flash: Fast billion-scale graph computation using block partition model. arXiv: 1506.01406"},{"issue":"2","key":"697_CR26","doi-asserted-by":"publisher","first-page":"205395171667423","DOI":"10.1177\/2053951716674236","volume":"3","author":"S Gurajala","year":"2016","unstructured":"Gurajala S, White JS, Hudson B, Voter BR, Matthews JN (2016) Profile characteristics of fake twitter accounts. Big Data Soc 3(2):2053951716674236","journal-title":"Big Data Soc"},{"key":"697_CR27","unstructured":"Gy\u00f6ngyi Z, Garcia-Molina H, Pedersen J (2004) Combating web spam with trustrank. In: Proceedings of the Thirtieth international conference on Very large data bases. VLDB Endowment, Vol 30, pp 576\u2013587"},{"key":"697_CR28","unstructured":"H\u00f6ner J, Nakajima S, Bauer A, M\u00fcller K-R, G\u00f6rnitz N (2017) Minimizing trust leaks for robust sybil detection. In: International Conference on Machine Learning, pp 1520\u20131528"},{"issue":"3","key":"697_CR29","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1109\/JSYST.2014.2308391","volume":"10","author":"Y Hu","year":"2016","unstructured":"Hu Y, Dong M, Ota K, Liu A, Guo M (2016) Mobile target detection in wireless sensor networks with adjustable sensing frequency. IEEE Syst J 10(3):1160\u20131171","journal-title":"IEEE Syst J"},{"issue":"3","key":"697_CR30","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/spe.504","volume":"33","author":"J J\u00e4rvi","year":"2003","unstructured":"J\u00e4rvi J, Powell G, Lumsdaine A (2003) The lambda library: unnamed functions in c++. Softw Pract Exper 33(3):259\u2013291","journal-title":"Softw Pract Exper"},{"key":"697_CR31","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.cose.2016.01.007","volume":"58","author":"Y Ji","year":"2016","unstructured":"Ji Y, He Y, Jiang X, Cao J, Li Q (2016) Combating the evasion mechanisms of social bots. Comput Secur 58:230\u2013249","journal-title":"Comput Secur"},{"issue":"3","key":"697_CR32","doi-asserted-by":"publisher","first-page":"297","DOI":"10.14778\/3157794.3157799","volume":"11","author":"Z Jia","year":"2017","unstructured":"Jia Z, Kwon Y, Shipman G, McCormick P, Erez M, Aiken A (2017) A distributed multi-gpu system for fast graph processing. Proc VLDB Endow 11(3):297\u2013310","journal-title":"Proc VLDB Endow"},{"key":"697_CR33","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S (2010) What is twitter, a social network or a news media?. In: Proceedings of the 19th International Conference on World Wide Web, WWW \u201910, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"key":"697_CR34","unstructured":"Kyrola A, Blelloch G, Guestrin C (2012) 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"},{"issue":"3","key":"697_CR35","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2004","unstructured":"Langville AN, Meyer CD (2004) Deeper inside pagerank. Internet Math 1(3):335\u2013380","journal-title":"Internet Math"},{"issue":"1","key":"697_CR36","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: Densification and shrinking diameters. ACM Trans Knowl Discov Data (TKDD) 1(1):2","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"1","key":"697_CR37","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"697_CR38","doi-asserted-by":"crossref","unstructured":"Liu C, Gao P, Wright M, Mittal P (2015) Exploiting temporal dynamics in sybil defenses. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 805\u2013816","DOI":"10.1145\/2810103.2813693"},{"key":"697_CR39","doi-asserted-by":"crossref","unstructured":"Liu H, Howie Huang H (2015) Enterprise: Breadth-first graph traversal on gpus. In: 2015 SC-International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, pp 1\u201312","DOI":"10.1145\/2807591.2807594"},{"key":"697_CR40","unstructured":"Liu H, Howie Huang H (2017) Graphene Fine-grained io management for graph computing. In: FAST, pp 285\u2013300"},{"key":"697_CR41","doi-asserted-by":"crossref","unstructured":"Liu Y, Ji S, Mittal P (2016) Smartwalk: Enhancing social network security via adaptive random walks. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 492\u2013503","DOI":"10.1145\/2976749.2978319"},{"issue":"9","key":"697_CR42","doi-asserted-by":"publisher","first-page":"2013","DOI":"10.1109\/TIFS.2016.2570740","volume":"11","author":"Y Liu","year":"2016","unstructured":"Liu Y, Dong M, Ota K, Liu A (2016) Activetrust: secure and trustable routing in wireless sensor networks. IEEE Trans Inf Forensic Secur 11(9):2013\u20132027","journal-title":"IEEE Trans Inf Forensic Secur"},{"issue":"8","key":"697_CR43","doi-asserted-by":"publisher","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 JM (2012) Distributed graphlab: A framework for machine learning and data mining in the cloud. Proc VLDB Endow 5(8):716\u2013 727","journal-title":"Proc VLDB Endow"},{"key":"697_CR44","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik Aart J, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: A system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201910, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"697_CR45","doi-asserted-by":"crossref","unstructured":"McCune RR, Weninger T, Madey GR (2015) Thinking like a vertex: a survey of vertex-centric frameworks for distributed graph processing. CoRR, arXiv: 1507.04405","DOI":"10.1145\/2818185"},{"key":"697_CR46","unstructured":"Merrill D, Garland M, Grimshaw A (2012) Scalable gpu graph traversal. In ACM SIGPLAN Notices. ACM, vol 47, pp 117\u2013128"},{"key":"697_CR47","doi-asserted-by":"crossref","unstructured":"Mohaisen A, Hopper N, Kim Y (2011) Keep your friends close: Incorporating trust into social network-based sybil defenses. In: 2011 Proceedings IEEE INFOCOM. IEEE, pp 1943\u20131951","DOI":"10.1109\/INFCOM.2011.5934998"},{"key":"697_CR48","doi-asserted-by":"crossref","unstructured":"Mulamba D, Ray I, Ray I (2016) Sybilradar: A graph-structure based framework for sybil detection in on-line social networks. In: IFIP International Information Security and Privacy Conference. Springer, pp 179\u2013193","DOI":"10.1007\/978-3-319-33630-5_13"},{"issue":"2","key":"697_CR49","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"key":"697_CR50","doi-asserted-by":"crossref","unstructured":"Roy A, Mihailovic I, Zwaenepoel W (2013) X-stream: Edge-centric graph processing using streaming partitions. In: Proceedings of the 24th ACM Symposium on Operating Systems Principles, SOSP \u201913, New York, pp 472\u2013488","DOI":"10.1145\/2517349.2522740"},{"issue":"6","key":"697_CR51","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/3128571","volume":"50","author":"X Shi","year":"2018","unstructured":"Shi X, Zheng Z, Zhou Y, Jin H, He L, Bo L, Hua Q-S (2018) Graph processing on gpus A survey. ACM Comput Surv (CSUR) 50(6):81","journal-title":"ACM Comput Surv (CSUR)"},{"key":"697_CR52","doi-asserted-by":"crossref","unstructured":"Tran N, Li J, Subramanian L, Chow SSM (2011) Optimal sybil-resilient node admission control. In: INFOCOM 2011 Proceedings IEEE. IEEE, pp 3218\u20133226","DOI":"10.1109\/INFCOM.2011.5935171"},{"issue":"8","key":"697_CR53","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111","journal-title":"Commun ACM"},{"issue":"4","key":"697_CR54","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/1851275.1851226","volume":"40","author":"B Viswanath","year":"2010","unstructured":"Viswanath B, Post A, Gummadi KP, Mislove A (2010) An analysis of social network-based sybil defenses. ACM SIGCOMM Comput Commun Rev 40(4):363\u2013374","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"697_CR55","unstructured":"Wang G, Konolige T, Wilson C, Wang X, Zheng H, Zhao BY (2013) You are how you click: Clickstream analysis for sybil detection. In: Proceedings of USENIX Security. Citeseer, pp 1\u201315"},{"key":"697_CR56","doi-asserted-by":"crossref","unstructured":"Xue J, Yang Z, Yang X, Wang X, Chen L, Dai Y (2013) Votetrust: Leveraging friend invitation graph to defend against social network sybils. In: 2013 Proceedings IEEE INFOCOM. IEEE, pp 2400\u20132408","DOI":"10.1109\/INFCOM.2013.6567045"},{"key":"697_CR57","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. CoRR, arXiv: 1205.6233"},{"issue":"1","key":"697_CR58","first-page":"2","volume":"8","author":"Z Yang","year":"2014","unstructured":"Yang Z, Wilson C, Wang X, Gao T, Zhao BY, Dai Y (2014) Uncovering social network sybils in the wild. ACM Trans Knowl Discov Data (TKDD) 8(1):2","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"3","key":"697_CR59","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2034575.2034593","volume":"42","author":"H Yu","year":"2011","unstructured":"Yu H (2011) Sybil defenses via social networks: a tutorial and survey. ACM SIGACT News 42(3):80\u2013101","journal-title":"ACM SIGACT News"},{"key":"697_CR60","doi-asserted-by":"crossref","unstructured":"Yu H, Gibbons PB, Kaminsky M, Xiao F (2008) Sybillimit: A near-optimal social network defense against sybil attacks. In: 2008. SP 2008. IEEE Symposium on Security and Privacy. IEEE, pp 3\u201317","DOI":"10.1109\/SP.2008.13"},{"issue":"4","key":"697_CR61","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/1151659.1159945","volume":"36","author":"H Yu","year":"2006","unstructured":"Yu H, Kaminsky M, Gibbons PB, Flaxman A (2006) Sybilguard: defending against sybil attacks via social networks. ACM SIGCOMM Comput Commun Rev 36(4):267\u2013278","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"4","key":"697_CR62","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MITP.2016.71","volume":"18","author":"C Zhang","year":"2016","unstructured":"Zhang C, Dong M, Ota K, Guo M (2016) A social-network-optimized taxi-sharing service. IT Prof 18(4):34\u201340","journal-title":"IT Prof"},{"key":"697_CR63","doi-asserted-by":"crossref","unstructured":"Zhang J, Li Q, Wang X, Feng B, Guo D (Jun 2017) Towards fast and lightweight spam account detection in mobile social networks through fog computing. Peer-to-Peer Networking and Applications","DOI":"10.1007\/s12083-017-0559-3"},{"key":"697_CR64","unstructured":"Zheng D, Burns R, Szalay AS (2013) Toward millions of file system iops on lowcost, commodity hardware. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC\u201913. ACM, New York, pp 69:1\u201369:12"},{"key":"697_CR65","unstructured":"Zheng D, Mhembere D, Burns R, Vogelstein J, Priebe CE, Szalay AS (2015) Flashgraph: Processing billion-node graphs on an array of commodity ssds. In: Proceedings of the 13th USENIX Conference on File and Storage Technologies, FAST\u201915, pp 45\u201358"},{"key":"697_CR66","unstructured":"Zhu X, Han W, Chen W (2015) Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: 2015 USENIX Annual Technical Conference, USENIX ATC\u201915, Santa Clara, pp 375\u2013386"},{"key":"697_CR67","unstructured":"Zhu X, Chen W, Zheng W, Ma X (2016) Gemini: A computation-centric distributed graph processing system. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)(Savannah, GA"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-018-0697-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-018-0697-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-018-0697-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T08:41:14Z","timestamp":1694076074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-018-0697-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,20]]},"references-count":67,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["697"],"URL":"https:\/\/doi.org\/10.1007\/s12083-018-0697-2","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,20]]},"assertion":[{"value":"16 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}