{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:40Z","timestamp":1750306780907,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"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,10]]},"DOI":"10.1145\/2523616.2525964","type":"proceedings-article","created":{"date-parts":[[2014,1,6]],"date-time":"2014-01-06T20:44:07Z","timestamp":1389041047000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["High performance in-memory caching through flexible fine-grained services"],"prefix":"10.1145","author":[{"given":"Yue","family":"Cheng","sequence":"first","affiliation":[{"name":"Virginia Tech"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aayush","family":"Gupta","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Povzner","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali R.","family":"Butt","sequence":"additional","affiliation":[{"name":"Virginia Tech"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10]]},"reference":[{"volume-title":"http:\/\/aws.amazon.com\/elasticache\/. accessed on","year":"2013","key":"e_1_3_2_1_1_1","unstructured":"Amazon web service elasticache. http:\/\/aws.amazon.com\/elasticache\/. accessed on Aug. 23, 2013 . Amazon web service elasticache. http:\/\/aws.amazon.com\/elasticache\/. accessed on Aug. 23, 2013."},{"volume-title":"http:\/\/memcached.org\/. accessed on","year":"2013","key":"e_1_3_2_1_2_1","unstructured":"Memcached. http:\/\/memcached.org\/. accessed on Sept. 15, 2013 . Memcached. http:\/\/memcached.org\/. accessed on Sept. 15, 2013."},{"key":"e_1_3_2_1_3_1","volume-title":"USENIX ATC'13","author":"Bronson N.","year":"2013","unstructured":"N. Bronson , Z. Amsden , G. Cabrera , P. Chakka , P. Dimov , H. Ding , J. Ferris , A. Giardullo , S. Kulkarni , H. Li , : Facebook's distributed data store for the social graph . In USENIX ATC'13 , 2013 . N. Bronson, Z. Amsden, G. Cabrera, P. Chakka, P. Dimov, H. Ding, J. Ferris, A. Giardullo, S. Kulkarni, H. Li, et al. Tao: Facebook's distributed data store for the social graph. In USENIX ATC'13, 2013."},{"key":"e_1_3_2_1_4_1","volume-title":"USENIX NSDI'13","author":"Fan B.","year":"2013","unstructured":"B. Fan , D. G. Andersen , and M. Kaminsky . Memc3: Compact and concurrent memcache with dumber caching and smarter hashing . In USENIX NSDI'13 , 2013 . B. Fan, D. G. Andersen, and M. Kaminsky. Memc3: Compact and concurrent memcache with dumber caching and smarter hashing. In USENIX NSDI'13, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_6_1","volume-title":"USENIX NSDI'13","author":"Nishtala R.","year":"2013","unstructured":"R. Nishtala , H. Fugal , S. Grimm , M. Kwiatkowski , H. Lee , H. C. Li , R. McElroy , M. Paleczny , D. Peek , P. Saab , Scaling memcache at facebook . In USENIX NSDI'13 , 2013 . R. Nishtala, H. Fugal, S. Grimm, M. Kwiatkowski, H. Lee, H. C. Li, R. McElroy, M. Paleczny, D. Peek, P. Saab, et al. Scaling memcache at facebook. In USENIX NSDI'13, 2013."}],"event":{"name":"SOCC '13: ACM Symposium on Cloud Computing","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Santa Clara California","acronym":"SOCC '13"},"container-title":["Proceedings of the 4th annual Symposium on Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2523616.2525964","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2523616.2525964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:03Z","timestamp":1750232043000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2523616.2525964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":6,"alternative-id":["10.1145\/2523616.2525964","10.1145\/2523616"],"URL":"https:\/\/doi.org\/10.1145\/2523616.2525964","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]},"assertion":[{"value":"2013-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}