{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:07:43Z","timestamp":1777637263867,"version":"3.51.4"},"reference-count":111,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:00:00Z","timestamp":1549411200000},"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":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10619-019-07256-z","type":"journal-article","created":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T06:10:04Z","timestamp":1549433404000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An investigation of big graph partitioning methods for distribution of graphs in vertex-centric systems"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6061-714X","authenticated-orcid":false,"given":"Nasrin","family":"Mazaheri Soudani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1184-5917","authenticated-orcid":false,"given":"Afsaneh","family":"Fatemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4374-9228","authenticated-orcid":false,"given":"Mohammadali","family":"Nematbakhsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"issue":"11","key":"7256_CR1","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.14778\/3236187.3236208","volume":"11","author":"Z Abbas","year":"2018","unstructured":"Abbas, Z., Kalavri, V., Carbone, P., Vlassov, V.: Streaming graph partitioning: an experimental study. Proc. VLDB Endow. 11(11), 1590\u20131603 (2018). \nhttps:\/\/doi.org\/10.14778\/3236187.3236208","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR2","doi-asserted-by":"publisher","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: Proceedings 20th IEEE International Parallel Distributed Processing Symposium (2006). \nhttps:\/\/doi.org\/10.1109\/IPDPS.2006.1639360","DOI":"10.1109\/IPDPS.2006.1639360"},{"key":"7256_CR3","unstructured":"Akhremtsev, Y., Sanders, P., Schulz, C.: High-quality shared-memory graph partitioning (2017). \narXiv:1710.08231"},{"key":"7256_CR4","unstructured":"Aslam, S.: Twitter by the numbers: stats, demographics and fun facts (2018). \nhttps:\/\/www.omnicoreagency.com\/twitter-statistics\/"},{"key":"7256_CR5","doi-asserted-by":"crossref","unstructured":"Aydin, K., Bateni, M., Mirrokni, V.: Distributed balanced partitioning via linear embedding. In: Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, pp. 387\u2013396. ACM, New York (2016)","DOI":"10.1145\/2835776.2835829"},{"issue":"2","key":"7256_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/606272.606299","volume":"46","author":"H Balakrishnan","year":"2003","unstructured":"Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in p2p systems. Commun. ACM 46(2), 43\u201348 (2003). \nhttps:\/\/doi.org\/10.1145\/606272.606299","journal-title":"Commun. ACM"},{"key":"7256_CR7","doi-asserted-by":"publisher","unstructured":"Bao, N.T., Suzumura, T.: Towards highly scalable pregel-based graph processing platform with x10. In: Proceedings of the 22Nd International Conference on World Wide Web (WWW \u201913) Companion, pp. 501\u2013508. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2487788.2487984","DOI":"10.1145\/2487788.2487984"},{"key":"7256_CR8","volume-title":"Random Graphs","author":"B Bollobs","year":"1998","unstructured":"Bollobs, B.: Random Graphs. Springer, New York (1998)"},{"key":"7256_CR9","unstructured":"Borthakur, D.: HDFS Architecture Guide. Apache Hadoop Project (2008)"},{"key":"7256_CR10","doi-asserted-by":"publisher","unstructured":"Bourse, F., Lelarge, M., Vojnovic, M.: Balanced graph edge partition. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201914), pp. 1456\u20131465. ACM, New York (2014). \nhttps:\/\/doi.org\/10.1145\/2623330.2623660","DOI":"10.1145\/2623330.2623660"},{"issue":"2","key":"7256_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.14778\/2735471.2735477","volume":"8","author":"Y Bu","year":"2014","unstructured":"Bu, Y., Borkar, V., Jia, J., Carey, M.J., Condie, T.: Pregelix: big(ger) graph analytics on a dataflow engine. Proc. VLDB Endow. 8(2), 161\u2013172 (2014). \nhttps:\/\/doi.org\/10.14778\/2735471.2735477","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"7256_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"TN Bui","year":"1992","unstructured":"Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is np-hard. Inf. Process. Lett. 42(3), 153\u2013159 (1992). \nhttps:\/\/doi.org\/10.1016\/0020-0190(92)90140-Q","journal-title":"Inf. Process. Lett."},{"key":"7256_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-49487-6-4","volume-title":"Algorithm Engineering","author":"A Bulu\u00e7","year":"2016","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, pp. 117\u2013158. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49487-6-4"},{"key":"7256_CR14","doi-asserted-by":"publisher","unstructured":"Cao, Y., Rao, R.: A streaming graph partitioning approach on imbalance cluster. In: 2016 18th International Conference on Advanced Communication Technology (ICACT), pp. 360\u2013364 (2016). \nhttps:\/\/doi.org\/10.1109\/ICACT.2016.7423392","DOI":"10.1109\/ICACT.2016.7423392"},{"key":"7256_CR15","doi-asserted-by":"publisher","unstructured":"Chen, R., Shi, J., Chen, Y., Chen, H.: Powerlyra: differentiated graph computation and partitioning on skewed graphs. In: Proceedings of the Tenth European Conference on Computer Systems (EuroSys \u201915), pp. 1:1\u20131:15. ACM, New York (2015). \nhttps:\/\/doi.org\/10.1145\/2741948.2741970","DOI":"10.1145\/2741948.2741970"},{"key":"7256_CR16","doi-asserted-by":"crossref","unstructured":"Chen, T., Li, B.: A distributed graph partitioning algorithm for processing large graphs. In: 2016 IEEE Symposium on Service-Oriented System Engineering (SOSE), pp. 53\u201359 (2016)","DOI":"10.1109\/SOSE.2016.48"},{"key":"7256_CR17","unstructured":"Ching, A.: Giraph: production-grade graph processing infrastructure for trillion edge graphs. In: ATPESC, vol. 14 (2014)"},{"issue":"12","key":"7256_CR18","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.14778\/2824032.2824077","volume":"8","author":"A Ching","year":"2015","unstructured":"Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., Muthukrishnan, S.: One trillion edges: graph processing at Facebook-scale. Proc. VLDB Endow. 8(12), 1804\u20131815 (2015). \nhttps:\/\/doi.org\/10.14778\/2824032.2824077","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"7256_CR19","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2","volume":"18","author":"A Condon","year":"2001","unstructured":"Condon, A., Karp, R.M.: Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms 18(2), 116\u2013140 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"7256_CR20","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H.: Introduction to algorithms. MIT, Cambridge (2009)"},{"key":"7256_CR21","unstructured":"Cui, H., Cipar, J., Ho, Q., Kim, J.K., Lee, S., Kumar, A., Wei, J., Dai, W., Ganger, G.R., Gibbons, P.B., et\u00a0al.: Exploiting bounded staleness to speed up big data analytics. In: USENIX Annual Technical Conference, pp. 37\u201348 (2014)"},{"issue":"2","key":"7256_CR22","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/5992.988653","volume":"4","author":"K Devine","year":"2002","unstructured":"Devine, K., Boman, E., Heaphy, R., Hendrickson, B., Vaughan, C.: Zoltan data management services for parallel dynamic applications. Comput. Sci. Eng. 4(2), 90\u201397 (2002)","journal-title":"Comput. Sci. Eng."},{"key":"7256_CR23","doi-asserted-by":"publisher","unstructured":"Dindokar, R., Simmhan, Y.: Elastic partition placement for non-stationary graph algorithms. In: 2016 16th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), pp. 90\u201393 (2016). \nhttps:\/\/doi.org\/10.1109\/CCGrid.2016.97","DOI":"10.1109\/CCGrid.2016.97"},{"issue":"6","key":"7256_CR24","doi-asserted-by":"publisher","first-page":"e3849","DOI":"10.1002\/cpe.3849","volume":"29","author":"Fang Dong","year":"2016","unstructured":"Dong, F., Zhang, J., Luo, J., Shen, D., Jin, J.: Enabling application-aware flexible graph partition mechanism for parallel graph processing systems. Concurr. Comput. Pract. Exp. 29(6), e3849 (2017). \nhttps:\/\/doi.org\/10.1002\/cpe.3849\n\n, e3849 cpe.3849","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"7256_CR25","unstructured":"Donnelly, G.: 75 super-useful Facebook statistics for 2018 (2018). \nhttps:\/\/www.wordstream.com\/blog\/ws\/2017\/11\/07\/facebook-statistics"},{"key":"7256_CR26","doi-asserted-by":"publisher","unstructured":"Echbarthi, G., Kheddouci, H.: Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning. In: 2014 IEEE International Conference on Big Data (Big Data), pp. 25\u201332 (2014). \nhttps:\/\/doi.org\/10.1109\/BigData.2014.7004368","DOI":"10.1109\/BigData.2014.7004368"},{"key":"7256_CR27","doi-asserted-by":"publisher","unstructured":"Echbarthi, G., Kheddouci, H.: Streaming metis partitioning. In: 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 17\u201324 (2016). \nhttps:\/\/doi.org\/10.1109\/ASONAM.2016.7752208","DOI":"10.1109\/ASONAM.2016.7752208"},{"key":"7256_CR28","unstructured":"Elsner, U.: Graph partitioning\u2014a survey. Technical Report SFB393\/97-27 (1997)"},{"key":"7256_CR29","volume-title":"Algorithms for Graph Partitioning: A Survey","author":"PO Fjllstrm","year":"1998","unstructured":"Fjllstrm, P.O.: Algorithms for Graph Partitioning: A Survey, vol. 3. Linkping University Electronic Press, Linkping (1998)"},{"key":"7256_CR30","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI), vol. 12, pp. 17\u201330 (2012)"},{"issue":"10","key":"7256_CR31","doi-asserted-by":"publisher","first-page":"103,018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103,018 (2010)","journal-title":"New J. Phys."},{"key":"7256_CR32","unstructured":"Guerrieri, A., Montresor, A.: Distributed edge partitioning for graph processing (2014). \narXiv:1403.6270"},{"key":"7256_CR33","first-page":"346","volume-title":"Lecture Notes in Computer Science","author":"Alessio Guerrieri","year":"2015","unstructured":"Guerrieri, A., Montresor, A.: DFEP: Distributed Funding-Based Edge Partitioning, Springer, Berlin, pp. 346\u2013358 (2015)"},{"key":"7256_CR34","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jpdc.2016.02.003","volume":"108","author":"Yong Guo","year":"2017","unstructured":"Guo, Y., Hong, S., Chafi, H., Iosup, A., Epema, D.: Modeling, analysis, and experimental comparison of streaming graph-partitioning policies. J. Parallel Distrib. Comput. 108, 106\u2013121. \nhttps:\/\/doi.org\/10.1016\/j.jpdc.2016.02.003\n\n. Special Issue on Scalable Computing Systems for Big Data Applications (2017)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"9","key":"7256_CR35","doi-asserted-by":"publisher","first-page":"950","DOI":"10.14778\/2777598.2777604","volume":"8","author":"M Han","year":"2015","unstructured":"Han, M., Daudjee, K.: Giraph unchained: barrierless asynchronous parallel execution in pregel-like graph processing systems. Proc. VLDB Endow. 8(9), 950\u2013961 (2015). \nhttps:\/\/doi.org\/10.14778\/2777598.2777604","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR36","doi-asserted-by":"publisher","unstructured":"Han, W., Miao, Y., Li, K., Wu, M., Yang, F., Zhou, L., Prabhakaran, V., Chen, W., Chen, E.: Chronos: A graph engine for temporal graph analysis. In: Proceedings of the Ninth European Conference on Computer Systems (EuroSys \u201914), pp. 1:1\u20131:14. ACM, New York (2014). \nhttps:\/\/doi.org\/10.1145\/2592798.2592799","DOI":"10.1145\/2592798.2592799"},{"issue":"12","key":"7256_CR37","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.14778\/2536274.2536291","volume":"6","author":"AM Hendawi","year":"2013","unstructured":"Hendawi, A.M., Bao, J., Mokbel, M.F.: iRoad: a framework for scalable predictive query processing on road networks. Proc. VLDB Endow. 6(12), 1262\u20131265 (2013). \nhttps:\/\/doi.org\/10.14778\/2536274.2536291","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR38","doi-asserted-by":"publisher","unstructured":"Hoque, I., Gupta, I.: Lfgraph: Simple and fast distributed graph analytics. In: Proceedings of the First ACM SIGOPS Conference on Timely Results in Operating Systems (TRIOS \u201913), pp. 9:1\u20139:17. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2524211.2524218","DOI":"10.1145\/2524211.2524218"},{"key":"7256_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.future.2017.06.027","volume":"80","author":"K Hu","year":"2018","unstructured":"Hu, K., Zeng, H.J.W.W.G.: Partitioning big graph with respect to arbitrary proportions in a streaming manner. Future Gen. Comput. Syst. 80, 1\u201311 (2018). \nhttps:\/\/doi.org\/10.1016\/j.future.2017.06.027","journal-title":"Future Gen. Comput. Syst."},{"issue":"1","key":"7256_CR40","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/BF00047572","volume":"12","author":"CR Hwang","year":"1988","unstructured":"Hwang, C.R.: Simulated annealing: theory and applications. Acta Appl. Math. 12(1), 108\u2013111 (1988). \nhttps:\/\/doi.org\/10.1007\/BF00047572","journal-title":"Acta Appl. Math."},{"key":"7256_CR41","doi-asserted-by":"publisher","unstructured":"Jain, N., Liao, G., Willke, T.L.: Graphbuilder: Scalable graph etl framework. In: First International Workshop on Graph Data Management Experiences and Systems (GRADES \u201913), pp. 4:1\u20134:6. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2484425.2484429","DOI":"10.1145\/2484425.2484429"},{"issue":"12","key":"7256_CR42","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.14778\/3229863.3236246","volume":"11","author":"M Junghanns","year":"2018","unstructured":"Junghanns, M., Kiessling, M., Teichmann, N., Gomez, K., Petermann, A., Rahm, E.: Declarative and distributed graph analytics with gradoop. Proc. VLDB Endow. 11(12), 2006\u20132009 (2018). \nhttps:\/\/doi.org\/10.14778\/3229863.3236246","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR43","doi-asserted-by":"publisher","unstructured":"Khayyat, Z., Awara, K., Alonazi, A., Jamjoom, H., Williams, D., Kalnis, P.: Mizan: A system for dynamic load balancing in large-scale graph processing. In: Proceedings of the 8th ACM European Conference on Computer Systems (EuroSys \u201913), pp. 169\u2013182. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2465351.2465369","DOI":"10.1145\/2465351.2465369"},{"issue":"3","key":"7256_CR44","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2500873","volume":"57","author":"GH Kim","year":"2014","unstructured":"Kim, G.H., Trimi, S., Chung, J.H.: Big-data applications in the government sector. Commun. ACM 57(3), 78\u201385 (2014). \nhttps:\/\/doi.org\/10.1145\/2500873","journal-title":"Commun. ACM"},{"key":"7256_CR45","unstructured":"Lang, K.: Finding good nearly balanced cuts in power law graphs. Technical Report YRL-2004-036, Yahoo! Research Labs (2004)"},{"issue":"4","key":"7256_CR46","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2094114.2094118","volume":"40","author":"KH Lee","year":"2012","unstructured":"Lee, K.H., Lee, Y.J., Choi, H., Chung, Y.D., Moon, B.: Parallel data processing with MapReduce: a survey. SIGMOD Rec. 40(4), 11\u201320 (2012). \nhttps:\/\/doi.org\/10.1145\/2094114.2094118","journal-title":"SIGMOD Rec."},{"issue":"1","key":"7256_CR47","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.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2 (2007). \nhttps:\/\/doi.org\/10.1145\/1217299.1217301","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"1","key":"7256_CR48","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"key":"7256_CR49","doi-asserted-by":"crossref","unstructured":"Lim, Y., Lee, W.J., Choi, H.J., Kang, U.: MTP: discovering high quality partitions in real world graphs. World Wide Web, pp. 1\u201324 (2016)","DOI":"10.1109\/35021BIGCOMP.2015.7072830"},{"issue":"7","key":"7256_CR50","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1016\/j.physa.2009.12.019","volume":"389","author":"X Liu","year":"2010","unstructured":"Liu, X., Murata, T.: Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Physica A 389(7), 1493\u20131500 (2010). \nhttps:\/\/doi.org\/10.1016\/j.physa.2009.12.019","journal-title":"Physica A"},{"issue":"8","key":"7256_CR51","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, J.M.: Distributed GraphLab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5(8), 716\u2013727 (2012). \nhttps:\/\/doi.org\/10.14778\/2212351.2212354","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR52","doi-asserted-by":"publisher","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: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201910), pp. 135\u2013146. ACM, New York (2010). \nhttps:\/\/doi.org\/10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"key":"7256_CR53","unstructured":"Manyika, J., Chui, M., Brown, B., Bughin, J., Dobbs, R., Roxburgh, C., Byers, A.H.: Big data: the next frontier for innovation, competition, and productivity 2011, vol. 5(33), p. 222 (2015). \nhttp:\/\/www.mckinsey.com\/Insights\/MGI\/Research\/Technology_and_Innovation\/Big_data_The_next_frontier_for_innovation"},{"issue":"12","key":"7256_CR54","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.14778\/2824032.2824046","volume":"8","author":"D Margo","year":"2015","unstructured":"Margo, D., Seltzer, M.: A scalable distributed graph partitioner. Proc. VLDB Endow. 8(12), 1478\u20131489 (2015). \nhttps:\/\/doi.org\/10.14778\/2824032.2824046","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR55","unstructured":"Martella, C., Logothetis, D., Loukas, A., Siganos, G.: Spinner: Scalable graph partitioning in the cloud (2014). \narXiv:1404.3861"},{"key":"7256_CR56","doi-asserted-by":"publisher","unstructured":"Mayer, C., Tariq, M.A., Li, C., Rothermel, K.: Graph: heterogeneity-aware graph computation with adaptive partitioning. In: 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), pp. 118\u2013128 (2016). \nhttps:\/\/doi.org\/10.1109\/ICDCS.2016.92","DOI":"10.1109\/ICDCS.2016.92"},{"key":"7256_CR57","unstructured":"Mayer, C., Mayer, R., Tariq, M.A., Geppert, H., Laich, L., Rieger, L., Rothermel, K.: Adwise: adaptive window-based streaming edge partitioning for high-speed graph processing (2017). arXiv preprint. \narXiv:1712.08367"},{"issue":"10","key":"7256_CR58","first-page":"61","volume":"90","author":"A McAfee","year":"2012","unstructured":"McAfee, A., Brynjolfsson, E., Davenport, T.H., Patil, D., Barton, D.: Big data\u2019s: the management revolution. Harv. Bus. Rev. 90(10), 61\u201367 (2012)","journal-title":"Harv. Bus. Rev."},{"key":"7256_CR59","doi-asserted-by":"crossref","unstructured":"McSherry, F.: Spectral partitioning of random graphs. In: Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, pp. 529\u2013537 (2001)","DOI":"10.1109\/SFCS.2001.959929"},{"issue":"99","key":"7256_CR60","first-page":"1","volume":"PP","author":"H Meyerhenke","year":"2017","unstructured":"Meyerhenke, H., Sanders, P., Schulz, C.: Parallel graph partitioning for complex networks. IEEE Trans. Parallel Distrib. Syst. PP(99), 1\u20131 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7256_CR61","doi-asserted-by":"publisher","unstructured":"Mofrad, M.H., Melhem, R., Hammoud, M.: Revolver: vertex-centric graph partitioning using reinforcement learning. In: 2018 IEEE 11th International Conference on Cloud Computing (CLOUD), pp. 818\u2013821 (2018). \nhttps:\/\/doi.org\/10.1109\/CLOUD.2018.00111","DOI":"10.1109\/CLOUD.2018.00111"},{"key":"7256_CR62","unstructured":"Moreira, O., Popp, M., Schulz, C.: Graph partitioning with acyclicity constraints (2017). \narXiv:1704.00705"},{"key":"7256_CR63","doi-asserted-by":"publisher","unstructured":"Nirmala, G., Dinakaran, K.: Analysis of protein database for semantic similarity using map reduce; a survey. In: Proceedings of IEEE International Conference on Computer Communication and Systems (ICCCS14), pp. 046\u2013050 (2014). \nhttps:\/\/doi.org\/10.1109\/ICCCS.2014.7068166","DOI":"10.1109\/ICCCS.2014.7068166"},{"key":"7256_CR64","doi-asserted-by":"publisher","unstructured":"Nishimura, J., Ugander, J.: Restreaming graph partitioning: simple versatile algorithms for advanced balancing. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201913), pp. 1106\u20131114. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2487575.2487696","DOI":"10.1145\/2487575.2487696"},{"issue":"1","key":"7256_CR65","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s41019-017-0034-4","volume":"2","author":"M Onizuka","year":"2017","unstructured":"Onizuka, M., Fujimori, T., Shiokawa, H.: Graph partitioning for distributed graph processing. Data Sci. Eng. 2(1), 94\u2013105 (2017). \nhttps:\/\/doi.org\/10.1007\/s41019-017-0034-4","journal-title":"Data Sci. Eng."},{"key":"7256_CR66","doi-asserted-by":"publisher","unstructured":"Petroni, F., Querzoni, L., Daudjee, K., Kamali, S., Iacoboni, G.: HDRF: Stream-based partitioning for power-law graphs. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management (CIKM \u201915), pp. 243\u2013252. ACM, New York (2015). \nhttps:\/\/doi.org\/10.1145\/2806416.2806424","DOI":"10.1145\/2806416.2806424"},{"key":"7256_CR67","doi-asserted-by":"crossref","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., Jelasity, M., Haridi, S.: JA-BE-JA: A distributed algorithm for balanced graph partitioning. In: 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems, pp. 51\u201360 (2013)","DOI":"10.1109\/SASO.2013.13"},{"key":"7256_CR68","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-662-43352-2_15","volume-title":"Distributed Applications and Interoperable Systems","author":"Fatemeh Rahimian","year":"2014","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., Haridi S.: Distributed vertex-cut partitioning. In: Distributed Applications and Interoperable Systems. Springer, Heidelberg, pp. 186\u2013200 (2014)"},{"key":"7256_CR69","doi-asserted-by":"publisher","unstructured":"Roy, A., Bindschaedler, L., Malicevic, J., Zwaenepoel, W.: Chaos: Scale-out graph processing from secondary storage. In: Proceedings of the 25th Symposium on Operating Systems Principles (SOSP \u201915), pp. 410\u2013424. ACM, New York (2015). \nhttps:\/\/doi.org\/10.1145\/2815400.2815408","DOI":"10.1145\/2815400.2815408"},{"key":"7256_CR70","doi-asserted-by":"publisher","unstructured":"Sajjad, H.P., Payberah, A.H., Rahimian, F., Vlassov, V., Haridi, S.: Boosting vertex-cut partitioning for streaming graphs. In: 2016 IEEE International Congress on Big Data (BigData Congress), pp. 1\u20138 (2016). \nhttps:\/\/doi.org\/10.1109\/BigDataCongress.2016.10","DOI":"10.1109\/BigDataCongress.2016.10"},{"key":"7256_CR71","doi-asserted-by":"publisher","unstructured":"Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H., Zhao, B.Y.: Measurement-calibrated graph models for social network experiments. In: Proceedings of the 19th International Conference on World Wide Web (WWW \u201910), pp. 861\u2013870. ACM, New York (2010). \nhttps:\/\/doi.org\/10.1145\/1772690.1772778","DOI":"10.1145\/1772690.1772778"},{"key":"7256_CR72","doi-asserted-by":"publisher","unstructured":"Sala, A., Zhao, X., Wilson, C., Zheng, H., Zhao, B.Y.: Sharing graphs using differentially private graph models. In: Proceedings of the 2011 ACM SIGCOMM Conference on Internet Measurement Conference (IMC \u201911), pp. 81\u201398. ACM, New York (2011).\nhttps:\/\/doi.org\/10.1145\/2068816.2068825","DOI":"10.1145\/2068816.2068825"},{"key":"7256_CR73","doi-asserted-by":"publisher","unstructured":"Salihoglu, S., Widom, J.: GPS: a graph processing system. In: Proceedings of the 25th International Conference on Scientific and Statistical Database Management (SSDBM), pp. 22:1\u201322:12. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2484838.2484843","DOI":"10.1145\/2484838.2484843"},{"issue":"7","key":"7256_CR74","doi-asserted-by":"publisher","first-page":"577","DOI":"10.14778\/2732286.2732294","volume":"7","author":"S Salihoglu","year":"2014","unstructured":"Salihoglu, S., Widom, J.: Optimizing graph algorithms on pregel-like systems. Proc. VLDB Endow. 7(7), 577\u2013588 (2014). \nhttps:\/\/doi.org\/10.14778\/2732286.2732294","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR75","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-642-23719-5_40","volume-title":"Algorithms \u2013 ESA 2011","author":"Peter Sanders","year":"2011","unstructured":"Sanders, P., Schulz, C.: Engineering multilevel graph partitioning algorithms. In: Algorithms\u2014ESA 2011. Springer, Berlin, pp. 469\u2013480 (2011)"},{"key":"7256_CR76","doi-asserted-by":"publisher","unstructured":"Shang, Z., Yu, J.X.: Catch the wind: Graph workload balancing on cloud. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 553\u2013564 (2013). \nhttps:\/\/doi.org\/10.1109\/ICDE.2013.6544855","DOI":"10.1109\/ICDE.2013.6544855"},{"key":"7256_CR77","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.future.2017.01.014","volume":"71","author":"Z Shi","year":"2017","unstructured":"Shi, Z., Li, J., Guo, P., Li, S., Feng, D., Su, Y.: Partitioning dynamic graph asynchronously with distributed fennel. Future Gen. Comput. Syst. 71, 32\u201342 (2017). \nhttps:\/\/doi.org\/10.1016\/j.future.2017.01.014","journal-title":"Future Gen. Comput. Syst."},{"key":"7256_CR78","doi-asserted-by":"publisher","unstructured":"Slota, G.M., Madduri, K., Rajamanickam, S.: PuLP: scalable multi-objective multi-constraint partitioning for small-world networks. In: 2014 IEEE International Conference on Big Data (Big Data), pp. 481\u2013490 (2014). \nhttps:\/\/doi.org\/10.1109\/BigData.2014.7004265","DOI":"10.1109\/BigData.2014.7004265"},{"key":"7256_CR79","doi-asserted-by":"publisher","unstructured":"Stanton, I.: Streaming balanced graph partitioning algorithms for random graphs. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201914), pp. 1287\u20131301 (2014). \nhttps:\/\/doi.org\/10.1137\/1.9781611973402.95","DOI":"10.1137\/1.9781611973402.95"},{"key":"7256_CR80","doi-asserted-by":"publisher","unstructured":"Stanton, I., Kliot, G.: Streaming graph partitioning for large distributed graphs. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201912), pp. 1222\u20131230. ACM, New York (2012). \nhttps:\/\/doi.org\/10.1145\/2339530.2339722","DOI":"10.1145\/2339530.2339722"},{"issue":"11","key":"7256_CR81","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.14778\/2809974.2809983","volume":"8","author":"N Sundaram","year":"2015","unstructured":"Sundaram, N., Satish, N., Patwary, M.M.A., Dulloor, S.R., Anderson, M.J., Vadlamudi, S.G., Das, D., Dubey, P.: GraphMat: high performance graph analytics made productive. Proc. VLDB Endow. 8(11), 1214\u20131225 (2015). \nhttps:\/\/doi.org\/10.14778\/2809974.2809983","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR82","doi-asserted-by":"publisher","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: Proceedings of the 20th International Conference on World Wide Web (WWW \u201911), pp. 607\u2013614. ACM, New York (2011). \nhttps:\/\/doi.org\/10.1145\/1963405.1963491","DOI":"10.1145\/1963405.1963491"},{"key":"7256_CR83","doi-asserted-by":"publisher","unstructured":"Tatarowicz, A.L., Curino, C., Jones, E.P.C., Madden, S.: Lookup tables: fine-grained partitioning for distributed databases. In: 2012 IEEE 28th International Conference on Data Engineering, pp. 102\u2013113. (2012). \nhttps:\/\/doi.org\/10.1109\/ICDE.2012.26","DOI":"10.1109\/ICDE.2012.26"},{"key":"7256_CR84","doi-asserted-by":"publisher","unstructured":"Tsourakakis, C.: Streaming graph partitioning in the planted partition model. In: Proceedings of the 2015 ACM on Conference on Online Social Networks (COSN \u201915), pp. 27\u201335. ACM, New York (2015). \nhttps:\/\/doi.org\/10.1145\/2817946.2817950","DOI":"10.1145\/2817946.2817950"},{"key":"7256_CR85","doi-asserted-by":"publisher","unstructured":"Tsourakakis, C., Gkantsidis, C., Radunovic, B., Vojnovic, M.: Fennel: streaming graph partitioning for massive scale graphs. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining (WSDM \u201914), pp. 333\u2013342. ACM, New York (2014). \nhttps:\/\/doi.org\/10.1145\/2556195.2556213","DOI":"10.1145\/2556195.2556213"},{"key":"7256_CR86","doi-asserted-by":"publisher","unstructured":"Ugander, J., Backstrom, L.: Balanced label propagation for partitioning massive graphs. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining (WSDM \u201913), pp. 507\u2013516. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2433396.2433461","DOI":"10.1145\/2433396.2433461"},{"issue":"8","key":"7256_CR87","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990). \nhttps:\/\/doi.org\/10.1145\/79173.79181","journal-title":"Commun. ACM"},{"key":"7256_CR88","unstructured":"Vaquero, L.M., Cuadrado, F., Logothetis, D., Martella, C.: xDGP: a dynamic graph processing system with adaptive partitioning (2013). \narXiv:1309.1049"},{"issue":"5","key":"7256_CR89","doi-asserted-by":"publisher","first-page":"493","DOI":"10.14778\/3055540.3055543","volume":"10","author":"S Verma","year":"2017","unstructured":"Verma, S., Leslie, L.M., Shin, Y., Gupta, I.: An experimental comparison of partitioning strategies in distributed graph processing. Proc. VLDB Endow. 10(5), 493\u2013504 (2017). \nhttps:\/\/doi.org\/10.14778\/3055540.3055543","journal-title":"Proc. VLDB Endow."},{"key":"7256_CR90","doi-asserted-by":"publisher","unstructured":"Wang, L., Xiao, Y., Shao, B., Wang, H.: How to partition a billion-node graph. In: 2014 IEEE 30th International Conference on Data Engineering, pp. 568\u2013579 (2014). \nhttps:\/\/doi.org\/10.1109\/ICDE.2014.6816682","DOI":"10.1109\/ICDE.2014.6816682"},{"issue":"6684","key":"7256_CR91","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998). \nhttps:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"key":"7256_CR92","volume-title":"Hadoop: The Definitive Guide","author":"T White","year":"2012","unstructured":"White, T.: Hadoop: The Definitive Guide. O\u2019Reilly Media, Boston (2012)"},{"key":"7256_CR93","doi-asserted-by":"publisher","unstructured":"Wilson, C., Boe, B., Sala, A., Puttaswamy, K.P., Zhao, B.Y.: User interactions in social networks and their implications. In: Proceedings of the 4th ACM European Conference on Computer Systems (EuroSys \u201909), pp. 205\u2013218. ACM, New York (2009). \nhttps:\/\/doi.org\/10.1145\/1519065.1519089","DOI":"10.1145\/1519065.1519089"},{"key":"7256_CR94","doi-asserted-by":"publisher","unstructured":"Wu, M., Yang, F., Xue, J., Xiao, W., Miao, Y., Wei, L., Lin, H., Dai, Y., Zhou, L.: GraM: Scaling graph computation to the trillions. In: Proceedings of the Sixth ACM Symposium on Cloud Computing (SoCC \u201915), pp. 408\u2013421. ACM, New York (2015). \nhttps:\/\/doi.org\/10.1145\/2806777.2806849","DOI":"10.1145\/2806777.2806849"},{"key":"7256_CR95","unstructured":"Xiao, W., Xue, J., Miao, Y., Li, Z., Chen, C., Wu, M., Li, W., Zhou, L.: Tux2: Distributed graph computation for machine learning. In: Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17), pp. 669\u2013682 (2017)"},{"key":"7256_CR96","doi-asserted-by":"publisher","unstructured":"Xiao-Shu, W., Yao, X., Huan, L.: Cloud computing oriented retrieval technology based on big data. In: 2015 IEEE Seventh International Conference on Measuring Technology and Mechatronics Automation, pp. 275\u2013278 (2015). \nhttps:\/\/doi.org\/10.1109\/ICMTMA.2015.73","DOI":"10.1109\/ICMTMA.2015.73"},{"key":"7256_CR97","unstructured":"Xie, C., Li, W.J., Zhang, Z.: S-PowerGraph: streaming graph partitioning for natural graphs by vertex-cut (2015). \narXiv:1511.02586"},{"key":"7256_CR98","doi-asserted-by":"publisher","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: GraphX: a resilient distributed graph system on spark. In: First International Workshop on Graph Data Management Experiences and Systems (GRADES \u201913), pp. 2:1\u20132:6. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2484425.2484427","DOI":"10.1145\/2484425.2484427"},{"issue":"14","key":"7256_CR99","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.14778\/2733085.2733097","volume":"7","author":"N Xu","year":"2014","unstructured":"Xu, N., Chen, L., Cui, B.: LogGP: a log-based dynamic graph partitioning method. Proc. VLDB Endow. 7(14), 1917\u20131928 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"7256_CR100","doi-asserted-by":"publisher","first-page":"1560","DOI":"10.1109\/TKDE.2014.2377743","volume":"27","author":"N Xu","year":"2015","unstructured":"Xu, N., Cui, B., Chen, L., Huang, Z., Shao, Y.: Heterogeneous environment aware streaming graph partitioning. IEEE Trans. Knowl. Data Eng. 27(6), 1560\u20131572 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7256_CR101","doi-asserted-by":"publisher","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Effective techniques for message reduction and load balancing in distributed graph computation. In: Proceedings of the 24th International Conference on World Wide Web (WWW \u201915), pp. 1307\u20131317. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland (2015). \nhttps:\/\/doi.org\/10.1145\/2736277.2741096","DOI":"10.1145\/2736277.2741096"},{"key":"7256_CR102","doi-asserted-by":"publisher","unstructured":"Yang, S., Yan, X., Zong, B., Khan, A.: Towards effective partition management for large graphs. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201912), pp. 517\u2013528. ACM, New York (2012). \nhttps:\/\/doi.org\/10.1145\/2213836.2213895","DOI":"10.1145\/2213836.2213895"},{"key":"7256_CR103","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201912), pp. 2\u20132. USENIX Association, Berkeley (2012)"},{"key":"7256_CR104","doi-asserted-by":"publisher","unstructured":"Zeng, Z., Wu, B., Wang, H.: A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining. In: Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications (BigMine \u201912), pp. 61\u201368. ACM, New York (2012). \nhttps:\/\/doi.org\/10.1145\/2351316.2351325","DOI":"10.1145\/2351316.2351325"},{"key":"7256_CR105","doi-asserted-by":"publisher","unstructured":"Zhao, Y., Yoshigoe, K., Xie, M., Zhou, S., Seker, R., Bian, J.: LightGraph: lighten communication in distributed graph-parallel processing. In: 2014 IEEE International Congress on Big Data, pp. 717\u2013724 (2014). \nhttps:\/\/doi.org\/10.1109\/BigData.Congress.2014.106","DOI":"10.1109\/BigData.Congress.2014.106"},{"key":"7256_CR106","doi-asserted-by":"publisher","unstructured":"Zheng, A., Labrinidis, A., Chrysanthis, P.K.: Architecture-aware graph repartitioning for data-intensive scientific computing. In: 2014 IEEE International Conference on Big Data (Big Data), pp. 78\u201385 (2014). \nhttps:\/\/doi.org\/10.1109\/BigData.2014.7004375","DOI":"10.1109\/BigData.2014.7004375"},{"key":"7256_CR107","doi-asserted-by":"publisher","unstructured":"Zheng, A., Labrinidis, A., Chrysanthis, P.K.: Planar: Parallel lightweight architecture-aware adaptive graph repartitioning. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 121\u2013132 (2016a). \nhttps:\/\/doi.org\/10.1109\/ICDE.2016.7498234","DOI":"10.1109\/ICDE.2016.7498234"},{"key":"7256_CR108","unstructured":"Zheng, A., Labrinidis, A., Pisciuneri, P.H., Chrysanthis, P.K., Givi, P.: Paragon: parallel architecture-aware graph partition refinement algorithm. In: EDBT, pp. 365\u2013376 (2016b)"},{"key":"7256_CR109","doi-asserted-by":"publisher","unstructured":"Zheng, A., Labrinidis, A., Faloutsos, C.: Skew-resistant graph partitioning. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 151\u2013154 (2017). \nhttps:\/\/doi.org\/10.1109\/ICDE.2017.62","DOI":"10.1109\/ICDE.2017.62"},{"key":"7256_CR110","unstructured":"Zhu, X., Ghahramani, Z.: Learning from labeled and unlabeled data with label propagation. Tech. Rep., Citeseer (2002)"},{"key":"7256_CR111","unstructured":"Zhu, X., Chen, W., Zheng, W., Ma, X.: Gemini: A computation-centric distributed graph processing system. In: Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), pp. 301\u2013316 (2016)"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-019-07256-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-019-07256-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-019-07256-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T02:22:35Z","timestamp":1581992555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-019-07256-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,6]]},"references-count":111,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["7256"],"URL":"https:\/\/doi.org\/10.1007\/s10619-019-07256-z","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,6]]},"assertion":[{"value":"6 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}