0

I'm working on a project where I need to apply LFU on the the value for each key. Value is something x. Now while adding value for that key, I need to delete those which has been used very less. We can use the sorted set of the dragonFly here like zpopmin, zincrby to increase the frequency of each x in the value list but this operation is taking K iops if we increase frequency of k x. How to optimise this?

Improve this question
1
  • here the expectation is to reduce the number of iops. Commented Sep 26 at 10:47
Related questions
1753
Disabling Chrome cache for website development
892
What does it mean for code to be "cache-friendly"?
746
What's the difference between Cache-Control: max-age=0 and no-cache?
Load 6 more related questions Show fewer related questions

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.