{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:55:24Z","timestamp":1725908124079},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319656359"},{"type":"electronic","value":"9783319656366"}],"license":[{"start":{"date-parts":[[2017,8,17]],"date-time":"2017-08-17T00:00:00Z","timestamp":1502928000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-65636-6_24","type":"book-chapter","created":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T04:13:28Z","timestamp":1502856808000},"page":"274-284","source":"Crossref","is-referenced-by-count":1,"title":["k-core Decomposition on Giraph and GraphChi"],"prefix":"10.1007","author":[{"given":"Xin","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"24_CR1","unstructured":"Scaling apache Giraph to a trillion edges. \nhttp:\/\/bit.ly\/1TomAkh\n\n. Accessed 22 May 2016"},{"issue":"12","key":"24_CR2","first-page":"1804","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. PVLDB 8(12), 1804\u20131815 (2015)","journal-title":"PVLDB"},{"key":"24_CR3","unstructured":"Chowdhury, M., Thomo, A., Wadge, W.W.: Trust-based infinitesimals for enhanced collaborative filtering. In: COMAD (2009)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 991\u20131002. ACM (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"24_CR5","unstructured":"Ebrahimi, S., Villegas, N.M., M\u00fcller, H.A., Thomo, A.: Smarterdeals: a context-aware deal recommendation system based on the smartercontext engine. In: Proceedings of the 2012 Conference of the Center for Advanced Studies on Collaborative Research, pp. 116\u2013130. IBM Corporation (2012)"},{"issue":"3","key":"24_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"24_CR7","volume-title":"Finding a Maximum Density Subgraph","author":"AV Goldberg","year":"1984","unstructured":"Goldberg, A.V.: Finding a Maximum Density Subgraph. University of California, Berkeley (1984)"},{"issue":"3","key":"24_CR8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/S0304-3975(02)00739-9","volume":"296","author":"G Grahne","year":"2003","unstructured":"Grahne, G., Thomo, A.: Algebraic rewritings for optimizing regular path queries. Theor. Comput. Sci. 296(3), 453\u2013471 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11965893_22","volume-title":"Database Theory \u2013 ICDT 2007","author":"G Grahne","year":"2006","unstructured":"Grahne, G., Thomo, A., Wadge, W.: Preferentially annotated regular path queries. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 314\u2013328. Springer, Heidelberg (2006). doi:\n10.1007\/11965893_22"},{"issue":"12","key":"24_CR10","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":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-642-38562-9_55","volume-title":"Web-Age Information Management","author":"N Hassanlou","year":"2013","unstructured":"Hassanlou, N., Shoaran, M., Thomo, A.: Probabilistic graph summarization. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds.) WAIM 2013. LNCS, vol. 7923, pp. 545\u2013556. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-38562-9_55"},{"issue":"1","key":"24_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.14778\/2850469.2850471","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core decomposition of large networks on a single PC. Proc. VLDB Endow. 9(1), 13\u201323 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Khezrzadeh, M., Thomo, A., Wadge, W.W.: Harnessing the power of favorites lists for recommendation systems. In: Proceedings of the third ACM Conference on Recommender Systems, pp. 289\u2013292. ACM (2009)","DOI":"10.1145\/1639714.1639770"},{"issue":"3","key":"24_CR14","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/s13278-013-0122-z","volume":"3","author":"N Korovaiko","year":"2013","unstructured":"Korovaiko, N., Thomo, A.: Trust prediction from user-item ratings. Soc. Netw. Anal. Mining 3(3), 749\u2013759 (2013)","journal-title":"Soc. Netw. Anal. Mining"},{"issue":"2","key":"24_CR15","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G Kortsarz","year":"1994","unstructured":"Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. J. Algorithms 17(2), 222\u2013236 (1994)","journal-title":"J. Algorithms"},{"key":"24_CR16","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: large-scale graph computation on just a PC. In: USENIX OSDI, pp. 31\u201346 (2012)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Lu, J., Thomo, A.: An experimental evaluation of Giraph and Graphchi. In: 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 993\u2013996. IEEE (2016)","DOI":"10.1109\/ASONAM.2016.7752361"},{"issue":"3","key":"24_CR18","first-page":"281","volume":"8","author":"Y Lu","year":"2014","unstructured":"Lu, Y., Cheng, J., Yan, D., Wu, H.: Large-scale distributed graph computing systems: an experimental evaluation. PVLDB 8(3), 281\u2013292 (2014)","journal-title":"PVLDB"},{"key":"24_CR19","doi-asserted-by":"crossref","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: SIGMOD. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"24_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-1251-6","volume-title":"Practical Graph Analytics with Apache Giraph","author":"C Martella","year":"2015","unstructured":"Martella, C., Shaposhnik, R., Logothetis, D.: Practical Graph Analytics with Apache Giraph. Apress, Berkeley, CA (2015). doi:\n10.1007\/978-1-4842-1251-6"},{"issue":"2","key":"24_CR21","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2818185","volume":"48","author":"RR McCune","year":"2015","unstructured":"McCune, R.R., Weninger, T., Madey, G.: Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput. Surv. (CSUR) 48(2), 25 (2015)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"24_CR22","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., De Pellegrini, F., Miorandi, D.: Distributed k-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"24_CR23","first-page":"1","volume":"1","author":"J Pavlus","year":"2014","unstructured":"Pavlus, J.: Your laptop can now analyze big data. MIT Technol. Rev. 1, 1 (2014)","journal-title":"MIT Technol. Rev."},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Saito, H., Toyoda, M., Kitsuregawa, M., Aihara, K.: A large-scale study of link spam detection by graph algorithms. In: Proceedings of the 3rd International Workshop on Adversarial Information Retrieval on the Web, pp. 45\u201348. ACM (2007)","DOI":"10.1145\/1244408.1244417"},{"issue":"3","key":"24_CR25","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"1","key":"24_CR26","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2008.09.061","volume":"410","author":"M Shoaran","year":"2009","unstructured":"Shoaran, M., Thomo, A.: Fault-tolerant computation of distributed regular path queries. Theoret. Comput. Sci. 410(1), 62\u201377 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR27","unstructured":"Statista. Leading social networks worldwide, ranked by number of active users (in millions) (2017). \nhttps:\/\/www.statista.com\/statistics\/272014\/global-social-networks-ranked-by-number-of-users\/"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Stefanescu, D.C., Thomo, A., Thomo, L.: Distributed evaluation of generalized path queries. In: SAC. ACM (2005)","DOI":"10.1145\/1066677.1066819"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 104\u2013112. ACM (2013)","DOI":"10.1145\/2487575.2487645"},{"key":"24_CR30","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.procs.2013.06.056","volume":"19","author":"N Yazdanfar","year":"2013","unstructured":"Yazdanfar, N., Thomo, A.: Link recommender: collaborative-filtering for recommending urls to Twitter users. Procedia Comput. Sci. 19, 412\u2013419 (2013)","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"24_CR31","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/s11227-009-0299-0","volume":"53","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Zhao, H., Cai, W., Liu, J., Zhou, W.: Using the k-core decomposition to analyze the static structure of large-scale software systems. J. Supercomput. 53(2), 352\u2013369 (2010)","journal-title":"J. Supercomput."}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Intelligent Networking and Collaborative Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65636-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T04:22:04Z","timestamp":1502857324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65636-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,17]]},"ISBN":["9783319656359","9783319656366"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65636-6_24","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2017,8,17]]}}}