Re: Bitmap Indexes & Table Inserts

From: <cgrandy_at_disc.com>
Date: 2000/07/12
Message-ID: <8ki6gr$o05$1@nnrp1.deja.com>#1/1

OMNIDEX indexes offer keyword searches for both high and low cardinality data with minimal performance impact on inserts. For more information, see http://www.disc.com/keyword.html or contact me.

Cheryl Grandy
cgrandy_at_disc.com
303 444-4000
www.disc.com/home

In article <1140a557.08b68ae8_at_usw-ex0105-036.remarq.com>, stuarti <stuirvineNOstSPAM_at_hotmail.com.invalid> wrote:
> Is there a performance hit when using bitmap indexes as oposed
> to b-tree indexes when inserting large amounts of data into a
> table ??
>
> Got questions? Get answers over the phone at Keen.com.
> Up to 100 minutes free!
> http://www.keen.com
>
>

--
Cheryl Grandy
DISC
Get OMNIDEX for the fastest
applications ever


Sent via Deja.com http://www.deja.com/
Before you buy.

Received on Wed Jul 12 2000 - 00:00:00 CDT