{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T18:42:43Z","timestamp":1780080163555,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,5,13]],"date-time":"2013-05-13T00:00:00Z","timestamp":1368403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,5,13]]},"DOI":"10.1145\/2488388.2488433","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:43:24Z","timestamp":1454705004000},"page":"505-514","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":314,"title":["WTF"],"prefix":"10.1145","author":[{"given":"Pankaj","family":"Gupta","sequence":"first","affiliation":[{"name":"Twitter, San Francisco, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashish","family":"Goel","sequence":"additional","affiliation":[{"name":"Twitter, San Francisco, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jimmy","family":"Lin","sequence":"additional","affiliation":[{"name":"Twitter, San Francisco, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aneesh","family":"Sharma","sequence":"additional","affiliation":[{"name":"Twitter, San Francisco, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Wang","sequence":"additional","affiliation":[{"name":"Twitter, San Francisco, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reza","family":"Zadeh","sequence":"additional","affiliation":[{"name":"Twitter, San Francisco, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920881"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391232"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_1_6_1","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . OSDI , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. OSDI, 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851476.1851593"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129104"},{"key":"e_1_3_2_1_9_1","volume-title":"VLDB","author":"Gates A.","year":"2009","unstructured":"A. Gates , O. Natkovich , S. Chopra , P. Kamath , S. Narayanamurthy , C. Olston , B. Reed , S. Srinivasan , and U. Srivastava . Building a high-level dataflow system on top of MapReduce: The Pig experience . VLDB , 2009 . A. Gates, O. Natkovich, S. Chopra, P. Kamath, S. Narayanamurthy, C. Olston, B. Reed, S. Srinivasan, and U. Srivastava. Building a high-level dataflow system on top of MapReduce: The Pig experience. VLDB, 2009."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8462-3_9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402747"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281295"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367516"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038943"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383041"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_19_1","volume-title":"MapReduce is good enough? If all you have is a hammer, throw away everything that's not a nail! arXiv:1209.2191","author":"Lin J.","year":"2012","unstructured":"J. Lin . MapReduce is good enough? If all you have is a hammer, throw away everything that's not a nail! arXiv:1209.2191 , 2012 . J. Lin. MapReduce is good enough? If all you have is a hammer, throw away everything that's not a nail! arXiv:1209.2191, 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855013"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213958"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830252.1830263"},{"key":"e_1_3_2_1_23_1","volume-title":"UAI","author":"Low Y.","year":"2010","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. Hellerstein . GraphLab: A new parallel framework for machine learning . UAI , 2010 . Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. Hellerstein. GraphLab: A new parallel framework for machine learning. UAI, 2010."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213854"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_3_2_1_28_1","volume-title":"The PageRank citation ranking: Bringing order to the Web. Technical report","author":"Page L.","year":"1999","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank citation ranking: Bringing order to the Web. Technical report , Stanford University , 1999 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford University, 1999."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_30_1","volume-title":"Dimension independent similarity computation. arXiv:1206.2082","author":"Zadeh R.","year":"2012","unstructured":"R. Zadeh and A. Goel . Dimension independent similarity computation. arXiv:1206.2082 , 2012 . R. Zadeh and A. Goel. Dimension independent similarity computation. arXiv:1206.2082, 2012."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038929"}],"event":{"name":"WWW '13: 22nd International World Wide Web Conference","location":"Rio de Janeiro Brazil","acronym":"WWW '13","sponsor":["NICBR Nucleo de Informatcao e Coordenacao do Ponto BR","CGIBR Comite Gestor da Internet no Brazil","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 22nd international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488388.2488433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488388.2488433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:42Z","timestamp":1750236522000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488388.2488433"}},"subtitle":["the who to follow service at Twitter"],"short-title":[],"issued":{"date-parts":[[2013,5,13]]},"references-count":31,"alternative-id":["10.1145\/2488388.2488433","10.1145\/2488388"],"URL":"https:\/\/doi.org\/10.1145\/2488388.2488433","relation":{},"subject":[],"published":{"date-parts":[[2013,5,13]]},"assertion":[{"value":"2013-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}