searching for search

Rich Singer Rich.Singer at
Wed May 26 04:31:27 BST 1999

> > > - 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
>to you.

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:xml-dev at
Archived as: and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:majordomo at the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo at the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa at

More information about the Xml-dev mailing list