set to zero. Page fill bitmaps At the end of each pointer page is a bitmap array of two bit entries which is indexed by the same index as the ppg_page array. These bitmaps indicate that the page is page is full, then the page is not used for new records or record versions. The location of the bitmaps on each page is dependent on the page size. The bigger the page, the more slots in the ppg_page lower address in the page and so on. From looking inside a few databases with a 4Kb page size, the bitmaps begin at offset 0x0f10 on the page. You can find the pointer page for any table by running something

So how to optimize it? Apache Arrow ● Binary data format ● Array lengths ● Null count ● Null bitmaps ● Offsets buffer ● Values Array ● More details please see the doc Chunk ● Columnar layout ● Fixed

corresponding tuple ID contains the key value. A mapping function converts the bit position to a tuple ID. Bitmaps are compressed for storage. If the number of distinct key values is small, bitmap indexes are much query can be resolved quickly by performing the corresponding Boolean operations directly on the bitmaps before converting the resulting bitmap to tuple ids. If the resulting number of rows is small, the Index Scan - Compute a bitmap by OR-ing all bitmaps that satisfy the query predicates from the underlying index. BitmapAnd or BitmapOr - Takes the bitmaps generated from multiple BitmapIndexScan nodes

corresponding tuple ID contains the key value. A mapping function converts the bit position to a tuple ID. Bitmaps are compressed for storage. If the number of distinct key values is small, bitmap indexes are much query can be resolved quickly by performing the corresponding Boolean operations directly on the bitmaps before converting the resulting bitmap to tuple ids. If the resulting number of rows is small, the Index Scan - Compute a bitmap by OR-ing all bitmaps that satisfy the query predicates from the underlying index. BitmapAnd or BitmapOr - Takes the bitmaps generated from multiple BitmapIndexScan nodes

corresponding tuple ID contains the key value. A mapping function converts the bit position to a tuple ID. Bitmaps are compressed for storage. If the number of distinct key values is small, bitmap indexes are much query can be resolved quickly by performing the corresponding Boolean operations directly on the bitmaps before converting the resulting bitmap to tuple ids. If the resulting number of rows is small, the Index Scan - Compute a bitmap by OR-ing all bitmaps that satisfy the query predicates from the underlying index. BitmapAnd or BitmapOr - Takes the bitmaps generated from multiple BitmapIndexScan nodes

corresponding tuple ID contains the key value. A mapping function converts the bit position to a tuple ID. Bitmaps are compressed for storage. If the number of distinct key values is small, bitmap indexes are much query can be resolved quickly by performing the corresponding Boolean operations directly on the bitmaps before converting the resulting bitmap to tuple ids. If the resulting number of rows is small, the Index Scan - Compute a bitmap by OR-ing all bitmaps that satisfy the query predicates from the underlying index. BitmapAnd or BitmapOr - Takes the bitmaps generated from multiple BitmapIndexScan nodes

corresponding tuple ID contains the key value. A mapping function converts the bit position to a tuple ID. Bitmaps are compressed for storage. If the number of distinct key values is small, bitmap indexes are much query can be resolved quickly by performing the corresponding Boolean operations directly on the bitmaps before converting the resulting bitmap to tuple ids. If the resulting number of rows is small, the Index Scan - Compute a bitmap by OR-ing all bitmaps that satisfy the query predicates from the underlying index. BitmapAnd or BitmapOr - Takes the bitmaps generated from multiple BitmapIndexScan nodes

corresponding tuple ID contains the key value. A mapping function converts the bit position to a tuple ID. Bitmaps are compressed for storage. If the number of distinct key values is small, bitmap indexes are much query can be resolved quickly by performing the corresponding Boolean operations directly on the bitmaps before converting the resulting bitmap to tuple ids. If the resulting number of rows is small, the Index Scan - Compute a bitmap by OR-ing all bitmaps that satisfy the query predicates from the underlying index. BitmapAnd or BitmapOr - Takes the bitmaps generated from multiple BitmapIndexScan nodes

corresponding tuple ID contains the key value. A mapping function converts the bit position to a tuple ID. Bitmaps are compressed for storage. If the number of distinct key values is small, bitmap indexes are much query can be resolved quickly by performing the corresponding Boolean operations directly on the bitmaps before converting the resulting bitmap to tuple ids. If the resulting number of rows is small, the bitmap by OR-ing all bitmaps that satisfy the query predicates from the underlying index. VMware Tanzu Greenplum 6 Documentation VMware, Inc 489 BitmapAnd or BitmapOr - Takes the bitmaps generated from multiple

corresponding tuple ID contains the key value. A mapping function converts the bit position to a tuple ID. Bitmaps are compressed for storage. If the number of distinct key values is small, bitmap indexes are much query can be resolved quickly by performing the corresponding Boolean operations directly on the bitmaps before converting the resulting bitmap to tuple ids. If the resulting number of rows is small, the Index Scan - Compute a bitmap by OR-ing all bitmaps that satisfy the query predicates from the underlying index. BitmapAnd or BitmapOr - Takes the bitmaps generated from multiple BitmapIndexScan nodes