Lists Home |
Date Index |
- From: Rich Singer <Rich.Singer@aris.com>
- To: "'email@example.com'" <firstname.lastname@example.org>
- Date: Tue, 25 May 1999 19:33:47 -0700
> > > - if all i wanted to do was boolean search on field values with
> > > no stemming/concept support, then regardless of how i did the
> > > indexing, what is wrong with using standard b-trees and/or just
> > > putting the index data in a sql db?
> > To make the answer short: depends upon what you want to do.
> A slightly longer answer is, if you have 100GB of data that you want
> to index in an SQL database then you'd better grab a terabyte of hard
> disk and be prepared to wait a LONG time for your queries to come back
There are indexes which will be significantly smaller than the source data.
An example is a bitmap index on data with duplicate values. Commercial
examples of this can be seen from Sybase IQ, Broadbase and Oracle. A form
of bitmap index would probably work very well with some types of XML
xml-dev: A list for W3C XML Developers. To post, mailto:email@example.com
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:firstname.lastname@example.org the following message;
To subscribe to the digests, mailto:email@example.com the following message;
List coordinator, Henry Rzepa (mailto:firstname.lastname@example.org)