On Sep 5, 2006, at 3:28 PM, Ning Li wrote:
Given M, B and an index which has L (0 < L < M) segments with docs less than B, how many ram docs should be accumulated before a merge is triggered? B is not good. B-sum(L) is the old strategy which has problems. So between B-sum(L) and B? Once there are M segments with docs less than B, they'll be merged. But what if L=0? Should B ram docs be accumulated before flushed in that case?
So cut the Gordian Knot? http://wiki.apache.org/jakarta-lucene/KinoSearchMergeModel Marvin Humphrey Rectangular Research http://www.rectangular.com/ --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
