storr

Simple object cacher for R. storr acts as a very simple key-value store (supporting get/set/del for arbitrary R objects as data). The actual storage can be transient or persistent, local or distributed without changing the interface. To allow for distributed access, data is returned by content rather than simply by key (with a key/content lookup step) so that if another process changes the data, storr will retrieve the current version.

• Cached in-memory copies that might be faster to retrieve than on-disk/database copies
• Content-addressable storage, storing and retrieving potentially fewer copies of identical data (useful if lookup is slow or over a network) and to make the system somewhat robust in the face of multiple accessing processes
• Fetch from an external source (e.g. website) if a key is not found locally
• Pluggable storage backends - currently
• environment (memory)
• rds (disk)
• DBI though which you can use:
  • SQLite (via RSQLite)
  • Postgres (via RPostgres)
• Redis (provided by redux)
• rlite (via rrlite, interface function in redux)
• An on disk memory-mapped file interface is implemented in thor

storr always goes back to the common storage (database, filesystem, whatever) for the current object to hash mapping, ensuring consistency when using multiple processes. However, when retrieving or writing the data given a hash we can often avoid accessing the underlying storage. This means that repeated lookups happen quickly while still being able to reflect changes elsewhere; time savings can be substantial where large objects are being stored.

Installation

From CRAN

install.packages("storr")

or install the development version with

remotes::install_github("richfitz/storr@develop", upgrade = FALSE)

Documentation

storr comes with two vignettes:

• storr vignette("storr") outlines basic use and core implementation details.
• external vignette("external") shows how to use storr to cache external resources such as files, web resources, etc, using the storr_external object.