{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T06:27:56Z","timestamp":1786602476385,"version":"build-2736575974"},"reference-count":93,"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.00125","type":"proceedings-article","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T19:09:50Z","timestamp":1786561790000},"page":"1630-1644","source":"Crossref","is-referenced-by-count":0,"title":["Overcoming the Sync-Compute Dilemma in Parallel Graph-Based Vector Retrieval"],"prefix":"10.1109","author":[{"given":"Qiji","family":"Mo","sequence":"first","affiliation":[{"name":"College of Computer Science, Nankai University","place":["Tianjin, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyuan","family":"Hua","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University","place":["Tianjin, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zebin","family":"Yao","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University","place":["Tianjin, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lixiao","family":"Cui","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University","place":["Tianjin, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University","place":["Tianjin, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoguang","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University","place":["Tianjin, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zijing","family":"Wei","sequence":"additional","affiliation":[{"name":"Alibaba Group Holding Limited","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyu","family":"Liu","sequence":"additional","affiliation":[{"name":"Alibaba Group Holding Limited","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianxiao","family":"Tang","sequence":"additional","affiliation":[{"name":"Alibaba Group Holding Limited","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaozhi","family":"Liu","sequence":"additional","affiliation":[{"name":"Alibaba Group Holding Limited","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Qu","sequence":"additional","affiliation":[{"name":"Alibaba Group Holding Limited","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330759"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403280"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457550"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554843"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2025.3618474"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415541"},{"key":"ref8","volume-title":"Alayadb: The data foundation for efficient and effective long-context llm inference","author":"Deng","year":"2025"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3722212.3724444"},{"key":"ref10","volume-title":"From local to global: A graph rag approach to query-focused summarization","author":"Edge","year":"2025"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.52202\/079017-1902"},{"key":"ref12","volume-title":"Rat: Retrieval augmented thoughts elicit context-aware reasoning in long-horizon generation","author":"Wang","year":"2024"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3701716.3715313"},{"key":"ref14","volume-title":"Raganything: All-in-one rag framework","author":"Guo","year":"2025"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/icde65448.2025.00230"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/icde65448.2025.00294"},{"key":"ref17","article-title":"Search-r1: Training llms to reason and leverage search engines with reinforcement learning","author":"Jin","year":"2025","journal-title":"arXiv preprint"},{"key":"ref18","volume-title":"Demystifying and enhancing the efficiency of large language model based search agents","author":"Yang","year":"2025"},{"key":"ref19","volume-title":"Reasoning rag via system 1 or system 2: A survey on reasoning agentic retrieval-augmented generation for industry challenges","author":"Liang","year":"2025"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671470"},{"key":"ref21","volume-title":"Retroinfer: A vector-storage approach for scalable long-context llm inference","author":"Chen","year":"2025"},{"key":"ref22","volume-title":"Retrievalattention: Accelerating long-context llm inference via vector retrieval","author":"Liu","year":"2024"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-018-0019-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00214"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00303"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/3565816.3565819"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.377"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/3665844.3665851"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/3603581.3603592"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390171"},{"key":"ref35","volume-title":"ANNOY library","author":"Bernhardsson","year":"2025"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3709743"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714633"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00762-0"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3408815"},{"key":"ref40","first-page":"3189","article-title":"Soar: Improved indexing for approximate nearest neighbor search","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Sun","year":"2023"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_13"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3654970"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3725413"},{"key":"ref45","doi-asserted-by":"crossref","DOI":"10.14778\/3712221.3712244","volume-title":"Efficient data-aware distance comparison operations for high-dimensional approximate nearest neighbor search","author":"Deng","year":"2024"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856324"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2019.2952606"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/icde60146.2024.00370"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref53","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","article-title":"Approximate nearest neighbor algorithm based on navigable small world graphs","volume":"45","author":"Malkov","year":"2014","journal-title":"Information Systems"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref55","volume-title":"High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility","author":"Fu","year":"2021"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3709730"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/icde65448.2025.00047"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/icde65448.2025.00032"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681959"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3588908"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.106970"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583318"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3652583.3658117"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489506"},{"key":"ref67","volume-title":"DiskANN: fast accurate billion-point nearest neighbor search on a single node","author":"Subramanya","year":"2019"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/3639269"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"ref71","doi-asserted-by":"crossref","first-page":"2318","DOI":"10.18653\/v1\/2024.findings-acl.137","article-title":"M3-embedding: Multi-linguality, multi-functionality, multi-granularity text embeddings through self-knowledge distillation","volume-title":"Findings of the Association for Computational Linguistics: ACL 2024","author":"Chen","year":"2024"},{"key":"ref72","volume-title":"Gemini embedding: Generalizable embeddings from gemini","author":"Lee","year":"2025"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577527"},{"key":"ref74","volume-title":"Efficient graph-based approximate nearest neighbor search achieving: Low latency without throughput loss","author":"Luo","year":"2025"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380600"},{"key":"ref77","volume-title":"Laion-400m: Open dataset of clip-filtered 400 million image-text pairs","author":"Schuhmann","year":"2021"},{"key":"ref78","first-page":"1532","article-title":"Glove: Global vectors for word representation","author":"Pennington","year":"2014","journal-title":"Empirical Methods in Natural Language Processing (EMNLP)"},{"key":"ref79","volume-title":"Text-to-image dataset for billion-scale similarity search","author":"Babenko","year":"2025"},{"key":"ref80","first-page":"171","article-title":"Achieving low-latency graph-based vector search via aligning best-first search algorithm with ssd","volume-title":"19th USENIX Symposium on Operating Systems Design and Implementation (OSDI 25)","author":"Guo"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/3769783"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00175"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.226"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS64566.2025.00026"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v19i1.13350"},{"key":"ref87","author":"Burns","year":"2010","journal-title":"Parallel best-first search: Optimal and suboptimal solutions"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00323"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3161156"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00046"},{"key":"ref91","volume-title":"Bang: Billion-scale approximate nearest neighbor search using a single gpu","author":"V.","year":"2025"},{"key":"ref92","first-page":"23","article-title":"Fast vector query processing for large datasets beyond GPU memory with reordered pipelining","volume-title":"21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24)","author":"Zhang"},{"key":"ref93","first-page":"171","article-title":"Towards high-throughput and low-latency billion-scale vector search via CPU\/GPU collaborative filtering and re-ranking","volume-title":"23rd USENIX Conference on File and Storage Technologies (FAST 25)","author":"Tian"}],"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\/11629205.pdf?arnumber=11629205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T05:48:50Z","timestamp":1786600130000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11629205\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":93,"URL":"https:\/\/doi.org\/10.1109\/icde65706.2026.00125","relation":{},"subject":[],"published":{"date-parts":[[2026,5]]}}}