{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T05:21:07Z","timestamp":1672291267558},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,4]]},"abstract":"<jats:p>When a frequently-accessed cache item expires, multiple requests to that item can trigger a cache miss and start regenerating that same item at the same time. This phenomenon, known as cache stampede, severely limits the performance of databases and web servers. A natural countermeasure to this issue is to let the processes that perform such requests to randomly ask for a regeneration before the expiration time of the item. In this paper we give optimal algorithms for performing such probabilistic early expirations. Our algorithms are theoretically optimal and have much better performances than other solutions used in real-world applications.<\/jats:p>","DOI":"10.14778\/2757807.2757813","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"886-897","source":"Crossref","is-referenced-by-count":0,"title":["Optimal probabilistic cache stampede prevention"],"prefix":"10.14778","volume":"8","author":[{"given":"Andrea","family":"Vattani","sequence":"first","affiliation":[{"name":"Amazon Inc., San Francisco, California"}]},{"given":"Flavio","family":"Chierichetti","sequence":"additional","affiliation":[{"name":"Sapienza University, Rome, Italy"}]},{"given":"Keegan","family":"Lowenstein","sequence":"additional","affiliation":[{"name":"Bugsnag Inc., San Francisco, California"}]}],"member":"320","published-online":{"date-parts":[[2015,4]]},"reference":[{"key":"e_1_2_1_1_1","series-title":"O'Reilly Series","volume-title":"Web Operations: Keeping the Data On Time","author":"Allspaw J.","year":"2010","unstructured":"J. Allspaw and J. Robbins . Web Operations: Keeping the Data On Time . O'Reilly Series . O'Reilly Media, Inc orporated, 2010 . J. Allspaw and J. Robbins. Web Operations: Keeping the Data On Time. O'Reilly Series. O'Reilly Media, Incorporated, 2010."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564762"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348369"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749295"},{"key":"e_1_2_1_5_1","volume-title":"https:\/\/www.drupal.org\/. Accessed","author":"Community Drupal","year":"2014","unstructured":"Drupal Community . https:\/\/www.drupal.org\/. Accessed December 30, 2014 . Drupal Community. https:\/\/www.drupal.org\/. Accessed December 30, 2014."},{"key":"e_1_2_1_6_1","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"Dubhashi D. P.","year":"2012","unstructured":"D. P. Dubhashi and A. Panconesi . Concentration of Measure for the Analysis of Randomized Algorithms . Cambridge University Press , New York, NY, USA , 2012 . D. P. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, New York, NY, USA, 2012."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775061"},{"key":"e_1_2_1_8_1","volume-title":"http:\/\/memcached.org\/. Accessed","year":"2014","unstructured":"Memcached. http:\/\/memcached.org\/. Accessed December 30, 2014 . Memcached. http:\/\/memcached.org\/. Accessed December 30, 2014."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_2_1_10_1","volume-title":"High Performance Drupal: Fast and Scalable Designs","author":"Sheltren J.","year":"2013","unstructured":"J. Sheltren , N. Newton , and N. Catchpole . High Performance Drupal: Fast and Scalable Designs . O'Reilly Media , 2013 . J. Sheltren, N. Newton, and N. Catchpole. High Performance Drupal: Fast and Scalable Designs. O'Reilly Media, 2013."},{"key":"e_1_2_1_11_1","volume-title":"http:\/\/search.cpan.org\/~haarg\/CHI-0.58\/lib\/CHI.pm. Accessed","author":"Swartz J.","year":"2014","unstructured":"J. Swartz . Chi-0.58. http:\/\/search.cpan.org\/~haarg\/CHI-0.58\/lib\/CHI.pm. Accessed December 30, 2014 . J. Swartz. Chi-0.58. http:\/\/search.cpan.org\/~haarg\/CHI-0.58\/lib\/CHI.pm. Accessed December 30, 2014."},{"key":"e_1_2_1_12_1","volume-title":"Accessed","author":"Swartz J.","year":"2014","unstructured":"J. Swartz . Problems and solutions for typical perl cache usage. http:\/\/www.openswartz.com\/2008\/02\/ . Accessed December 30, 2014 . J. Swartz. Problems and solutions for typical perl cache usage. http:\/\/www.openswartz.com\/2008\/02\/. Accessed December 30, 2014."},{"key":"e_1_2_1_13_1","volume-title":"An Introduction to Stochastic Modeling","author":"Taylor H.","year":"2010","unstructured":"H. Taylor and S. Karlin . An Introduction to Stochastic Modeling . Academic Press , 2010 . H. Taylor and S. Karlin. An Introduction to Stochastic Modeling. Academic Press, 2010."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263136"},{"key":"e_1_2_1_15_1","volume-title":"Accessed","author":"Zaitsev P.","year":"2014","unstructured":"P. Zaitsev . Percona mysql performance blog. http:\/\/www.percona.com\/blog\/2010\/09\/10\/cache-miss-storm\/ . Accessed December 30, 2014 . P. Zaitsev. Percona mysql performance blog. http:\/\/www.percona.com\/blog\/2010\/09\/10\/cache-miss-storm\/. Accessed December 30, 2014."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2757807.2757813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:45:09Z","timestamp":1672220709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2757807.2757813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["10.14778\/2757807.2757813"],"URL":"https:\/\/doi.org\/10.14778\/2757807.2757813","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,4]]}}}