{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T08:44:14Z","timestamp":1782895454941,"version":"3.54.5"},"reference-count":45,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,25]]},"DOI":"10.1109\/ipdps65963.2026.00032","type":"proceedings-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T20:55:16Z","timestamp":1782852916000},"page":"251-263","source":"Crossref","is-referenced-by-count":0,"title":["GPU-Accelerated Approximate Nearest Neighbor Search via PCA-Augmented Graph Indexing for Vector Databases"],"prefix":"10.1109","author":[{"given":"Yuanpeng","family":"Wang","sequence":"first","affiliation":[{"name":"The University of Sydney, School of Computer Science,Centre for Distributed and High-Performance Computing,Sydney,Australia,NSW 2006"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"MohammadReza","family":"HoseinyFarahabady","sequence":"additional","affiliation":[{"name":"The University of Sydney, School of Computer Science,Centre for Distributed and High-Performance Computing,Sydney,Australia,NSW 2006"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Albert Y.","family":"Zomaya","sequence":"additional","affiliation":[{"name":"The University of Sydney, School of Computer Science,Centre for Distributed and High-Performance Computing,Sydney,Australia,NSW 2006"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/355826.355832"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90222-u"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4324\/9780203461891_chapter_3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-024-00864-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SPC.2013.6735131"},{"key":"ref7","first-page":"573","article-title":"An optimal algorithm for approximate nearest neighbor searching","volume-title":"Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arya"},{"key":"ref8","first-page":"271","article-title":"Approximate nearest neighbor queries in fixed dimensions","volume-title":"Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arya"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759061"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187718"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1978915.1978919"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3415580"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref14","first-page":"1842","article-title":"Meta-learning with memory-augmented neural networks","volume-title":"Proc. of 33rd Intl Conf. on Machine Learning","volume":"48","author":"Santoro"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1285"},{"key":"ref16","first-page":"9459","article-title":"Retrieval-augmented generation for knowledge-intensive nlp tasks","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Lewis","year":"2020"},{"key":"ref17","article-title":"A Comprehensive Survey on Vector Database: Storage and Retrieval Technique, Challenge","author":"Han","year":"2023"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3558000"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.5.419"},{"key":"ref20","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume-title":"Proc. of the 25th Intl. Confe. on Very Large Data Bases","author":"Gionis"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096830"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3725401"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3725399"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2025.107822"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594527"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3695053.3731013"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457550"},{"key":"ref33","article-title":"Dimensionality-Reduction Techniques for Approximate Nearest Neighbor Search: A Survey and Evaluation"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00323"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"issue":"4","key":"ref36","first-page":"824","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","volume-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence","volume":"42","author":"Malkov","year":"2018"},{"key":"ref37","volume-title":"Principal Component Analysis","author":"Jolliffe","year":"2002"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-46994-7_23"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2025.3618474"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref42","article-title":"Dbpedia entities openai 1m: 1m openai embeddings of dbpedia entities (1536 dimensions)","author":"Shivendu","year":"2023"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"ref45","volume-title":"RAPIDS, GPU accelerated data science"}],"event":{"name":"2026 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","location":"New Orleans, LA, USA","start":{"date-parts":[[2026,5,25]]},"end":{"date-parts":[[2026,5,29]]}},"container-title":["2026 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11575315\/11575316\/11575371.pdf?arnumber=11575371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T07:48:47Z","timestamp":1782892127000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11575371\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,25]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/ipdps65963.2026.00032","relation":{},"subject":[],"published":{"date-parts":[[2026,5,25]]}}}