{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:12:56Z","timestamp":1781763176829,"version":"3.54.5"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFB3308300"],"award-info":[{"award-number":["2023YFB3308300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.sysarc.2026.103771","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T17:18:35Z","timestamp":1772731115000},"page":"103771","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["CD-ANN: Scalable Approximate Nearest Neighbor search on client-side devices"],"prefix":"10.1016","volume":"175","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7193-9993","authenticated-orcid":false,"given":"Chaoxia","family":"Qin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8767-4896","authenticated-orcid":false,"given":"Yixiong","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0679-4601","authenticated-orcid":false,"given":"Bing","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5278-0406","authenticated-orcid":false,"given":"Kan","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3040-2065","authenticated-orcid":false,"given":"Duo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.sysarc.2026.103771_b1","doi-asserted-by":"crossref","unstructured":"Y. Chronis, H. Caminal, Y. Papakonstantinou, et al., Filtered vector search: State-of-the-art and research opportunities, in: Proceedings of the VLDB Endowment, 2025, pp. 5488\u20135492.","DOI":"10.14778\/3750601.3750700"},{"key":"10.1016\/j.sysarc.2026.103771_b2","first-page":"1","article-title":"Graph retrieval-augmented generation: A survey","volume":"19","author":"Peng","year":"2024","journal-title":"ACM Trans. Inf. Syst."},{"key":"10.1016\/j.sysarc.2026.103771_b3","doi-asserted-by":"crossref","unstructured":"A. Salemi, H. Zamani, Evaluating retrieval quality in retrieval-augmented generation, in: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2024, pp. 2395\u20132400.","DOI":"10.1145\/3626772.3657957"},{"key":"10.1016\/j.sysarc.2026.103771_b4","unstructured":"W. Zou, R. Geng, B. Wang, et al., Poisonedrag: Knowledge corruption attacks to retrieval-augmented generation of large language models, in: 34th USENIX Security Symposium, USENIX Security 25, 2025, pp. 3827\u20133844."},{"issue":"5","key":"10.1016\/j.sysarc.2026.103771_b5","first-page":"1","article-title":"Embedding compression in recommender systems: A survey","volume":"56","author":"Li","year":"2024","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"10.1016\/j.sysarc.2026.103771_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3725853","article-title":"Cfairllm: Consumer fairness evaluation in large-language model recommender system","volume":"16","author":"Deldjoo","year":"2025","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"3","key":"10.1016\/j.sysarc.2026.103771_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3712589","article-title":"A thorough performance benchmarking on lightweight embedding-based recommender systems","volume":"43","author":"Tran","year":"2025","journal-title":"ACM Trans. Inf. Syst."},{"issue":"11","key":"10.1016\/j.sysarc.2026.103771_b8","doi-asserted-by":"crossref","first-page":"4710","DOI":"10.14778\/3749646.3749724","article-title":"Turbocharging vector databases using modern SSDs","volume":"18","author":"Shim","year":"2025","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"10.1016\/j.sysarc.2026.103771_b9","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TC.2022.3155956","article-title":"Accelerating large-scale graph-based nearest neighbor search on a computational storage platform","volume":"72","author":"Kim","year":"2022","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.sysarc.2026.103771_b10","unstructured":"J. Jang, H. Choi, H. Bae, et al., Cxl-anns: Software- hardware collaborative memory disaggregation and computation for billion-scale approximate nearest neighbor search, in: 2023 USENIX Annual Technical Conference, USENIX ATC 23, 2023, pp. 585\u2013600."},{"key":"10.1016\/j.sysarc.2026.103771_b11","series-title":"Mongodb vector search benchmark overview","author":"MongoDB","year":"2024"},{"key":"10.1016\/j.sysarc.2026.103771_b12","unstructured":"Y. Liang, S. Zhang, K. Li, et al., Unleashing the full potential of product quantization for large-scale image retrieval, in: Proceedings of the 37th International Conference on Neural Information Processing Systems, 2023, pp. 1\u201313."},{"key":"10.1016\/j.sysarc.2026.103771_b13","doi-asserted-by":"crossref","unstructured":"X. Gan, Y. Wang, X. Zhao, et al., Autodpq: Automated differentiable product quantization for embedding compression, in: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2023, pp. 1833\u20131837.","DOI":"10.1145\/3539618.3591953"},{"key":"10.1016\/j.sysarc.2026.103771_b14","doi-asserted-by":"crossref","unstructured":"Z. Qiu, J. Liu, Y. Chen, et al., Hihpq: hierarchical hyperbolic product quantization for unsupervised image retrieval, in: Proceedings of the Thirty\u2013Eighth AAAI Conference on Artificial Intelligence and Thirty \u2013Sixth Conference on Innovative Applications of Artificial Intelligence and Fourteenth Symposium on Educational Advances in Artificial Intelligence, 2024, pp. 4614\u20134622.","DOI":"10.1609\/aaai.v38i5.28261"},{"key":"10.1016\/j.sysarc.2026.103771_b15","unstructured":"S. Jayaram, F. Devvrit, H.V. Simhadri, et al., Diskann: Fast accurate billion-point nearest neighbor search on a single node, in: 33rd Conference on Neural Information Processing Systems, NeurIPS 2019, 2019, pp. 1\u201311."},{"key":"10.1016\/j.sysarc.2026.103771_b16","unstructured":"Y. Wang, S. Liu, Z. Li, et al., Leann: A low-storage vector index for personal devices, in: The 1st Workshop on Vector Databases, 2025, pp. 1\u201316."},{"key":"10.1016\/j.sysarc.2026.103771_b17","doi-asserted-by":"crossref","unstructured":"M. Perron, F.R. Castro, D. DeWitt, et al., Starling: A scalable query engine on cloud functions, in: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, 2020, pp. 131\u2013141.","DOI":"10.1145\/3318464.3380609"},{"issue":"8","key":"10.1016\/j.sysarc.2026.103771_b18","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1109\/TKDE.2019.2909204","article-title":"Approximate nearest neighbor search on high dimensional data \u2014 experiments, analyses, and improvement","volume":"32","author":"Li","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.sysarc.2026.103771_b19","unstructured":"Q. Zhang, S. Xu, Q. Chen, et al., VBASE: Unifying online vector similarity search and relational queries via relaxed monotonicity, in: 17th USENIX Symposium on Operating Systems Design and Implementation, OSDI 23, pp. 377\u2013395."},{"key":"10.1016\/j.sysarc.2026.103771_b20","doi-asserted-by":"crossref","unstructured":"I. Azizi, K. Echihabi, T. Palpanas, Graph-based vector search: An experimental evaluation of the state-of-the-art, in: Proceedings of the ACM on Management of Data, 2025, pp. 1\u201331.","DOI":"10.1145\/3709693"},{"key":"10.1016\/j.sysarc.2026.103771_b21","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.future.2024.03.002","article-title":"Annproof: Building a verifiable and efficient outsourced approximate nearest neighbor search system on blockchain","volume":"156","author":"Lu","year":"2024","journal-title":"Future Gener. Comput. Syst."},{"issue":"6","key":"10.1016\/j.sysarc.2026.103771_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2020.102382","article-title":"Blockchain-based public auditing for big data in cloud storage","volume":"57","author":"Li","year":"2020","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.sysarc.2026.103771_b23","article-title":"Nakamoto consensus to accelerate supervised classification algorithms for multiparty computing","volume":"2021","author":"Zhang","year":"2021","journal-title":"Secur. Commun. Netw."},{"issue":"2","key":"10.1016\/j.sysarc.2026.103771_b24","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/PL00010672","article-title":"Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances","volume":"9","author":"Fu","year":"2000","journal-title":"VLDB J."},{"key":"10.1016\/j.sysarc.2026.103771_b25","doi-asserted-by":"crossref","unstructured":"P. Ram, K. Sinaha, Revisiting kd-tree for nearest neighbor search, in: Proceedings of the 25th Acm Sigkdd International Conference on Knowledge Discovery and Data Mining, 2019, pp. 1378\u20131388.","DOI":"10.1145\/3292500.3330875"},{"key":"10.1016\/j.sysarc.2026.103771_b26","doi-asserted-by":"crossref","unstructured":"K. Lampropoulos, F. Zardbani, N. Mamoulis, et al., Adaptive indexing in high-dimensional metric spaces, in: Proceedings of the VLDB Endowment, 2023, pp. 2525\u20132537.","DOI":"10.14778\/3603581.3603592"},{"key":"10.1016\/j.sysarc.2026.103771_b27","doi-asserted-by":"crossref","unstructured":"F. Zhang, M. Jiang, G. Hou, et al., Efficient dynamic indexing for range filtered approximate nearest neighbor search, in: Proceedings of the ACM on Management of Data, 2025, pp. 1\u201326.","DOI":"10.1145\/3725401"},{"key":"10.1016\/j.sysarc.2026.103771_b28","first-page":"1","article-title":"The faiss library","author":"Douze","year":"2025","journal-title":"IEEE Trans. Big Data"},{"issue":"3","key":"10.1016\/j.sysarc.2026.103771_b29","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/TBDATA.2019.2921572","article-title":"Billion-scale similarity search with gpus","volume":"7","author":"Johnson","year":"2019","journal-title":"IEEE Trans. Big Data"},{"issue":"4","key":"10.1016\/j.sysarc.2026.103771_b30","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","volume":"42","author":"Malkov","year":"2018","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.sysarc.2026.103771_b31","doi-asserted-by":"crossref","unstructured":"L. Dai, Z. Yuan, W. Li, et al., Agc: A unified architecture for accelerating k-nearest neighbor graph construction in vector search, in: Proceedings of the 43rd IEEE\/ACM International Conference on Computer-Aided Design, 2024, pp. 1\u20139.","DOI":"10.1145\/3676536.3676769"},{"issue":"8","key":"10.1016\/j.sysarc.2026.103771_b32","first-page":"4139","article-title":"High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility","volume":"44","author":"Fu","year":"2021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.sysarc.2026.103771_b33","doi-asserted-by":"crossref","unstructured":"M. Jiang, Z. Yang, F. Zhang, et al., Digra: A dynamic graph indexing for approximate nearest neighbor search with range filter, in: Proceedings of the ACM on Management of Data, 2025, pp. 1\u201326.","DOI":"10.1145\/3725399"},{"key":"10.1016\/j.sysarc.2026.103771_b34","doi-asserted-by":"crossref","unstructured":"S. Mathurin, K. Manohar, P. Hosein, Vector search performance enhancements on limited-memory edge devices, in: 2024 IEEE\/ACM 17th International Conference on Utility and Cloud Computing, UCC, 2024, pp. 483\u2013488.","DOI":"10.1109\/UCC63386.2024.00075"},{"key":"10.1016\/j.sysarc.2026.103771_b35","doi-asserted-by":"crossref","unstructured":"Q. Xu, F. Zhang, C. Li, et al., Harmony: A scalable distributed vector database for high-throughput approximate nearest neighbor search, in: Proceedings of the ACM on Management of Data, 2025, pp. 1\u201328.","DOI":"10.1145\/3749167"},{"key":"10.1016\/j.sysarc.2026.103771_b36","unstructured":"Q. Chen, B. Zhao, H.D. Wang, et al., Spann: highly-efficient billion-scale approximate nearest neighbor search, in: Proceedings of the 35th International Conference on Neural Information Processing Systems, 2021, pp. 1\u201314."},{"key":"10.1016\/j.sysarc.2026.103771_b37","doi-asserted-by":"crossref","unstructured":"A. Akhil, G. Sivashankar, Zonal hnsw: Scalable approximate nearest neighbor search for billion-scale datasets, in: Proceedings of the 3rd International Conference on Self Sustainable Artificial Intelligence Systems, ICSSAS, 2025, pp. 1663\u20131670.","DOI":"10.1109\/ICSSAS66150.2025.11081070"},{"key":"10.1016\/j.sysarc.2026.103771_b38","doi-asserted-by":"crossref","unstructured":"S. Liang, Y. Wang, Y. Yuan, et al., Vstore: in-storage graph based vector search accelerator, in: Proceedings of the 59th ACM\/IEEE Design Automation Conference, DAC\u201922, 2022, pp. 997\u20131002.","DOI":"10.1145\/3489517.3530560"},{"key":"10.1016\/j.sysarc.2026.103771_b39","series-title":"Datasets for approximate nearest neighbor search","author":"Amsaleg","year":"2010"},{"key":"10.1016\/j.sysarc.2026.103771_b40","doi-asserted-by":"crossref","unstructured":"H.R. J\u00e9gou, Tavenard, M. Douze, et al., Searching in one billion vectors: re-rank with source coding, in: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, 2011, pp. 861\u2013864.","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"10.1016\/j.sysarc.2026.103771_b41","doi-asserted-by":"crossref","unstructured":"J. Pennington, R. Socher, C.D. Manning, Glove: Global vectors for word representation, in: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing, 2014, pp. 1532\u20131543.","DOI":"10.3115\/v1\/D14-1162"},{"key":"10.1016\/j.sysarc.2026.103771_b42","doi-asserted-by":"crossref","unstructured":"A. Babenko, V. Lempitsky, Efficient indexing of billion-scale datasets of deep descriptors, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 2055\u20132063.","DOI":"10.1109\/CVPR.2016.226"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762126000895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762126000895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T10:36:45Z","timestamp":1777718205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762126000895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":42,"alternative-id":["S1383762126000895"],"URL":"https:\/\/doi.org\/10.1016\/j.sysarc.2026.103771","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"CD-ANN: Scalable Approximate Nearest Neighbor search on client-side devices","name":"articletitle","label":"Article Title"},{"value":"Journal of Systems Architecture","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.sysarc.2026.103771","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"103771"}}