* 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.
--
Victor Y. Yegorov