Details
-
Improvement
-
Status: Closed
-
Major
-
Resolution: Won't Fix
-
None
-
None
-
None
Description
This ticket is to track work around updating couch_lru to be more performant. So far I have a change that replaces the gb_tree/dict pair with two khash'es. This approach allows us to change the algorithmic speed from O(N log N) to O(1) which should in theory make this faster.
This is motivated by the poor behavior of couch_server when under load by lots of concurrent clients and a high max_dbs_open value.
Attachments
Issue Links
- links to