> This would be very bad, if you were to lookup "foobar" you would have > to do a seek on every byte
I think it'd be MMap'd. There was a lengthy discussion at LUCENE-2843, and there's an open issue to in fact store all terms in RAM as an FST. I'm looking at the FST for HBase's key index which is the equivalent of the terms index. However it'd be interesting to see if in fact all keys could be stored in the FST on disk, then very little would need to be loaded into RAM. How is the FST with bloom filter like access? On Thu, Jun 2, 2011 at 8:06 PM, Robert Muir <rcm...@gmail.com> wrote: > This would be very bad, if you were to lookup "foobar" you would have > to do a seek on every byte. > > instead, load up "part of the terms" in RAM, and the rest on disk > sequentially... this is how the lucene index works (the terms index is > in FST in ram, referring to terms dictionary on disk, so you do one > seek instead). > > On Thu, Jun 2, 2011 at 10:54 PM, Jason Rutherglen > <jason.rutherg...@gmail.com> wrote: >> Is it possible to iterate over the FST while it's still on disk? If >> not is that type of functionality planned? >> >> --------------------------------------------------------------------- >> To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org >> For additional commands, e-mail: dev-h...@lucene.apache.org >> >> > > --------------------------------------------------------------------- > To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org > For additional commands, e-mail: dev-h...@lucene.apache.org > > --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org For additional commands, e-mail: dev-h...@lucene.apache.org
