Hi, I indexed first 220,000, all with a special keyword, I did a simple query and only fetched 5 docs, with Hits.length()=220,000.
Then I indexed 440,000 docs, with the same keyword, query it again and fetched a few docs, with Hits.length(0=440,000. I found that search time is about linear: 2nd time is about 2 times longer than 1st query. I would like to understand: Does the linear relation come from score calculation, since we have to calculate score one by one? Or other reason? If we have B-tree index I would naively expect a better scalibility? Thanks very much for your helps, Lisheng --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
