190 points by ksec 3 days ago | 88 comments | View on ycombinator
simonw about 8 hours ago |
9dev about 11 hours ago |
One, it would be cool to be able to embed it, similar to sqlite, directly into applications.
Two, the HA story is so much more complicated than it should be. I totally acknowledge that concurrency and distributed computing is hard, but it should not require reading heaps of documentation and understanding two entirely separate multi-node approaches only to figure out there are lots of subtle strings attached that make it impractical for many applications.
tapoxi about 11 hours ago |
ShakataGaNai about 6 hours ago |
epolanski about 11 hours ago |
https://redis.io/blog/diving-deep-into-rediss-new-array-data...
focusgroup0 about 10 hours ago |
caraphon about 8 hours ago |
This is awesome!
And arrays look great too. Lots to play with.
undefined about 8 hours ago |
Xotic007 about 8 hours ago |
fga_qwrh about 8 hours ago |
The website looks like openclaw's website.
I had a look for this and it turns out it's slightly mis-described there - it's not a window counter, it's a "GCRA (Generic Cell Rate Algorithm)" - a leaky bucket algorithm. Code here: https://github.com/redis/redis/blob/unstable/src/gcra.c
The code comments say it was heavily influenced by https://github.com/brandur/redis-cell by Brandur Leach.
It's a neat algorithm (I just learned about it today) - it only needs to store a single integer for each rate-limited key, which is the "Theoretical Arrival Time" when the bucket would next be empty.