Timeline for How to store counters on Redis while minimizing potential data loss
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2018 at 21:32 | vote | accept | max pleaner | ||
| Dec 21, 2018 at 21:32 | comment | added | max pleaner | thanks a lot for the response. Your last paragraph is pretty much what I had in mind and had implemented so far. The update job only reads from the queue so it doesn't have to update changed keys. Yes, the queue is a single point of failure. And the cached values (which are immediarely incremented) can be free to expire. Regarding the probabilistic approach, I have to think more deeply about how to do that. | |
| Dec 21, 2018 at 15:54 | history | answered | amon | CC BY-SA 4.0 |