Re: bitmap and b-tree index

Hi,

a b-tree index is an ordered tree of index nodes. It contains one entry per row.
A bitmap index is a physical index that contains one entry for a group of rows.

By
Frank

chank000 schrieb:

> I've heard the term bimap index an b-tree index, but I would like someone
> to explain what is bitmap index and b-tree index. What are the differences
> between the two. Thanks in advance.
Received on Tue Jul 25 2000 - 00:00:00 CDT