{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:51:13Z","timestamp":1752231073455,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"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":[[2022,4,25]]},"DOI":"10.1145\/3487553.3524213","type":"proceedings-article","created":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T22:41:30Z","timestamp":1660689690000},"page":"89-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["ROSE: Robust Caches for Amazon Product Search"],"prefix":"10.1145","author":[{"given":"Chen","family":"Luo","sequence":"first","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vihan","family":"Lakshman","sequence":"additional","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anshumali","family":"Shrivastava","sequence":"additional","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyu","family":"Cao","sequence":"additional","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sreyashi","family":"Nag","sequence":"additional","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Goutam","sequence":"additional","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanqing","family":"Lu","sequence":"additional","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiwei","family":"Song","sequence":"additional","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Yin","sequence":"additional","affiliation":[{"name":"Amazon Search, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/3336191.3371852"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/3357384.3358095"},{"unstructured":"Andrei Broder. 2005. Algorithms for duplicate documents. URL:: http:\/\/www. cs. princeton. edu\/courses\/archive\/spr05\/cos598E\/bib\/Princeton. pdf (2015)(2005).  Andrei Broder. 2005. Algorithms for duplicate documents. URL:: http:\/\/www. cs. princeton. edu\/courses\/archive\/spr05\/cos598E\/bib\/Princeton. pdf (2015)(2005).","key":"e_1_3_2_1_3_1"},{"volume-title":"Computer systems: a programmer\u2019s perspective. Vol.\u00a02","author":"Bryant E","unstructured":"Randal\u00a0 E Bryant , O\u2019Hallaron David\u00a0Richard , and O\u2019Hallaron David\u00a0Richard . 2003. Computer systems: a programmer\u2019s perspective. Vol.\u00a02 . Prentice Hall Upper Saddle River . Randal\u00a0E Bryant, O\u2019Hallaron David\u00a0Richard, and O\u2019Hallaron David\u00a0Richard. 2003. Computer systems: a programmer\u2019s perspective. Vol.\u00a02. Prentice Hall Upper Saddle River.","key":"e_1_3_2_1_4_1"},{"unstructured":"Tobias Christiani. 2020. DartMinHash: Fast Sketching for Weighted Sets. arXiv preprint arXiv:2005.11547(2020).  Tobias Christiani. 2020. DartMinHash: Fast Sketching for Weighted Sets. arXiv preprint arXiv:2005.11547(2020).","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/3336191.3371827"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/3437963.3441775"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/276698.276876"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/ICDM.2010.80"},{"unstructured":"Jeff Johnson Matthijs Douze and Herv\u00e9 J\u00e9gou. 2017. Billion-scale similarity search with GPUs. arXiv preprint arXiv:1702.08734(2017).  Jeff Johnson Matthijs Douze and Herv\u00e9 J\u00e9gou. 2017. Billion-scale similarity search with GPUs. arXiv preprint arXiv:1702.08734(2017).","key":"e_1_3_2_1_10_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/3437963.3441743"},{"unstructured":"Heran Lin Pengcheng Xiong Danqing Zhang Fan Yang Ryoichi Kato Mukul Kumar William Headden and Bing Yin. [n.d.]. Light Feed-Forward Networks for Shard Selection in Large-scale Product Search. ([n. d.]).  Heran Lin Pengcheng Xiong Danqing Zhang Fan Yang Ryoichi Kato Mukul Kumar William Headden and Bing Yin. [n.d.]. Light Feed-Forward Networks for Shard Selection in Large-scale Product Search. ([n. d.]).","key":"e_1_3_2_1_12_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/3219819.3220003"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/2623330.2623374"},{"key":"e_1_3_2_1_16_1","volume-title":"NIPS 2016 Time Series Workshop. PMLR, 38\u201358","author":"Luo Chen","year":"2017","unstructured":"Chen Luo and Anshumali Shrivastava . 2017 . SSH (sketch, shingle, & hash) for indexing massive-scale time series . In NIPS 2016 Time Series Workshop. PMLR, 38\u201358 . Chen Luo and Anshumali Shrivastava. 2017. SSH (sketch, shingle, & hash) for indexing massive-scale time series. In NIPS 2016 Time Series Workshop. PMLR, 38\u201358."},{"doi-asserted-by":"crossref","unstructured":"Chen Luo and Anshumali Shrivastava. 2018. Arrays of (locality-sensitive) count estimators (ace): High-speed anomaly detection via cache lookups. (2018).  Chen Luo and Anshumali Shrivastava. 2018. Arrays of (locality-sensitive) count estimators (ace): High-speed anomaly detection via cache lookups. (2018).","key":"e_1_3_2_1_17_1","DOI":"10.1145\/3178876.3186056"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1609\/aaai.v33i01.33014464"},{"volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal . 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press , USA. Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, USA.","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/3292500.3330759"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/3394486.3403393"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/3437963.3441750"},{"unstructured":"Anshumali Shrivastava. 2016. Simple and Efficient Weighted Minwise Hashing.. In NIPS. 1498\u20131506.  Anshumali Shrivastava. 2016. Simple and Efficient Weighted Minwise Hashing.. In NIPS. 1498\u20131506.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning, ICML 2017","author":"Shrivastava Anshumali","year":"2017","unstructured":"Anshumali Shrivastava . 2017 . Optimal Densification for Fast and Accurate Minwise Hashing . In Proceedings of the 34th International Conference on Machine Learning, ICML 2017 , Sydney, NSW, Australia , 6-11 August 2017(Proceedings of Machine Learning Research, Vol.\u00a070), Doina Precup and Yee\u00a0Whye Teh (Eds.). PMLR, 3154\u20133163. http:\/\/proceedings.mlr.press\/v70\/shrivastava17a.html Anshumali Shrivastava. 2017. Optimal Densification for Fast and Accurate Minwise Hashing. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017(Proceedings of Machine Learning Research, Vol.\u00a070), Doina Precup and Yee\u00a0Whye Teh (Eds.). PMLR, 3154\u20133163. http:\/\/proceedings.mlr.press\/v70\/shrivastava17a.html"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI 2015","author":"Shrivastava Anshumali","year":"2015","unstructured":"Anshumali Shrivastava and Ping Li . 2015 . Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS) . In Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI 2015 , July 12-16, 2015, Amsterdam, The Netherlands, Marina Meila and Tom Heskes (Eds.). AUAI Press, 812\u2013821. http:\/\/auai.org\/uai 2015\/proceedings\/papers\/96.pdf Anshumali Shrivastava and Ping Li. 2015. Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS). In Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI 2015, July 12-16, 2015, Amsterdam, The Netherlands, Marina Meila and Tom Heskes (Eds.). AUAI Press, 812\u2013821. http:\/\/auai.org\/uai2015\/proceedings\/papers\/96.pdf"},{"unstructured":"Zehong Tan Canran Xu Mengjie Jiang Hua Yang and Xiaoyuan Wu. 2017. Query rewrite for null and low search results in eCommerce. In eCOM@ SIGIR.  Zehong Tan Canran Xu Mengjie Jiang Hua Yang and Xiaoyuan Wu. 2017. Query rewrite for null and low search results in eCommerce. In eCOM@ SIGIR.","key":"e_1_3_2_1_26_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/3147.3165"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/3183713.3196925"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/3289600.3291039"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/3336191.3371778"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3437963.3441736"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/3459637.3481946"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/3437963.3441822"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"acronym":"WWW '22","name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France"},"container-title":["Companion Proceedings of the Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487553.3524213","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487553.3524213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:33Z","timestamp":1750188633000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487553.3524213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":32,"alternative-id":["10.1145\/3487553.3524213","10.1145\/3487553"],"URL":"https:\/\/doi.org\/10.1145\/3487553.3524213","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-08-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}