{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T11:56:43Z","timestamp":1792756603297,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"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":[[2019,11,3]]},"DOI":"10.1145\/3357384.3357938","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"1673-1682","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["GRIP"],"prefix":"10.1145","author":[{"given":"Minjia","family":"Zhang","sequence":"first","affiliation":[{"name":"Microsoft AI and Research, Bellevue, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuxiong","family":"He","sequence":"additional","affiliation":[{"name":"Microsoft AI and Research, Bellevue, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"SIGIR 2018 . 215--224","author":"Aliannejadi Mohammad"},{"key":"e_1_3_2_1_2_1","volume-title":"Efficient Indexing of Billion-Scale Datasets of Deep Descriptors. In CVPR 2016 . 2055--2063","author":"Babenko Artem"},{"key":"e_1_3_2_1_3_1","volume-title":"AnnArbor: Approximate Nearest Neighbors Using Arborescence Coding. In ICCV 2017 . 4895--4903","author":"Babenko Artem"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818376"},{"key":"e_1_3_2_1_7_1","volume-title":"SPTAG: A library for fast approximate nearest neighbor search. https:\/\/github.com\/Microsoft\/SPTAG","author":"Chen Qi","year":"2018"},{"key":"e_1_3_2_1_8_1","volume-title":"Neural Ranking Models with Weak Supervision. In SIGIR","author":"Dehghani Mostafa","year":"2017"},{"key":"e_1_3_2_1_9_1","volume-title":"Polysemous Codes. In ECCV","author":"Douze Matthijs","year":"2016"},{"key":"e_1_3_2_1_10_1","volume-title":"Link and Code: Fast Indexing With Graphs and Compact Regression Codes. In CVPR 2018 .","author":"Douze Matthijs"},{"key":"e_1_3_2_1_11_1","volume-title":"Fast Approximate Nearest Neighbor Search with the Navigating Spreading-out Graph. In VLDB'19 .","author":"Fu Cong","year":"2019"},{"key":"e_1_3_2_1_12_1","volume-title":"Optimized Product Quantization for Approximate Nearest Neighbor Search. In CVPR 2013 .","author":"Ge Tiezheng","year":"2013"},{"key":"e_1_3_2_1_13_1","volume-title":"VLDB'99","author":"Gionis Aristides","year":"1999"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080789"},{"key":"e_1_3_2_1_15_1","volume-title":"CIKM 2016 . 55--64","author":"Guo Jiafeng"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/DASC-PICom-DataCom-CyberSciTec.2017.85"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505665"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"e_1_3_2_1_20_1","volume-title":"Locally Optimized Product Quantization for Approximate Nearest Neighbor Search. In CVPR","author":"Kalantidis Yannis","year":"2014"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263763"},{"key":"e_1_3_2_1_22_1","volume-title":"The Inverted Multi-index. In CVPR '12","author":"Lempitsky Victor","year":"2012"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043558"},{"key":"e_1_3_2_1_24_1","unstructured":"Yury A. Malkov and D. A. Yashunin. 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs . CoRR Vol. arXiv preprint abs\/1603.09320 (2016).  Yury A. Malkov and D. A. Yashunin. 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs . CoRR Vol. arXiv preprint abs\/1603.09320 (2016)."},{"key":"e_1_3_2_1_25_1","volume-title":"TPAMI 2014","volume":"36","author":"Muja Marius","year":"2014"},{"key":"e_1_3_2_1_26_1","volume-title":"Cartesian K-Means. In CVPR 2013 .","author":"Norouzi Mohammad"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2334302"},{"key":"e_1_3_2_1_28_1","volume-title":"Learning Latent Vector Spaces for Product Search. In CIKM '16","author":"Gysel Christophe Van","year":"2016"},{"key":"e_1_3_2_1_29_1","volume-title":"Billion-scale Commodity Embedding for E-commerce Recommendation in Alibaba. In KDD 2018 . 839--848","author":"Wang Jizhe","year":"2018"},{"key":"e_1_3_2_1_30_1","volume-title":"Patterson","author":"Williams Samuel","year":"2009"},{"key":"e_1_3_2_1_31_1","volume-title":"End-to-End Neural Ad-hoc Ranking with Kernel Pooling. In SIGIR 2017 . 55--64","author":"Xiong Chenyan","year":"2017"},{"key":"e_1_3_2_1_32_1","volume-title":"Phil Blunsom, and Stephen Pulman.","author":"Yu Lei","year":"2014"},{"key":"e_1_3_2_1_33_1","volume-title":"Neural Ranking Models with Multiple Document Fields. In WSDM '18 .","author":"Zamani Hamed","year":"2018"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","location":"Beijing China","acronym":"CIKM '19","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357938","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:04Z","timestamp":1750202584000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357938"}},"subtitle":["Multi-Store Capacity-Optimized High-Performance Nearest Neighbor Search for Vector Search Engine"],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":33,"alternative-id":["10.1145\/3357384.3357938","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3357938","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}