[
https://issues.apache.org/jira/browse/COUCHDB-3191?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15583559#comment-15583559
]
ASF subversion and git services commented on COUCHDB-3191:
----------------------------------------------------------
Commit 39357ed8102e9ea3367a012ed17c9a0940cdc38f in couchdb-couch's branch
refs/heads/HACK-benchmark-COUCHDB-3191-improve-couch-lru-performance from
[~paul.joseph.davis]
[ https://git-wip-us.apache.org/repos/asf?p=couchdb-couch.git;h=39357ed ]
Rewrite couch_lru
This changes couch_lru from using a gb_tree and dict to a pair of
khashes. Using these we can implement an approximation of a standard
linked list by using references as links and looking up each node in the
nodes khash.
COUCHDB-3191
> Improve couch_lru performance
> -----------------------------
>
> Key: COUCHDB-3191
> URL: https://issues.apache.org/jira/browse/COUCHDB-3191
> Project: CouchDB
> Issue Type: Improvement
> Components: Database Core
> Reporter: Paul Joseph Davis
>
> 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.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
