The LFU cache implementation I wrote for SOLR-2906 is O(log n), which is pretty inefficient. Today I came across an implementation that claims to be O(1). Specifically, it is found in an open source project called hawtdb. They reference a paper at the following URL (pdf warning):
http://dhruvbird.com/lgi.pdf The hawtdb project uses the Apache License, so I can use that as a basis for a new implementation, right? Thanks, Shawn --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
