[Question] Applying TopK on an endless stream doesn't blow memory ?

Callidon / bloom-filters

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

https://callidon.github.io/bloom-filters/

MIT License

369 stars 42 forks source link

Closed ghost closed 2 years ago

ghost commented 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 !