JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
376
stars
43
forks
source link
[Question] Applying TopK on an endless stream doesn't blow memory ? #47
Closed
ghost closed 2 years ago
Also I'm trying to implement top searches on a website, so is it a good idea to implement TopK ? How to proceed with cache in this case also ?
Thanks a lot !