How the HD space search algorithm works

The general rule for inserting a segment into an HD database is to store the segment (whether root or dependent) in the most desirable block or CI.

Root segment
The most desirable block depends on the access method.
Dependent segment
The most desirable block is the one containing the segment that points to the inserted segment.
Second-most desirable block
When it is not possible to store one or more segments in the most desirable block because, for example, space is not available, the HD space search algorithm searches for the second-most desirable block or CI.

Parent topic: HDAM, PHDAM, HIDAM, and PHIDAM databases

Related concepts

When not enough root storage room exists
Inserting dependent segments
Inserting root segments into a HIDAM or PHIDAM database

Related tasks

Specifying free space (HDAM, PHDAM, HIDAM, and PHIDAM only)