Hello, I am interested to learn more about how Lucene uses block tree term dictionary.
while doing research on this topic i found some useful information listed on below links. 1. http://blog.mikemccandless.com/2014/05/choosing-fast-unique-identifier-uuid.html 2. http://blog.mikemccandless.com/2013/09/lucene-now-has-in-memory-terms.html 3. http://www.slideshare.net/lucenerevolution/what-is-inaluceneagrandfinal I do understand that Lucene uses <FST> to store Prefixes of terms in to memory and lookup terms/posting on disk but i am unable to visualize how actual search working in Lucene 6.0. Please can someone suggest a guide which i can follow to understand all step by step operation how actually a term search works with blockterms dictionary? Thanks.
