{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T02:02:14Z","timestamp":1772935334997,"version":"3.50.1"},"reference-count":25,"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.11401069","type":"proceedings-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:57:57Z","timestamp":1772830677000},"page":"746-751","source":"Crossref","is-referenced-by-count":0,"title":["Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data"],"prefix":"10.1109","author":[{"given":"Morgan E.","family":"Prior","sequence":"first","affiliation":[{"name":"Computer Science, Tufts University,Medford,MA,02155"}]},{"given":"Thomas J.","family":"Howard","sequence":"additional","affiliation":[{"name":"Computer Science and Statistics, University of Rhode Island,Kingston,RI,02881"}]},{"given":"Oliver","family":"McLaughlin","sequence":"additional","affiliation":[{"name":"Computer Science and Statistics, University of Rhode Island,Kingston,RI,02881"}]},{"given":"Terry","family":"Ferguson","sequence":"additional","affiliation":[{"name":"Computer Science and Statistics, University of Rhode Island,Kingston,RI,02881"}]},{"given":"Najib","family":"Ishaq","sequence":"additional","affiliation":[{"name":"Computer Science and Statistics, University of Rhode Island,Kingston,RI,02881"}]},{"given":"Noah M.","family":"Daniels","sequence":"additional","affiliation":[{"name":"Computer Science and Statistics, University of Rhode Island,Kingston,RI,02881"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1197891"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gks1219"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2797022"},{"key":"ref4","author":"Brown","year":"2020","journal-title":"Language Models are Few-Shot Learners"},{"key":"ref5","volume":"abs\/2303.08774","year":"2023","journal-title":"Gpt-4 technical report"},{"key":"ref6","volume":"abs\/2307.09288","author":"T","year":"2023","journal-title":"Llama 2: Open foundation and fine-tuned chat models"},{"key":"ref7","first-page":"8748","article-title":"Learning transferable visual models from natural language supervision","volume-title":"International Conference on Machine Learning.","author":"Radford","year":"2021"},{"key":"ref8","author":"Dosovitskiy","year":"2020","journal-title":"An image is worth 16 # 16 words: Transformers for image recognition at scale"},{"key":"ref9","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":"2016","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref11","author":"Bernhardsson","journal-title":"Annoy"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3589282"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/s23020629"},{"issue":"8","key":"ref15","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume-title":"Soviet physics doklady","volume":"10","author":"Levenshtein","year":"1966"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3230734"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cels.2015.08.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9005688"},{"key":"ref19","volume-title":"Faiss-ivf"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/BigData52589.2021.9671566"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/852"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/366622.366642"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74048-3_4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1118101"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-015-0069-3"}],"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\/11401069.pdf?arnumber=11401069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T07:30:15Z","timestamp":1772868615000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11401069\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/bigdata66926.2025.11401069","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}