{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:32Z","timestamp":1750307492204,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T00:00:00Z","timestamp":1276128000000},"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":[[2010,6,10]]},"DOI":"10.1145\/1807128.1807144","type":"proceedings-article","created":{"date-parts":[[2010,6,11]],"date-time":"2010-06-11T18:52:58Z","timestamp":1276282378000},"page":"89-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Hermes"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Karagiannis","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Gkantsidis","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dushyanth","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antony","family":"Rowstron","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2005.01.007"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400181.1400204"},{"key":"e_1_3_2_1_3_1","volume-title":"USA","author":"Bolosky W. J.","year":"2000","unstructured":"Bolosky , W. J. , Corbin , S. , Goebel , D. , and Douceur , J. R . \" Single instance storage in Windows (R) 2000\" In WSS'00: Proceedings of the 4th conference on USENIX Windows Systems Symposium (Berkeley, CA , USA , 2000 ), USENIX Association. Bolosky, W. J., Corbin, S., Goebel, D., and Douceur, J. R. \"Single instance storage in Windows (R) 2000\" In WSS'00: Proceedings of the 4th conference on USENIX Windows Systems Symposium (Berkeley, CA, USA, 2000), USENIX Association."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298309"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526806"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452528"},{"key":"e_1_3_2_1_7_1","volume-title":"USA","author":"Dongarra J.","year":"2003","unstructured":"Dongarra , J. , Foster , I. , Fox , G. , Gropp , W. , Kennedy , K. , Torczon , L. , and White , A. , Eds . \"Sourcebook of parallel computing\" Morgan Kaufmann Publishers Inc., San Francisco, CA , USA , 2003 . Dongarra, J., Foster, I., Fox, G., Gropp, W., Kennedy, K., Torczon, L., and White, A., Eds. \"Sourcebook of parallel computing\" Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/850928.851884"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0405728101"},{"key":"e_1_3_2_1_10_1","unstructured":"Exchange Development Team. Private communications.  Exchange Development Team. Private communications."},{"key":"e_1_3_2_1_11_1","volume-title":"Sandia National Laboratories","author":"Hendrickson B.","year":"1993","unstructured":"Hendrickson , B. , and Leland , R. W . \" A multi-level algorithm for partitioning graphs\" Tech. rep ., Sandia National Laboratories , 1993 . Hendrickson, B., and Leland, R. W. \"A multi-level algorithm for partitioning graphs\" Tech. rep., Sandia National Laboratories, 1993."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526805"},{"key":"e_1_3_2_1_13_1","unstructured":"Karypis G. \"Metis -- family of multilevel partitioning algorithms\" http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis\/ 2009.  Karypis G. \"Metis -- family of multilevel partitioning algorithms\" http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis\/ 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401945"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1116869"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/WMCSA.1994.38"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150476"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134732"},{"key":"e_1_3_2_1_20_1","volume-title":"Exploiting Social Networks for Internet Search\" In Proc. of the 5th ACM Workshop on Hot Topics in Networks (HotNets)","author":"Mislove A.","year":"2006","unstructured":"Mislove , A. , Gummadi , K. P. , and Druschel , P . \" Exploiting Social Networks for Internet Search\" In Proc. of the 5th ACM Workshop on Hot Topics in Networks (HotNets) ( 2006 ). Mislove, A., Gummadi, K. P., and Druschel, P. \"Exploiting Social Networks for Internet Search\" In Proc. of the 5th ACM Workshop on Hot Topics in Networks (HotNets) (2006)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_22_1","volume-title":"Ostra: Leverging trust to thwart unwanted communication\" In Proc. of the 5th Symposium on Networked Systems Design and Implementation (NSDI'08)","author":"Mislove A.","year":"2008","unstructured":"Mislove , A. , Post , A. , Gummadi , K. P. , and Druschel , P . \" Ostra: Leverging trust to thwart unwanted communication\" In Proc. of the 5th Symposium on Networked Systems Design and Implementation (NSDI'08) ( 2008 ). Mislove, A., Post, A., Gummadi, K. P., and Druschel, P. \"Ostra: Leverging trust to thwart unwanted communication\" In Proc. of the 5th Symposium on Networked Systems Design and Implementation (NSDI'08) (2008)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452527"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.11.072"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095809.1095822"},{"key":"e_1_3_2_1_26_1","volume-title":"TX","author":"Tolia N.","year":"2003","unstructured":"Tolia , N. , Kozuch , M. , Satyanarayanan , M. , Karp , B. , Perrig , A. , and Bressoud , T . \" Opportunistic use of content addressable storage for distributed file systems\" In Proceedings of the 2003 USENIX Annual Technical Conference (San Antonio , TX , June 2003 ). Tolia, N., Kozuch, M., Satyanarayanan, M., Karp, B., Perrig, A., and Bressoud, T. \"Opportunistic use of content addressable storage for distributed file systems\" In Proceedings of the 2003 USENIX Annual Technical Conference (San Antonio, TX, June 2003)."},{"key":"e_1_3_2_1_27_1","unstructured":"Vazirani V. \"Approximation algorithms\" Springer 2001.   Vazirani V. \"Approximation algorithms\" Springer 2001."},{"key":"e_1_3_2_1_28_1","volume-title":"USA","author":"Zhu B.","year":"2008","unstructured":"Zhu , B. , Li , K. , and Patterson , H . \" Avoiding the disk bottleneck in the data domain deduplication file system\" In FAST'08: Proceedings of the 6th USENIX Conference on File and Storage Technologies (Berkeley, CA , USA , 2008 ), USENIX Association. Zhu, B., Li, K., and Patterson, H. \"Avoiding the disk bottleneck in the data domain deduplication file system\" In FAST'08: Proceedings of the 6th USENIX Conference on File and Storage Technologies (Berkeley, CA, USA, 2008), USENIX Association."}],"event":{"name":"SOCC '10: ACM SIGMOD-SIGOPS Workshop on Cloud Computing in conjunction with SIGMOD 2010","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Indianapolis Indiana USA","acronym":"SOCC '10"},"container-title":["Proceedings of the 1st ACM symposium on Cloud computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807128.1807144","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807128.1807144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:34Z","timestamp":1750249054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807128.1807144"}},"subtitle":["clustering users in large-scale e-mail services"],"short-title":[],"issued":{"date-parts":[[2010,6,10]]},"references-count":28,"alternative-id":["10.1145\/1807128.1807144","10.1145\/1807128"],"URL":"https:\/\/doi.org\/10.1145\/1807128.1807144","relation":{},"subject":[],"published":{"date-parts":[[2010,6,10]]},"assertion":[{"value":"2010-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}