BTrDB VS groupcache

Check out http://btrdb.io/ which is a similar idea. It's a distributed database as well. It was designed for storing billions or even trillions of records for electrical data from hundreds of sources at once.

It was written by a couple of friends of mine and others, so I'm not sure how it compares to the article link, as I'm not a databases expert.

As shown in the title, DREAMEMO is a distributed cache with out-of-the-box, high-scalability, modular-design features.The groupcache implementation is referenced, and re-structured, specific module differentiation is as follows:

I remember one of the first real-world uses of Go being the groupcache package: https://github.com/golang/groupcache (to serve Chrome downloads, IIRC?)

> comes with a cache filling mechanism. Whereas memcached just says "Sorry, cache miss", often resulting in a thundering herd of database (or whatever) loads from an unbounded number of clients (which has resulted in several fun outages), groupcache coordinates cache fills such that only one load in one process of an entire replicated set of processes populates the cache, then multiplexes the loaded value to all callers.

I read that group cache (https://github.com/golang/groupcache) can be used to sync servers around a key.

I've not tried this myself, but I've seen it suggested to use groupcache (https://github.com/golang/groupcache) to sync your servers.

https://github.com/golang/groupcache is managing distributed caching that addresses thundering herd problem of memcache.

How it goes sometimes. Check out https://github.com/golang/groupcache and of course the AWS golang SDK.

There is also groupcache, written by the same author as memcached, but better.