Approximate k-Nearest Neighbour Search for 'bigmemory' Matrices with Annoy R package bigANNOY version 0.3.0 Approximate Euclidean k-nearest neighbour search routines that operate on 'bigmemory::big.matrix' data through Annoy indexes created with 'RcppAnnoy'. The package builds persistent on-disk indexes plus sidecar metadata from streamed 'big.matrix' rows, supports euclidean, angular, Manhattan, and dot-product Annoy metrics, and can either return in-memory results or stream neighbour indices and distances into destination 'bigmemory' matrices. Explicit index life cycle helpers, stronger metadata validation, descriptor-aware file-backed workflows, and benchmark helpers are also included. Software Depends: R (>= 3.5.0) Imports: methods, Rcpp, RcppAnnoy LinkingTo: BH, bigmemory, Rcpp, RcppAnnoy Suggests: bigmemory, knitr, litedown, testthat (>= 3.0.0) Frederic Bertrand <frederic.bertrand@lecnam.net> Comprehensive R Archive Network (CRAN) Frederic Bertrand [aut, cre] GPL (>= 2) 2026-04-01 application/tgz https://CRAN.R-project.org/package=bigANNOY doi:10.32614/CRAN.package.bigANNOY