A few weeks ago I asked on Stack Overflow about a doubt I had concerning the Neo4j page cache mechanism (which sadly went unanswered here <http://stackoverflow.com/questions/35789192/when-is-each-implementation-of-the-page-cache-used>), but today I have another question about the topic which hopefully is easier to answer.
The release notes for 2.2.0 (here <http://neo4j.com/blog/neo4j-2-2-0-scalability-performance/>) say the page cache mechanism was implemented based on the LRU-K algorithm, but the documentation itself doesn't mention said algorithm at all and from what I gather this implementation has some considerable distinctions from the original algorithm. Considering the *MuninnPageCache* class which implements the *PageCache* interface on neo4j-io, is this implementation based on the Muninn Flash Key-Value Store (from this article here <http://dl.acm.org/citation.cfm?id=2611364>)? If so I don't get where LRU-K comes into play. Thank you for your time. -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
