Adding uniqueness with Sorted Sets and HyperLogLog
This section presents two different Time Series implementations that support unique insertions (for example, unique visitors or concurrent video plays), which are very similar to the previous solutions.
The first implementation uses Sorted Sets, and it is based on the previous Hash implementation. The second implementation uses HyperLogLog, and it is based on the previous String implementation. Since these new implementations are very similar to previous ones, only the lines highlighted in bold are explained.
Each solution has pros and cons:
- The Sorted Set solution works well and is 100% accurate
- The HyperLogLog solution uses less memory than the Sorted Set solution, but it is only 99.19% accurate ...
Get Redis Essentials now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.