dungba88 commented on issue #12714: URL: https://github.com/apache/lucene/issues/12714#issuecomment-1785150257
I ran a small test to see what RAM would be needed for some sample dictionary using a simple `LinkedHashMap<UnCompiledNode, Long>`: 6MB Cache size 62457 items 977KB FST size The reported RAM might be a bit under-estimated, and it seems cache size is 6x the FST size. Using byte-array representation would be more efficient than naive UnCompiledNode (maybe down to 3x like Mike has reported). The benefit is simple implementation & maintenance. Perhaps instead of UnCompiledNode, we could encode it as byte-array (could take the same format as the FST-encoded binary, but the FST operation works on absolute address value thus would need some modification). In any case, this binary-encoded could use doubly linked list for LRU cache as well. I'm unsure what double barrel cache would bring, as they (at worst) would only have 1/2 normal capacity. -- 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: issues-unsubscr...@lucene.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
