Package Usage: go: github.com/dgraph-io/ristretto

Ristretto is a fast, fixed size, in-memory cache with a dual focus on throughput and hit ratio performance. You can easily add Ristretto to an existing system and keep the most valuable data where you need it. This package includes multiple probabalistic data structures needed for admission/eviction metadata. Most are Counting Bloom Filter variations, but a caching-specific feature that is also required is a "freshness" mechanism, which basically serves as a "lifetime" process. This freshness mechanism was described in the original TinyLFU paper 1, but other mechanisms may be better suited for certain data distributions.
5 versions
Latest release: over 1 year ago
7,591 dependent packages

View more package details: https://packages.ecosyste.ms/registries/proxy.golang.org/packages/github.com/dgraph-io/ristretto

View more repository details: https://repos.ecosyste.ms/hosts/GitHub/repositories/dgraph-io%2Fristretto

Dependent Repos 11,346