[KinoSearch] KinoSearch::Docs::Cookbook::ReusingSearchers

[Henry]

> I haven't played with large data sets like this yet.  How long does a
> straight search take if you were to run it on a single machine with
> the full dataset?  Conversely, how large can you make the partitioned
> index in the search farm while keeping response time where you want
> it.  I'm interested in what the overhead of the MultiSearcher approach
> actually is.

For the first question, I have no idea - a single node doesn't have enough
disk space for the full index anyway.  For the latter question, I'll be
starting with an index size of ~100-150+GB per node.  If that yields
search times (under load with hammerhead or similar) which are not
acceptable, then we'll keep adding nodes (and splitting the index) until
results are acceptable.

Busy re-indexing though, so it may be a while before I can do tests on the
full monty.  Will perform tests on a small chunk soon and use that to
extrapolate.

Regards
Henry


_______________________________________________
KinoSearch mailing list
KinoSearch at rectangular.com
http://www.rectangular.com/mailman/listinfo/kinosearch