Re: Implementing Bitmap Indexes

On Sat, 29 Jan 2005 21:54:39 +0200, Victor Yegorov <viy(at)mits(dot)lv> wrote:
> * Dawid Kuroczko <qnex42(at)gmail(dot)com> [29.01.2005 21:25]:
>
> > With in-memory bitmap, the search would start with index a, all
> > matching rows would form the bitmap; then the second search
> > would go through b index, forming another bitmap. Which then
> > would be ANDed with previous bitmap.
>
> Not only matching rows will form a bitmap, all rows should.
>
> And the physical order of rows in the table is important to form bitmap.

My mistake -- when I said "all matching rows would form the bitmap"
I meant "all matching rows would form '1's in the bitmap". :)
Gotta work on clarity of my messages.

Regards,
Dawid