{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:12:55Z","timestamp":1755997975984,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,20]],"date-time":"2015-05-20T00:00:00Z","timestamp":1432080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"U.S. Air Force Office of Scientific Research (AFOSR)","award":["#FA9550-12-1-0411"],"award-info":[{"award-number":["#FA9550-12-1-0411"]}]},{"name":"NSF","award":["CCF-1065125"],"award-info":[{"award-number":["CCF-1065125"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,20]]},"DOI":"10.1145\/2745754.2745761","type":"proceedings-article","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T14:36:25Z","timestamp":1432650985000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search"],"prefix":"10.1145","author":[{"given":"Michael","family":"Kapralov","sequence":"first","affiliation":[{"name":"IBM Watson, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634150"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_5_1","volume-title":"A survey of clustering data mining techniques","author":"Berkhin P.","year":"2002","unstructured":"P. Berkhin . A survey of clustering data mining techniques . Springer , 2002 . P. Berkhin. A survey of clustering data mining techniques. Springer, 2002."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/009117904000000874"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671516"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/982792.982913"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276877"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325958"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137881"},{"key":"e_1_3_2_1_20_1","volume-title":"ITCS","author":"O'Donnell Ryan","year":"2011","unstructured":"Ryan O'Donnell , Yi Wu , and Yuan Zhou . Optimal lower bounds for locality sensitive hashing (except when q is tiny) . ITCS , 2011 . Ryan O'Donnell, Yi Wu, and Yuan Zhou. Optimal lower bounds for locality sensitive hashing (except when q is tiny). ITCS, 2011."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109688"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.82"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.68"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176990346"},{"key":"e_1_3_2_1_25_1","first-page":"217","article-title":"On the volume of intersection of two lpballs","volume":"110","author":"Schechtman G.","year":"1990","unstructured":"G. Schechtman and J. Zinn . On the volume of intersection of two lpballs . Proc. Amer. Math. Soc. , 110 : 217 -- 224 , 1990 . G. Schechtman and J. Zinn. On the volume of intersection of two lpballs. Proc. Amer. Math. Soc., 110:217--224, 1990.","journal-title":"Proc. Amer. Math. Soc."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645924.671192"}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15"},"container-title":["Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2745754.2745761","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2745754.2745761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:45Z","timestamp":1750227405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2745754.2745761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,20]]},"references-count":25,"alternative-id":["10.1145\/2745754.2745761","10.1145\/2745754"],"URL":"https:\/\/doi.org\/10.1145\/2745754.2745761","relation":{},"subject":[],"published":{"date-parts":[[2015,5,20]]},"assertion":[{"value":"2015-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}