{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T01:38:52Z","timestamp":1772933932784,"version":"3.50.1"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2025,12,8]]},"DOI":"10.1109\/bigdata66926.2025.11402093","type":"proceedings-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:57:57Z","timestamp":1772830677000},"page":"7444-7451","source":"Crossref","is-referenced-by-count":0,"title":["IVF++: A Flexible and Efficient Algorithm for Approximate Nearest Neighbor Search under Attribute Constraint"],"prefix":"10.1109","author":[{"given":"Reon","family":"Uemura","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, The University of Osaka,Osaka,Japan"}]},{"given":"Daichi","family":"Amagata","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, The University of Osaka,Osaka,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457550"},{"issue":"12","key":"ref6","first-page":"3152","article-title":"Analyticdbv: A hybrid analytical engine towards query fusion for structured and unstructured data","volume-title":"Proceedings of the VLDB Endowment","volume":"13","author":"Wei","year":"2020"},{"issue":"5","key":"ref7","first-page":"643","article-title":"Pmlsh: A fast and accurate lsh framework for high-dimensional approximate nn search","volume-title":"Proceedings of the VLDB Endowment","volume":"13","author":"Zheng","year":"2020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/3665844.3665854"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00214"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3295831"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3654970"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424580"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3408815"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3588908"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3067706"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86475-0_22"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref20","first-page":"13766","article-title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","author":"Subramanya","year":"2019","journal-title":"NeurIPS"},{"key":"ref21","first-page":"5199","article-title":"Spann: Highly-efficient billion-scale approximate nearest neighborhood search","author":"Chen","year":"2021","journal-title":"NeurIPS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3589777"},{"key":"ref23","article-title":"Caps: A practical partition index for filtered similarity search","author":"Gupta","year":"2023","journal-title":"arXiv preprint"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3654923"},{"key":"ref25","first-page":"15738","article-title":"An efficient and robust framework for approximate nearest neighbor search with attribute constraint","author":"Wang","year":"2023","journal-title":"NeurIPS"},{"key":"ref26","article-title":"Constrained approximate similarity search on proximity graph","author":"Zhao","year":"2022","journal-title":"arXiv preprint"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583552"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557610"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386131"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3698814"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/3717755.3717770"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978759.1"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452782"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00729-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"ref37","first-page":"2055","article-title":"Efficient indexing of billion-scale datasets of deep descriptors","author":"Babenko","year":"2016","journal-title":"CVPR"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2025.3618474"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657780"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-8295-9_32"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-75823-2_1"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/BigData52589.2021.9671858"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/BigData55660.2022.10020690"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452781"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3557915.3560935"},{"key":"ref47","article-title":"Approximate nearest neighbor search with window filters","author":"Engels","year":"2024","journal-title":"ICML"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3639324"}],"event":{"name":"2025 IEEE International Conference on Big Data (BigData)","location":"Macau, China","start":{"date-parts":[[2025,12,8]]},"end":{"date-parts":[[2025,12,11]]}},"container-title":["2025 IEEE International Conference on Big Data (BigData)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11400704\/11400712\/11402093.pdf?arnumber=11402093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T06:55:36Z","timestamp":1772866536000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11402093\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/bigdata66926.2025.11402093","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}