{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T22:39:24Z","timestamp":1781908764008,"version":"3.54.5"},"reference-count":81,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:p>\n            Maximum Inner Product Search (MIPS) for high-dimensional vectors is pivotal across databases, information retrieval, and artificial intelligence. Existing methods either reduce MIPS to Nearest Neighbor Search (NNS) while suffering from harmful vector space transformations, or attempt to tackle MIPS directly but struggle to mitigate redundant computations due to the absence of the triangle inequality. This paper presents a novel theoretical framework that equates MIPS with NNS without requiring space transformation, thereby allowing us to leverage advanced graph-based indices for NNS and efficient edge pruning strategies, significantly reducing unnecessary computations. Despite a strong baseline set by our theoretical analysis, we identify and address two persistent challenges to further refine our method: the introduction of the\n            <jats:bold>P<\/jats:bold>\n            roximity Graph with\n            <jats:bold>S<\/jats:bold>\n            pherical\n            <jats:bold>P<\/jats:bold>\n            athway (PSP), designed to mitigate the issue of MIPS solutions clustering around large-norm vectors, and the implementation of\n            <jats:bold>A<\/jats:bold>\n            daptive\n            <jats:bold>E<\/jats:bold>\n            arly\n            <jats:bold>T<\/jats:bold>\n            ermination (AET), which efficiently curtails the excessive exploration once an accuracy bottleneck is reached. Extensive experiments reveal that our method is superior to existing state-of-the-art techniques in search efficiency, scalability, and practical applicability. Compared with state-of-the-art graph-based methods, it achieves an average 35% speed-up in query processing and a 3\u00d7 reduction in index size. Notably, our approach has been validated and deployed in the search engines of Shopee, a well-known online shopping platform. Our code and an industrial-scale dataset for offline evaluation will also be released to address the absence of e-commerce data in public benchmarks.\n          <\/jats:p>","DOI":"10.14778\/3725688.3725705","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T14:19:21Z","timestamp":1756477161000},"page":"1770-1783","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Maximum Inner Product is Query-Scaled Nearest Neighbor"],"prefix":"10.14778","volume":"18","author":[{"given":"Tingyang","family":"Chen","sequence":"first","affiliation":[{"name":"Zhejiang University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cong","family":"Fu","sequence":"additional","affiliation":[{"name":"Shopee Pte. Ltd."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"Wang","sequence":"additional","affiliation":[{"name":"Shopee Pte. Ltd."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangyu","family":"Ke","sequence":"additional","affiliation":[{"name":"Zhejiang University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[{"name":"Zhejiang University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenchao","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yabo","family":"Ni","sequence":"additional","affiliation":[{"name":"Nanyang Technological University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anxiang","family":"Zeng","sequence":"additional","affiliation":[{"name":"Nanyang Technological University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"1998. MNIST. http:\/\/yann.lecun.com\/exdb\/mnist\/. Accessed on April 2 2025."},{"key":"e_1_2_1_2_1","unstructured":"2021. Text-to-Image. https:\/\/research.yandex.com\/blog\/benchmarks-for-billion-scale-similarity-search. Accessed on April 2 2025."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Firas Abuzaid Geet Sethi Peter Bailis and Matei Zaharia. 2019. To index or not to index: Optimizing exact maximum inner product search. In ICDE. 1250\u20131261.","DOI":"10.1109\/ICDE.2019.00114"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Akari Asai Sewon Min Zexuan Zhong and Danqi Chen. 2023. Retrieval-based language models and applications. In ACL. 41\u201346.","DOI":"10.18653\/v1\/2023.acl-tutorials.6"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116880"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583166"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Yoram Bachrach Yehuda Finkelstein Ran Gilad-Bachrach Liran Katzir Noam Koenigstein Nir Nice and Ulrich Paquet. 2014. Speeding up the xbox recommender system using a euclidean transformation for inner-product spaces. In RecSys. 257\u2013264.","DOI":"10.1145\/2645710.2645741"},{"key":"e_1_2_1_8_1","unstructured":"Frank Bowman. 1958. Introduction to Bessel functions."},{"key":"e_1_2_1_9_1","volume-title":"Amir Ingber, and Edo Liberty.","author":"Bruch Sebastian","year":"2023","unstructured":"Sebastian Bruch, Franco Maria Nardini, Amir Ingber, and Edo Liberty. 2023. An approximate algorithm for maximum inner product search over streaming sparse vectors. In TOIS. 1\u201343."},{"key":"e_1_2_1_10_1","unstructured":"Lijie Chen. 2020. On The Hardness of approximate and exact (bichromatic) maximum inner product. In Theory OF Computing. 1\u201350."},{"key":"e_1_2_1_11_1","volume-title":"Maximum Inner Product is Query-Scaled Nearest Neighbor. arXiv preprint arXiv:2503.06882","author":"Chen Tingyang","year":"2025","unstructured":"Tingyang Chen, Cong Fu, Kun Wang, Xiangyu Ke, Yunjun Gao, Wenchao Zhou, Yabo Ni, and Anxiang Zeng. 2025. Maximum Inner Product is Query-Scaled Nearest Neighbor. arXiv preprint arXiv:2503.06882 (2025)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1214\/aoms\/1177731541","article-title":"A note on the theory of moment generating functions","volume":"13","author":"Curtiss John H","year":"1942","unstructured":"John H Curtiss. 1942. A note on the theory of moment generating functions. The Annals of Mathematical Statistics 13, 4 (1942), 430\u2013433.","journal-title":"The Annals of Mathematical Statistics"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3512767","article-title":"Reinforcement routing on proximity graph for efficient recommendation","volume":"41","author":"Feng Chao","year":"2023","unstructured":"Chao Feng, Defu Lian, Xiting Wang, Zheng Liu, Xing Xie, and Enhong Chen. 2023. Reinforcement routing on proximity graph for efficient recommendation. TOIS 41, 1 (2023), 1\u201327.","journal-title":"TOIS"},{"key":"e_1_2_1_14_1","volume-title":"Efanna: An extremely fast approximate nearest neighbor search algorithm based on knn graph. arXiv preprint arXiv:1609.07228","author":"Fu Cong","year":"2016","unstructured":"Cong Fu and Deng Cai. 2016. Efanna: An extremely fast approximate nearest neighbor search algorithm based on knn graph. arXiv preprint arXiv:1609.07228 (2016)."},{"key":"e_1_2_1_15_1","first-page":"4139","article-title":"High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility","volume":"44","author":"Fu Cong","year":"2021","unstructured":"Cong Fu, Changxu Wang, and Deng Cai. 2021. High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility. TPAMI 44, 8 (2021), 4139\u20134150.","journal-title":"TPAMI"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671523"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-023-00222-x"},{"key":"e_1_2_1_19_1","volume-title":"Tree-based optimization: A meta-algorithm for metaheuristic optimization. arXiv preprint arXiv:1809.09284","author":"Ghojogh Benyamin","year":"2018","unstructured":"Benyamin Ghojogh, Saeed Sharifian, and Hoda Mohammadzade. 2018. Tree-based optimization: A meta-algorithm for metaheuristic optimization. arXiv preprint arXiv:1809.09284 (2018)."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Mihajlo Grbovic and Haibin Cheng. 2018. Real-time personalization using em-beddings for search ranking at airbnb. In SIGKDD. 311\u2013320.","DOI":"10.1145\/3219819.3219885"},{"key":"e_1_2_1_21_1","unstructured":"Ruiqi Guo Sanjiv Kumar Krzysztof Choromanski and David Simcha. 2016. Quantization based fast inner product search. In AISTATS. 482\u2013490."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554843"},{"key":"e_1_2_1_23_1","unstructured":"Ruiqi Guo Philip Sun Erik Lindgren Quan Geng David Simcha Felix Chern and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. In ICML. 3887\u20133896."},{"key":"e_1_2_1_24_1","unstructured":"Yifan Hu Yehuda Koren and Chris Volinsky. 2008. Collaborative filtering for implicit feedback datasets. In ICDM. 263\u2013272."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Jui-Ting Huang Ashish Sharma Shuying Sun Li Xia David Zhang Philip Pronin Janani Padmanabhan Giuseppe Ottaviano and Linjun Yang. 2020. Embedding-based retrieval in facebook search. In SIGKDD. 2553\u20132561.","DOI":"10.1145\/3394486.3403305"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1561\u20131570","author":"Huang Qiang","year":"2018","unstructured":"Qiang Huang, Guihong Ma, Jianlin Feng, Qiong Fang, and Anthony KH Tung. 2018. Accurate and fast asymmetric locality-sensitive hashing scheme for maximum inner product search. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1561\u20131570."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC. 604\u2013613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5711-7"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Noam Koenigstein Parikshit Ram and Yuval Shavitt. 2012. Efficient retrieval of recommendations in a matrix factorization framework. In CIKM. 535\u2013544.","DOI":"10.1145\/2396761.2396831"},{"key":"e_1_2_1_31_1","unstructured":"Patrick Lewis Ethan Perez Aleksandra Piktus Fabio Petroni Vladimir Karpukhin Naman Goyal Heinrich K\u00fcttler Mike Lewis Wen-tau Yih Tim Rockt\u00e4schel et al. 2020. Retrieval-augmented generation for knowledge-intensive NLP tasks. In NeurIPS. 9459\u20139474."},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Conglong Li Minjia Zhang David G Andersen and Yuxiong He. 2020. Improving approximate nearest neighbor search through learned adaptive early termination. In SIGMOD. 2539\u20132554.","DOI":"10.1145\/3318464.3380600"},{"key":"e_1_2_1_33_1","volume-title":"Man Lung Yiu, and Nikos Mamoulis.","author":"Li Hui","year":"2017","unstructured":"Hui Li, Tsz Nam Chan, Man Lung Yiu, and Nikos Mamoulis. 2017. FEXIPRO: fast and exact inner product retrieval in recommender systems. In SIGMOD. 835\u2013850."},{"key":"e_1_2_1_34_1","volume-title":"Kelvin KW Ng, and Ti-chung Cheng","author":"Li Jinfeng","year":"2018","unstructured":"Jinfeng Li, Xiao Yan, Jian Zhang, An Xu, James Cheng, Jie Liu, Kelvin KW Ng, and Ti-chung Cheng. 2018. A general and efficient querying method for learning to hash. In SIGMOD. 1333\u20131347."},{"key":"e_1_2_1_35_1","first-page":"1475","article-title":"Approximate nearest neighbor search on high dimensional data\u2014experiments, analyses, and improvement","volume":"32","author":"Li Wen","year":"2019","unstructured":"Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Mingjie Li, Wenjie Zhang, and Xuemin Lin. 2019. Approximate nearest neighbor search on high dimensional data\u2014experiments, analyses, and improvement. TKDE 32, 8 (2019), 1475\u20131488.","journal-title":"TKDE"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Jie Liu Xiao Yan Xinyan Dai Zhirong Li James Cheng and Ming-Chang Yang. 2020. Understanding and improving proximity graph based maximum inner product search. In AAAI. 139\u2013146.","DOI":"10.1609\/aaai.v34i01.5344"},{"key":"e_1_2_1_37_1","first-page":"215","article-title":"EI-LSH: An early-termination driven I\/O efficient incremental c-approximate nearest neighbor search","volume":"30","author":"Liu Wanqi","year":"2021","unstructured":"Wanqi Liu, Hanchen Wang, Ying Zhang, Wei Wang, Lu Qin, and Xuemin Lin. 2021. EI-LSH: An early-termination driven I\/O efficient incremental c-approximate nearest neighbor search. PVLDB 30, 2 (2021), 215\u2013235.","journal-title":"PVLDB"},{"key":"e_1_2_1_38_1","first-page":"246","article-title":"HVS: hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search","volume":"15","author":"Lu Kejing","year":"2021","unstructured":"Kejing Lu, Mineichi Kudo, Chuan Xiao, and Yoshiharu Ishikawa. 2021. HVS: hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search. PVLDB 15, 2 (2021), 246\u2013258.","journal-title":"PVLDB"},{"key":"e_1_2_1_39_1","unstructured":"Hengzhao Ma Jianzhong Li and Yong Zhang. 2024. Reconsidering Tree based Methods for k-Maximum Inner-Product Search: The LRUS-CoverTree. In ICDE."},{"key":"e_1_2_1_40_1","volume-title":"Approximate nearest neighbor algorithm based on navigable small world graphs. IS 45","author":"Malkov Yury","year":"2014","unstructured":"Yury Malkov, Alexander Ponomarenko, Andrey Logvinov, and Vladimir Krylov. 2014. Approximate nearest neighbor algorithm based on navigable small world graphs. IS 45 (2014), 61\u201368."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_2_1_42_1","first-page":"521","article-title":"Jensen's inequality","volume":"43","author":"McShane EJ","year":"1937","unstructured":"EJ McShane. 1937. Jensen's inequality. AMS 43, 8 (1937), 521\u2013527.","journal-title":"AMS"},{"key":"e_1_2_1_43_1","unstructured":"Stanislav Morozov and Artem Babenko. 2018. Non-metric similarity graphs for maximum inner product search. In NeurIPS. 4726\u20134735."},{"key":"e_1_2_1_44_1","unstructured":"Behnam Neyshabur and Nathan Srebro. 2015. On symmetric and asymmetric lshs for inner product search. In ICML. 1926\u20131934."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"e_1_2_1_46_1","volume-title":"Survey of vector database management systems. arXiv preprint arXiv:2310.14021","author":"Pan James Jie","year":"2023","unstructured":"James Jie Pan, Jianguo Wang, and Guoliang Li. 2023. Survey of vector database management systems. arXiv preprint arXiv:2310.14021 (2023)."},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Ninh Pham. 2021. Simple yet efficient algorithms for maximum inner product search via extreme order statistics. In SIGKDD. 1339\u20131347.","DOI":"10.1145\/3447548.3467345"},{"key":"e_1_2_1_48_1","unstructured":"Liudmila Prokhorenkova and Aleksandr Shekhovtsov. 2020. Graph-based nearest neighbor search: From practice to theory. In ICML. 7803\u20137813."},{"key":"e_1_2_1_49_1","volume-title":"Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al.","author":"Radford Alec","year":"2021","unstructured":"Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al. 2021. Learning transferable visual models from natural language supervision. In ICML. 8748\u20138763."},{"key":"e_1_2_1_50_1","volume-title":"Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever.","author":"Radford Alec","year":"2021","unstructured":"Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever. 2021. Learning Transferable Visual Models From Natural Language Supervision. In ICML. 8748\u20138763."},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Parikshit Ram and Alexander G Gray. 2012. Maximum inner-product search using cone trees. In SIGKDD. 931\u2013939.","DOI":"10.1145\/2339530.2339677"},{"key":"e_1_2_1_52_1","unstructured":"Christoph Schuhmann Romain Beaumont Richard Vencu Cade Gordon Ross Wightman Mehdi Cherti Theo Coombes Aarush Katta Clayton Mullis Mitchell Wortsman et al. 2022. Laion-5b: An open large-scale dataset for training next generation image-text models. In NeurIPS. 25278\u201325294."},{"key":"e_1_2_1_53_1","unstructured":"Minjoon Seo Jinhyuk Lee Tom Kwiatkowski Ankur Parikh Ali Farhadi and Hannaneh Hajishirzi. 2019. Real-time open-domain question answering with dense-sparse phrase index. In ACL. 4430\u20134441."},{"key":"e_1_2_1_54_1","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). In NIPS. 2321\u20132329."},{"key":"e_1_2_1_55_1","unstructured":"Anshumali Shrivastava and Ping Li. 2015. Improved asymmetric locality sensitive hashing (ALSH) for Maximum Inner Product Search (MIPS). In UAI. 812\u2013821."},{"key":"e_1_2_1_56_1","volume-title":"Extreme value theory. Handbook of applicable mathematics 7, 437\u2013471","author":"Smith Richard L","year":"1990","unstructured":"Richard L Smith. 1990. Extreme value theory. Handbook of applicable mathematics 7, 437\u2013471 (1990), 18."},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Yang Song Yu Gu Rui Zhang and Ge Yu. 2021. ProMIPS: Efficient high-dimensional C-approximate maximum inner product search with a lightweight index. In ICDE. 1619\u20131630.","DOI":"10.1109\/ICDE51399.2021.00143"},{"key":"e_1_2_1_58_1","volume-title":"SOAR: improved indexing for approximate nearest neighbor search. NeurIPS 36","author":"Sun Philip","year":"2024","unstructured":"Philip Sun, David Simcha, Dave Dopson, Ruiqi Guo, and Sanjiv Kumar. 2024. SOAR: improved indexing for approximate nearest neighbor search. NeurIPS 36 (2024)."},{"key":"e_1_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Shulong Tan Zhaozhuo Xu Weijie Zhao Hongliang Fei Zhixin Zhou and Ping Li. 2021. Norm adjusted proximity graph for fast inner product retrieval. In SIGKDD. 1552\u20131560.","DOI":"10.1145\/3447548.3467412"},{"key":"e_1_2_1_60_1","unstructured":"Shulong Tan Zhixin Zhou Zhaozhuo Xu and Ping Li. 2019. On efficient retrieval of top similarity vectors. In EMNLP-IJCNLP. 5236\u20135246."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996452"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747647"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457550"},{"key":"e_1_2_1_64_1","volume-title":"Must: An effective and scalable framework for multimodal search of target modality. In ICDE. 4747\u20134759.","author":"Wang Mengzhao","year":"2024","unstructured":"Mengzhao Wang, Xiangyu Ke, Xiaoliang Xu, Lu Chen, Yunjun Gao, Pinpin Huang, and Runkai Zhu. 2024. Must: An effective and scalable framework for multimodal search of target modality. In ICDE. 4747\u20134759."},{"key":"e_1_2_1_65_1","first-page":"1964","article-title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search","volume":"4","author":"Wang Mengzhao","year":"2021","unstructured":"Mengzhao Wang, Xiaoliang Xu, Qiang Yue, and Yuxiang Wang. 2021. A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. PVLDB 4, 2 (2021), 1964\u20131978.","journal-title":"PVLDB"},{"key":"e_1_2_1_66_1","volume-title":"Personalized embedding-based e-Commerce recommendations at eBay. arXiv preprint arXiv:2102.06156","author":"Wang Tian","year":"2021","unstructured":"Tian Wang, Yuri M. Brovman, and Sriganesh Madhvanath. 2021. Personalized embedding-based e-Commerce recommendations at eBay. arXiv preprint arXiv:2102.06156 (2021)."},{"key":"e_1_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Xueyi Wang. 2011. A fast exact k-nearest neighbors algorithm for high dimensional search using k-means clustering and triangle inequality. In The 2011 international joint conference on neural networks. 1293\u20131299.","DOI":"10.1109\/IJCNN.2011.6033373"},{"key":"e_1_2_1_68_1","unstructured":"Roger Weber Hans-J\u00f6rg Schek and Stephen Blott. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB. 194\u2013205."},{"key":"e_1_2_1_69_1","volume-title":"https:\/\/mathworld.wolfram.com\/","author":"Weisstein Eric W","year":"2002","unstructured":"Eric W Weisstein. 2002. Hypersphere. https:\/\/mathworld.wolfram.com\/ (2002)."},{"key":"e_1_2_1_70_1","doi-asserted-by":"crossref","unstructured":"Da Xu Chuanwei Ruan Evren Korpeoglu Sushant Kumar and Kannan Achan. 2020. Product knowledge graph embedding for e-commerce. In WSDM. 672\u2013680.","DOI":"10.1145\/3336191.3371778"},{"key":"e_1_2_1_71_1","unstructured":"Xiao Yan Jinfeng Li Xinyan Dai Hongzhi Chen and James Cheng. 2018. Normranging LSH for maximum inner product search. In NeurIPS. 2956\u20132965."},{"key":"e_1_2_1_72_1","volume-title":"Pase: Postgresql ultra-high-dimensional approximate nearest neighbor search extension. In SIGMOD. 2241\u20132253.","author":"Yang Wen","year":"2020","unstructured":"Wen Yang, Tao Li, Gai Fang, and Hong Wei. 2020. Pase: Postgresql ultra-high-dimensional approximate nearest neighbor search extension. In SIGMOD. 2241\u20132253."},{"key":"e_1_2_1_73_1","unstructured":"Hsiang-Fu Yu Prateek Jain Purushottam Kar and Inderjit Dhillon. 2014. Large-scale multi-label learning with missing labels. In ICML. 593\u2013601."},{"key":"e_1_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Han Zhang Songlin Wang Kang Zhang Zhiling Tang Yunjiang Jiang Yun Xiao Weipeng Yan and Wenyun Yang. 2020. Towards personalized and semantic retrieval: An end-to-end solution for e-commerce search via embedding learning. In SIGIR. 2407\u20132416.","DOI":"10.1145\/3397271.3401446"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Jin Zhang Defu Lian Haodi Zhang Baoyun Wang and Enhong Chen. 2023. Query-aware quantization for maximum inner product search. In AAAI. 4875\u20134883.","DOI":"10.1609\/aaai.v37i4.25613"},{"key":"e_1_2_1_76_1","volume-title":"VBASE: Unifying online vector similarity search and relational queries via relaxed monotonicity. In OSDI. 377\u2013395.","author":"Zhang Qianxi","year":"2023","unstructured":"Qianxi Zhang, Shuotao Xu, Qi Chen, Guoxin Sui, Jiadong Xie, Zhizhen Cai, Yaoqi Chen, Yinxuan He, Yuqing Yang, Fan Yang, et al. 2023. VBASE: Unifying online vector similarity search and relational queries via relaxed monotonicity. In OSDI. 377\u2013395."},{"key":"e_1_2_1_77_1","unstructured":"Wayne Xin Zhao Kun Zhou Junyi Li Tianyi Tang Xiaolei Wang Yupeng Hou Yingqian Min Beichen Zhang Junjie Zhang Zican Dong et al. 2023. A survey of large language models. arXiv preprint arXiv:2303.18223 (2023)."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.14778\/3579075.3579084"},{"key":"e_1_2_1_79_1","volume-title":"Anthony KH Tung, and Sai Wu","author":"Zheng Yuxin","year":"2016","unstructured":"Yuxin Zheng, Qi Guo, Anthony KH Tung, and Sai Wu. 2016. Lazylsh: Approximate nearest neighbor search for multiple distance functions with a single index. In SIGMOD. 2023\u20132037."},{"key":"e_1_2_1_80_1","first-page":"199","article-title":"Cross-domain image retrieval: methods and applications","volume":"11","author":"Zhou Xiaoping","year":"2022","unstructured":"Xiaoping Zhou, Xiangyu Han, Haoran Li, Jia Wang, and Xun Liang. 2022. Cross-domain image retrieval: methods and applications. IJMIR 11, 3 (2022), 199\u2013218.","journal-title":"IJMIR"},{"key":"e_1_2_1_81_1","unstructured":"Zhixin Zhou Shulong Tan Zhaozhuo Xu and Ping Li. 2019. M\u00f6bius transformation for fast inner product search on graph. In NeurIPS. 8218\u20138229."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3725688.3725705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T14:21:30Z","timestamp":1756477290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3725688.3725705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":81,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10.14778\/3725688.3725705"],"URL":"https:\/\/doi.org\/10.14778\/3725688.3725705","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"2025-08-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}