{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T17:39:47Z","timestamp":1794332387379,"version":"4.9.0"},"reference-count":45,"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"}],"funder":[{"name":"Hong Kong RGC","award":["12201925,12202024,12203123,C2003-23Y"],"award-info":[{"award-number":["12201925,12202024,12203123,C2003-23Y"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/icde65706.2026.00252","type":"proceedings-article","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T19:22:07Z","timestamp":1786562527000},"page":"3433-3445","source":"Crossref","is-referenced-by-count":1,"title":["BAMG: A Block-Aware Monotonic Graph Index for Disk-Based Approximate Nearest Neighbor Search"],"prefix":"10.1109","author":[{"given":"Huiling","family":"Li","sequence":"first","affiliation":[{"name":"Hong Kong Baptist University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-024-00864-x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132901"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3169\/mta.6.2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424580"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00032"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00169"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00635-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3588908"},{"key":"ref12","article-title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","volume":"32","author":"Jayaram Subramanya","year":"2019","journal-title":"NeurIPS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"key":"ref14","first-page":"10672","article-title":"Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory","volume":"33","author":"Ren","year":"2020","journal-title":"NeurIPS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3067706"},{"key":"ref19","article-title":"Learning to screen for fast softmax inference on large vocabulary neural networks","author":"Chen","year":"2018","journal-title":"arXiv preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557098"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.105"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3639269"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3788853.3801879"},{"key":"ref24","article-title":"Disk-resident graph ann search: An experimental evaluation","author":"Chen","year":"2026","journal-title":"arXiv preprint"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583552"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/3749646.3749697"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3726302.3729996"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3709693"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(80)90066-7"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1988.754602"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2010.25"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2013.13"},{"key":"ref35","article-title":"Freshdiskann: A fast and accurate graph-based ann index for streaming similarity search","author":"Singh","year":"2021","journal-title":"arXiv preprint"},{"key":"ref36","first-page":"29433","article-title":"Parameter prediction for unseen deep architectures","volume":"34","author":"Knyazev","year":"2021","journal-title":"NeurIPS"},{"key":"ref37","article-title":"Laion-400m: Open dataset of clip-filtered 400 million image-text pairs","author":"Schuhmann","year":"2021","journal-title":"arXiv preprint"},{"key":"ref38","article-title":"Ms marco: A human generated machine reading comprehension dataset","author":"Bajaj","year":"2016","journal-title":"arXiv preprint"},{"key":"ref39","first-page":"171","article-title":"Achieving Low-Latency graph-based vector search via Aligning Best-First Search Algorithm with SSD","author":"Guo","year":"2025","journal-title":"OSDI"},{"key":"ref40","first-page":"5199","article-title":"Spann: Highly-efficient billion-scale approximate nearest neighborhood search","volume":"34","author":"Chen","year":"2021","journal-title":"NeurIPS"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref42","first-page":"2055","article-title":"Efficient indexing of billion-scale datasets of deep descriptors","author":"Babenko","year":"2016","journal-title":"IEEE\/CVF CVPR"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3769838"}],"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\/11629502.pdf?arnumber=11629502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T05:50:17Z","timestamp":1786600217000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11629502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/icde65706.2026.00252","relation":{},"subject":[],"published":{"date-parts":[[2026,5]]}}}