Re: bitmap index and distinct values

From: Tim Gorman <tim_at_evdbt.com>
Date: Mon, 27 Apr 2015 04:09:42 -0600
Message-ID: <553E0AE6.6080801_at_evdbt.com>

(<distinct value>, <start ROWID>, <end ROWID>, <bitmap>)

On 4/26/15 20:44, Iggy Fernandez wrote:
> In other words (if I correctly understand what Jonathan is saying), a
> bitmap index is a B-tree structure (the same structure used by a
> normal index). In a normal index, the entries are (<key>, <ROWID>)
> pairs but, in a bitmap index, the entries are (<distinct value>,
> <start ROWID>, <compressed bitmap chunk>).
>
> Iggy

--
http://www.freelists.org/webpage/oracle-l

Received on Mon Apr 27 2015 - 12:09:42 CEST