{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:35:04Z","timestamp":1768109704504,"version":"3.49.0"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"5","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:p>Maximum inner product search (MIPS) in high-dimensional spaces has wide applications but is computationally expensive due to the curse of dimensionality. Existing studies employ asymmetric transformations that reduce the MIPS problem to a nearest neighbor search (NNS) problem, which can be solved using locality-sensitive hashing (LSH). However, these studies usually maintain multiple hash tables and locally examine them one by one, which may cause additional costs on probing unnecessary points. In addition, LSH is applied without taking into account the properties of the inner product. In this paper, we develop a fast search framework FARGO for MIPS on large-scale, high-dimensional data. We propose a global multi-probing (GMP) strategy that exploits the properties of the inner product to globally examine high quality candidates. In addition, we develop two optimization techniques. First, different with existing transformations that introduce either distortion errors or data distribution imbalances, we design a novel transformation, called random XBOX transformation, that avoids the negative effects of data distribution imbalances. Second, we propose a global adaptive early termination condition that finds results quickly and offers theoretical guarantees. We conduct extensive experiments with real-world data that offer evidence that FARGO is capable of outperforming existing proposals in terms of both accuracy and efficiency.<\/jats:p>","DOI":"10.14778\/3579075.3579084","type":"journal-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T17:10:26Z","timestamp":1678122626000},"page":"1100-1112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["FARGO: Fast Maximum Inner Product Search via Global Multi-Probing"],"prefix":"10.14778","volume":"16","author":[{"given":"Xi","family":"Zhao","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology"}]},{"given":"Bolong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology"}]},{"given":"Xiaomeng","family":"Yi","sequence":"additional","affiliation":[{"name":"Zilliz"}]},{"given":"Xiaofan","family":"Luan","sequence":"additional","affiliation":[{"name":"Zilliz"}]},{"given":"Charles","family":"Xie","sequence":"additional","affiliation":[{"name":"Zilliz"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[{"name":"Aalborg University"}]}],"member":"320","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"1","article-title":"Matrix Factorization Techniques for Context-Aware Collaborative Filtering Recommender Systems: A Survey","volume":"11","author":"Abdi Mohamed Hussein","year":"2018","unstructured":"Mohamed Hussein Abdi , George Onyango Okeyo , and Ronald Waweru Mwangi . 2018 . Matrix Factorization Techniques for Context-Aware Collaborative Filtering Recommender Systems: A Survey . Sci 11 , 2 (2018), 1 -- 10 . Mohamed Hussein Abdi, George Onyango Okeyo, and Ronald Waweru Mwangi. 2018. Matrix Factorization Techniques for Context-Aware Collaborative Filtering Recommender Systems: A Survey. Sci 11, 2 (2018), 1--10.","journal-title":"Sci"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Thomas Dybdahl Ahle Rasmus Pagh Ilya P. Razenshteyn and Francesco Silvestri. 2016. On the Complexity of Inner Product Similarity Join. In PODS. 151--164. Thomas Dybdahl Ahle Rasmus Pagh Ilya P. Razenshteyn and Francesco Silvestri. 2016. On the Complexity of Inner Product Similarity Join. In PODS. 151--164.","DOI":"10.1145\/2902251.2902285"},{"key":"e_1_2_1_3_1","unstructured":"Alexandr Andoni. 2004. E2lsh: Exact euclidean locality-sensitive hashing. http:\/\/web.mit.edu\/andoni\/www\/LSH\/ (2004). Alexandr Andoni. 2004. E2lsh: Exact euclidean locality-sensitive hashing. http:\/\/web.mit.edu\/andoni\/www\/LSH\/ (2004)."},{"key":"e_1_2_1_4_1","volume-title":"Razenshteyn","author":"Andoni Alexandr","year":"2014","unstructured":"Alexandr Andoni , Piotr Indyk , Huy L. Nguyen , and Ilya P . Razenshteyn . 2014 . Beyond Locality-Sensitive Hashing. In SODA. 1018--1028. Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, and Ilya P. Razenshteyn. 2014. Beyond Locality-Sensitive Hashing. In SODA. 1018--1028."},{"key":"e_1_2_1_5_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--264. 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--264.","DOI":"10.1145\/2645710.2645741"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345465"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Moses Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380--388. Moses Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380--388.","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_8_1","first-page":"26","article-title":"On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product","volume":"25","author":"Chen Lijie","year":"2018","unstructured":"Lijie Chen . 2018 . On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product . Electronic Colloquium on Computational Complexity (ECCC) 25 (2018), 26 . Lijie Chen. 2018. On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. Electronic Colloquium on Computational Complexity (ECCC) 25 (2018), 26.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_2_1_9_1","volume-title":"Jiu Liu, and James Cheng.","author":"Dai Xinyan","year":"2020","unstructured":"Xinyan Dai , Xiao Yan , Kelvin Kai Wing Ng , Jiu Liu, and James Cheng. 2020 . Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search. In AAAI. 51--58. Xinyan Dai, Xiao Yan, Kelvin Kai Wing Ng, Jiu Liu, and James Cheng. 2020. Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search. In AAAI. 51--58."},{"key":"e_1_2_1_10_1","volume-title":"Mirrokni","author":"Datar Mayur","year":"2004","unstructured":"Mayur Datar , Nicole Immorlica , Piotr Indyk , and Vahab S . Mirrokni . 2004 . Locality-sensitive hashing scheme based on p-stable distributions. In SoCG. 253--262. Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In SoCG. 253--262."},{"key":"e_1_2_1_11_1","unstructured":"Thomas L. Dean Mark A. Ruzon Mark Segal Jonathon Shlens Sudheendra Vijayanarasimhan and Jay Yagnik. 2013. Fast Accurate Detection of 100 000 Object Classes on a Single Machine. In CVPR. 1814--1821. Thomas L. Dean Mark A. Ruzon Mark Segal Jonathon Shlens Sudheendra Vijayanarasimhan and Jay Yagnik. 2013. Fast Accurate Detection of 100 000 Object Classes on a Single Machine. In CVPR. 1814--1821."},{"key":"e_1_2_1_12_1","volume-title":"KDD Cup (JMLR","volume":"18","author":"Dror Gideon","year":"2012","unstructured":"Gideon Dror , Noam Koenigstein , Yehuda Koren , and Markus Weimer . 2012 . The Yahoo! Music Dataset and KDD-Cup '11 . In KDD Cup (JMLR , Vol. 18). 8-- 18 . Gideon Dror, Noam Koenigstein, Yehuda Koren, and Markus Weimer. 2012. The Yahoo! Music Dataset and KDD-Cup '11. In KDD Cup (JMLR, Vol. 18). 8--18."},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Marco Fraccaro Ulrich Paquet and Ole Winther. 2016. Indexable Probabilistic Matrix Factorization for Maximum Inner Product Search. In AAAI. 1554--1560. Marco Fraccaro Ulrich Paquet and Ole Winther. 2016. Indexable Probabilistic Matrix Factorization for Maximum Inner Product Search. In AAAI. 1554--1560.","DOI":"10.1609\/aaai.v30i1.10234"},{"key":"e_1_2_1_14_1","unstructured":"Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In VLDB. 518--529. Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In VLDB. 518--529."},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Anna Gogolou Theophanis Tsandilas Karima Echihabi Anastasia Bezerianos and Themis Palpanas. 2020. Data Series Progressive Similarity Search with Probabilistic Quality Guarantees. In SIGMOD. 1857--1873. Anna Gogolou Theophanis Tsandilas Karima Echihabi Anastasia Bezerianos and Themis Palpanas. 2020. Data Series Progressive Similarity Search with Probabilistic Quality Guarantees. In SIGMOD. 1857--1873.","DOI":"10.1145\/3318464.3389751"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a014"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Xiangnan He Lizi Liao Hanwang Zhang Liqiang Nie Xia Hu and Tat-Seng Chua. 2017. Neural Collaborative Filtering. In WWW. 173--182. Xiangnan He Lizi Liao Hanwang Zhang Liqiang Nie Xia Hu and Tat-Seng Chua. 2017. Neural Collaborative Filtering. In WWW. 173--182.","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"e_1_2_1_19_1","volume-title":"Tung","author":"Huang Qiang","year":"2018","unstructured":"Qiang Huang , Guihong Ma , Jianlin Feng , Qiong Fang , and Anthony K. H . Tung . 2018 . Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search. In KDD. 1561--1570. Qiang Huang, Guihong Ma, Jianlin Feng, Qiong Fang, and Anthony K. H. Tung. 2018. Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search. In KDD. 1561--1570."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In STOC. 604--613. Piotr Indyk and Rajeev Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In STOC. 604--613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Prateek Jain and Ashish Kapoor. 2009. Active learning for large multi-class problems. In CVPR. 762--769. Prateek Jain and Ashish Kapoor. 2009. Active learning for large multi-class problems. In CVPR. 762--769.","DOI":"10.1109\/CVPR.2009.5206651"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5711-7"},{"key":"e_1_2_1_24_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--544. Noam Koenigstein Parikshit Ram and Yuval Shavitt. 2012. Efficient retrieval of recommendations in a matrix factorization framework. In CIKM. 535--544.","DOI":"10.1145\/2396761.2396831"},{"key":"e_1_2_1_25_1","volume-title":"SISAP (Lecture Notes in Computer Science","volume":"249","author":"Kraus Naama","year":"2016","unstructured":"Naama Kraus , David Carmel , Idit Keidar , and Meni Orenbach . 2016 . NearBucket-LSH: Efficient Similarity Search in P2P Networks . In SISAP (Lecture Notes in Computer Science , Vol. 9939). 236-- 249 . Naama Kraus, David Carmel, Idit Keidar, and Meni Orenbach. 2016. NearBucket-LSH: Efficient Similarity Search in P2P Networks. In SISAP (Lecture Notes in Computer Science, Vol. 9939). 236--249."},{"key":"e_1_2_1_26_1","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--2554. Conglong Li Minjia Zhang David G. Andersen and Yuxiong He. 2020. Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination. In SIGMOD. 2539--2554."},{"key":"e_1_2_1_27_1","volume-title":"Kelvin Kai Wing Ng, and Ti-chung Cheng","author":"Li Jinfeng","year":"2018","unstructured":"Jinfeng Li , Xiao Yan , Jian Zhang , An Xu , James Cheng , Jie Liu , Kelvin Kai Wing Ng, and Ti-chung Cheng . 2018 . A General and Efficient Querying Method for Learning to Hash. In SIGMOD. 1333--1347. Jinfeng Li, Xiao Yan, Jian Zhang, An Xu, James Cheng, Jie Liu, Kelvin Kai Wing Ng, and Ti-chung Cheng. 2018. A General and Efficient Querying Method for Learning to Hash. In SIGMOD. 1333--1347."},{"key":"e_1_2_1_28_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--146. 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--146.","DOI":"10.1609\/aaai.v34i01.5344"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Wanqi Liu Hanchen Wang Ying Zhang Wei Wang and Lu Qin. 2019. I-LSH: I\/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space. In ICDE. 1670--1673. Wanqi Liu Hanchen Wang Ying Zhang Wei Wang and Lu Qin. 2019. I-LSH: I\/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space. In ICDE. 1670--1673.","DOI":"10.1109\/ICDE.2019.00169"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00635-4"},{"key":"e_1_2_1_31_1","volume-title":"Zhe Wang, Moses Charikar, and Kai Li.","author":"Lv Qin","year":"2007","unstructured":"Qin Lv , William Josephson , Zhe Wang, Moses Charikar, and Kai Li. 2007 . Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search. In VLDB. 950--961. Qin Lv, William Josephson, Zhe Wang, Moses Charikar, and Kai Li. 2007. Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search. In VLDB. 950--961."},{"key":"e_1_2_1_32_1","unstructured":"Stanislav Morozov and Artem Babenko. 2018. Non-metric Similarity Graphs for Maximum Inner Product Search. In NeurIPS. 4726--4735. Stanislav Morozov and Artem Babenko. 2018. Non-metric Similarity Graphs for Maximum Inner Product Search. In NeurIPS. 4726--4735."},{"key":"e_1_2_1_33_1","first-page":"1926","article-title":"On Symmetric and Asymmetric LSHs for Inner Product Search","volume":"37","author":"Neyshabur Behnam","year":"2015","unstructured":"Behnam Neyshabur and Nathan Srebro . 2015 . On Symmetric and Asymmetric LSHs for Inner Product Search . In ICML , Vol. 37. 1926 -- 1934 . Behnam Neyshabur and Nathan Srebro. 2015. On Symmetric and Asymmetric LSHs for Inner Product Search. In ICML, Vol. 37. 1926--1934.","journal-title":"ICML"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11184"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Ninh Pham. 2021. Simple Yet Efficient Algorithms for Maximum Inner Product Search via Extreme Order Statistics. In KDD. ACM 1339--1347. Ninh Pham. 2021. Simple Yet Efficient Algorithms for Maximum Inner Product Search via Extreme Order Statistics. In KDD. ACM 1339--1347.","DOI":"10.1145\/3447548.3467345"},{"key":"e_1_2_1_36_1","volume-title":"Gray","author":"Ram Parikshit","year":"2012","unstructured":"Parikshit Ram and Alexander G . Gray . 2012 . Maximum inner-product search using cone trees. In KDD. 931--939. Parikshit Ram and Alexander G. Gray. 2012. Maximum inner-product search using cone trees. In KDD. 931--939."},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Fumin Shen Wei Liu Shaoting Zhang Yang Yang and Heng Tao Shen. 2015. Learning Binary Codes for Maximum Inner Product Search. In ICCV. 4148--4156. Fumin Shen Wei Liu Shaoting Zhang Yang Yang and Heng Tao Shen. 2015. Learning Binary Codes for Maximum Inner Product Search. In ICCV. 4148--4156.","DOI":"10.1109\/ICCV.2015.472"},{"key":"e_1_2_1_38_1","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS). In NIPS. 2321--2329. Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS). In NIPS. 2321--2329."},{"key":"e_1_2_1_39_1","unstructured":"Anshumali Shrivastava and Ping Li. 2015. Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS). In UAI. 812--821. Anshumali Shrivastava and Ping Li. 2015. Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS). In UAI. 812--821."},{"key":"e_1_2_1_40_1","volume-title":"ProMIPS: Efficient High-Dimensional c-Approximate Maximum Inner Product Search with a Lightweight Index","author":"Song Yang","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. IEEE , 1619--1630. 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. IEEE, 1619--1630."},{"key":"e_1_2_1_41_1","unstructured":"Shulong Tan Zhixin Zhou Zhaozhuo Xu and Ping Li. 2019. On Efficient Retrieval of Top Similarity Vectors. In EMNLP\/IJCNLP (1). 5235--5245. Shulong Tan Zhixin Zhou Zhaozhuo Xu and Ping Li. 2019. On Efficient Retrieval of Top Similarity Vectors. In EMNLP\/IJCNLP (1). 5235--5245."},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Yufei Tao Ke Yi Cheng Sheng and Panos Kalnis. 2009. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD. 563--576. Yufei Tao Ke Yi Cheng Sheng and Panos Kalnis. 2009. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD. 563--576.","DOI":"10.1145\/1559845.1559905"},{"key":"e_1_2_1_43_1","first-page":"91","article-title":"The n-fold convolution of a mixed density and mass function","volume":"8","author":"von Lanzenauer Christoph Haehling","year":"1974","unstructured":"Christoph Haehling von Lanzenauer and William N Lundberg . 1974 . The n-fold convolution of a mixed density and mass function . ASTIN Bulletin: The Journal of the IAA 8 , 1 (1974), 91 -- 103 . Christoph Haehling von Lanzenauer and William N Lundberg. 1974. The n-fold convolution of a mixed density and mass function. ASTIN Bulletin: The Journal of the IAA 8, 1 (1974), 91--103.","journal-title":"The Journal of the IAA"},{"key":"e_1_2_1_44_1","volume-title":"WAIM","volume":"9098","author":"Wang Mengshuang","year":"2015","unstructured":"Mengshuang Wang , Jun Ma , Shanshan Huang , and Peizhe Cheng . 2015 . Combining Positive and Negative Feedbacks with Factored Similarity Matrix for Recommender Systems . In WAIM , Vol. 9098 . 233--246. Mengshuang Wang, Jun Ma, Shanshan Huang, and Peizhe Cheng. 2015. Combining Positive and Negative Feedbacks with Factored Similarity Matrix for Recommender Systems. In WAIM, Vol. 9098. 233--246."},{"key":"e_1_2_1_45_1","unstructured":"Xiao Yan Jinfeng Li Xinyan Dai Hongzhi Chen and James Cheng. 2018. Norm-Ranging LSH for Maximum Inner Product Search. In NeurIPS. 2956--2965. Xiao Yan Jinfeng Li Xinyan Dai Hongzhi Chen and James Cheng. 2018. Norm-Ranging LSH for Maximum Inner Product Search. In NeurIPS. 2956--2965."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377374"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Yuxin Zheng Qi Guo Anthony K. H. Tung and Sai Wu. 2016. LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index. In SIGMOD. 2023--2037. Yuxin Zheng Qi Guo Anthony K. H. Tung and Sai Wu. 2016. LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index. In SIGMOD. 2023--2037.","DOI":"10.1145\/2882903.2882930"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3579075.3579084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:30:36Z","timestamp":1729027836000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3579075.3579084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["10.14778\/3579075.3579084"],"URL":"https:\/\/doi.org\/10.14778\/3579075.3579084","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"2023-03-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}