{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T06:28:38Z","timestamp":1786602518917,"version":"build-2736575974"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/icde65706.2026.00221","type":"proceedings-article","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T19:21:14Z","timestamp":1786562474000},"page":"2971-2983","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Diverse k-Nearest Neighbor Search in Vector Database"],"prefix":"10.1109","author":[{"given":"Jiachen","family":"Zhao","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong","department":["Department of Computer Science and Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Yan","sequence":"additional","affiliation":[{"name":"Institute for Math and AI, Wuhan University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Lo","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong","department":["Department of Computer Science and Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3643806"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3150226"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2024.3392335"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3695461"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.18653\/v1\/2023.emnlp-main.322","article-title":"Query rewriting in retrieval-augmented large language models","volume-title":"The 2023 Conference on Empirical Methods in Natural Language Processing","author":"Ma","year":"2023"},{"key":"ref6","volume-title":"Zelda: Video analytics using vision-language models","author":"Romero","year":"2023"},{"key":"ref7","volume-title":"Interpreting the curse of dimensionality from distance concentration and manifold effect","author":"Peng","year":"2025"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403305"},{"key":"ref9","article-title":"Approximate nearest neighbor negative contrastive learning for dense text retrieval","volume-title":"International Conference on Learning Representations","author":"Xiong","year":"2021"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2018.2889473"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref12","volume-title":"Disk ANN: fast accurate billion-point nearest neighbor search on a single node","author":"Devvrit","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746553"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/3665844.3665854"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3654970"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3078971.3078992"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/OJIES.2020.3012627"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350233"},{"key":"ref19","first-page":"5627","article-title":"Fast greedy map inference for determinantal point process to improve recommendation diversity","volume-title":"Proceedings of the 32nd International Conference on Neural Information Processing Systems, ser. NIPS\u201918","author":"Chen"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2428536.2428538"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1833"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3588908"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3736716"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2025.3618474"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3546779"},{"key":"ref26","volume-title":"Diversity-aware k-maximum inner product search revisited","author":"Huang","year":"2024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.226"},{"key":"ref28","first-page":"177","article-title":"Results of the neurips\u201921 challenge on billion-scale approximate nearest neighbor search","volume-title":"Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, ser. Proceedings of Machine Learning Research, D. Kiela, M. Ciccone, and B. Caputo, Eds.","volume":"176","author":"Simhadri","year":"2022"},{"key":"ref29","volume-title":"Understanding and improving proximity graph based maximum inner product search","author":"Liu","year":"2019"},{"key":"ref30","volume-title":"Approximate diverse k-nearest neighbor search in vector database","author":"Zhao","year":"2025"}],"event":{"name":"2026 IEEE 42nd International Conference on Data Engineering (ICDE)","location":"Montreal, QC, Canada","start":{"date-parts":[[2026,5,4]]},"end":{"date-parts":[[2026,5,8]]}},"container-title":["2026 IEEE 42nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11629178\/11629165\/11629504.pdf?arnumber=11629504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T05:59:17Z","timestamp":1786600757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11629504\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icde65706.2026.00221","relation":{},"subject":[],"published":{"date-parts":[[2026,5]]}}}