rnewson commented on PR #5625: URL: https://github.com/apache/couchdb/pull/5625#issuecomment-3209915418
these results are really good, so I'm ok with the added complexity. As for what depth to cache to; we are forced to choose a level because of the eviction mechanism (which was chosen for speed of execution I think). If, instead, we evicted more intelligently, we could just use a memory bound (which ops could move up/down if necessary). that is, try to evict non-leaf nodes we haven't hit recently. The Java caching library Caffeine operates this way and has some research on how optimal it is (https://github.com/ben-manes/caffeine/wiki/Efficiency : Window TinyLfu). An eviction scheme like this takes the guesswork out of things, and would basically tune itself. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: notifications-unsubscr...@couchdb.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org
