[KinoSearch] Caching QueryFilter objects
projects at pudge.net
Wed Oct 11 16:06:59 PDT 2006
At 15:50 -0700 2006.10.11, Marvin Humphrey wrote:
>It's the difference between executing the query (which generally
>means disk i/o) and reading from a BitVector. Doesn't take too many
>searches to make that worthwhile!
Right. The question is simply one of RAM, and of how often we modify the
index, compared to how many searches with those filters we expect during
I suppose I might as well implement it with QueryFilter regardless, and
then worry about caching later.
Chris Nandor pudge at pobox.com http://pudge.net/
Open Source Technology Group pudge at ostg.com http://ostg.com/
KinoSearch mailing list
KinoSearch at rectangular.com
More information about the kinosearch