[Xapian-discuss] Splitting terms into separate B-Trees.

[James Aylett]

On Thu, May 31, 2007 at 01:58:19PM -0700, Kevin Duraj wrote:

> This would explain why Google in their documents claim to use cheap
> servers, because partitioning B-Tree indexes by the terms can bring
> the index down to any small size that the server can handle well, and
> actually the servers would become the part of the B-Tree. There is no
> limit how much you can search and size down the database.

However Google doesn't care when identical adjacent searches give
different results. There are lots of things you can do if you're
trying to solve Google's problem, which often won't apply in a more
constrained system. (You'd never want to do that kind of thing with a
medical search system, for instance :-)

J

-- 
/--------------------------------------------------------------------------\
  James Aylett                                                  xapian.org
  james at tartarus.org                               uncertaintydivision.org