Skip to content

bigANNOY

0.3.0

Approximate k-Nearest Neighbour Search for 'bigmemory' Matrices with Annoy

0packages depend
1.8Kdownloads / year
80.3%test coverage
13/13checks pass

Overview

About
Maintained by Frederic BertrandFirst published 2026-04-011 releasesCRAN page ↗GitHub ↗

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.

Install

Health

CRAN checks
13OK
Slowest check: 3.4 min · r-devel-windows-x86_64
Code health
Yes
Tests · ratio 0.17
80.3%
Coverage · measured lines
100%
Documentation · exports
3
Dependencies · direct
Check history
  • OK2026-08-05
    13 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • NOTE2026-08-01
    12 OK · 1 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • OK2026-04-22
    13 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • ERROR2026-04-18
    12 OK · 0 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE
  • OK2026-04-02
    7 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE

Documentation

Documentation
READMEYes · 470 wordsVignettesYes · dynamicpkgdown siteNoNEWSYes · 100% structuredCode of conductNoContributing guideNo
Examples that run
not tracked
Documented parameters
100%
Return-value docs
100%
References docs
0%

Downloads

1.8K
CRAN downloads in the past year
Rank #9,721 · ~5/day · ~152/mo
Daily download trend is not available in this view yet.
20730 days
96690 days
1.8K1 year
Compare downloads with other packages →
Also on151 r2u

Repository

Repository
1Stars
0Forks
0Open issues
0Open PRs
0Releases
9Commits
1Contributors
9 commits · Last activity 2026-03-27 · 0% stars, 30d

Stars over time

2026-03-27 · 12026-07-07 · 1

Repository practices

Upstream repositoryBeta

4 development-tooling and community-health practices detected across 4 families in the upstream repository

Checks run against github.com/fbertran/bigannoy on 2026-08-16.

Continuous integration (1)
GitHub Actions
Docs source (1)
README.Rmd
Lint, format, editor (1)
RStudio project
Git structural (1)
.gitattributes
How this is detected·Detection ruleset v1 (2026-07-18)

Dependencies

Declared dependencies
10 external dependencies (excludes base and recommended)
Depends (1)
R >= 3.5.0
Imports (3)
Enhances (0)
none
Reverse dependencies
0direct
0indirect

Nothing depends on this yet.

Code & Tests

People & History

People (1)
Maintainer (1)
Author, Maintainer
Authors (1)
Author, Maintainer
Package Timeline

1 release. R releases are shown for context.

  • R
    R 4.6.0 released · 2026-04-24
  • 0.3.0Latest
    2026-04-01 · current release
  • R
    R 4.5.0 released · 2025-04-11

Package metadata

First published
2026-04-01
Total releases
1 / 1 yrs
License
GPL (>= 2) OSI
Minimum R
≥ 3.5.0
Download size
99 KB
Installed size
not tracked yet
With dependencies
not tracked yet

Cite

Cite this package

Run in R for the authors' preferred citation:

citation("bigANNOY")
Bertrand, F. (2026). bigANNOY: Approximate k-Nearest Neighbour Search for 'bigmemory' Matrices with Annoy (Version 0.3.0) [Computer software]. https://doi.org/10.32614/CRAN.package.bigANNOY

This is what citation() produces when a package has no citation file of its own. If it prints something else, use that.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

APA

Balamuta, J. J. (2026). R Observatory: Metrics for bigANNOY version 0.3.0 [Data set]. HJJB, LLC. Data release v2026-08-22. https://doi.org/10.5281/zenodo.21843040

From data release v2026-08-22, which the citation names so these numbers can be found later. More on citing and the projects behind them.

Report a problem with this page →

Privacy choices

These apply to this browser and are stored on this device only. Nothing about your choice is sent to us.

Read the privacy policy