liveBook · Manning

Bitmap

A bitmap is a representation that stores information as a grid or set of bits, such as pixel values or selected storage locations.

How 2 Manning books explain it

Just Use Postgres!

A bitmap is a compact structure that records table-row or table-page locations selected by an index condition.

How it is used
Coordinates bitmap index and heap scans to batch table-row retrieval for indexed conditions.
How deep it goes
Explains two-phase execution and exact versus lossy locations, without developing bitmap storage internals.
Examples
Uses PostgreSQL EXPLAIN plans for hash-index lookups, multi-value IN queries, and GIN-backed full-text searches.
What you can do after
Diagnose/debug with it by reading Bitmap Index Scan, Bitmap Heap Scan, heap-block, and recheck-plan details.

Read how Just Use Postgres! explains bitmap →

Geometry for Programmers

A bitmap is a digital image represented as a grid of individually addressable pixels.

How it is used
Uses pixel grids as inputs for image upscaling, smoothing, and extracting continuous geometric boundaries.
How deep it goes
Defines pixels, derives localized interpolation, and implements smoothing and contour fitting, but does not develop bitmap storage formats.
Examples
Uses a cat-eye upscale and a 16×16 grayscale image converted into a smooth threshold contour.
What you can do after
Build it from scratch using localized interpolation to smooth a bitmap and iterative geometry to extract a curved contour.

Read how Geometry for Programmers explains bitmap →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.