Skip to content

Glossary

Actual tree — the partition tree as the catalog reports it: every node with its bounds, OID and kind, plus the marker-tagged orphans below the root. Partition schemes

Adopt — write the marker on a detached table the library did not detach, making it an orphan the lifecycle may drop. Ownership

Boundaries — the rule dividing a progression axis into windows and naming them: TimeBoundaries, NumericBoundaries, IntegerSequence. Boundaries

Branch — a partition that partitions further; always a local partitioned table.

Candidate — a partition as a policy rule sees it: its window, its node, the cursor and its facts. Lifecycle policies

Codec — the translation between period instants and the literals of an encoded key (UUIDv7, epoch). Boundaries

Cursor — "now" on a progression axis: the clock, the key's high-water mark, or the newest partition. Boundaries

Facts — what the introspector measured about a partition because a rule asked: size, row estimate, references, SQL answers. Lifecycle policies

Finding — something the planner saw and chose not to change, with a reason and a severity. The maintenance plan · reference

Grace period — the time a detached partition is kept before it is dropped (DropAfter(grace=…)). Lifecycle policies

Grid — every window a boundaries rule can produce; the test of ownership for an attached partition. Boundaries

Issue — a per-partition problem on a MaintenanceResult: a warning finding, or a failure met while executing. Monitor and alert

Leaf — a relation that stores rows: the deepest member of every branch. Local or foreign. Leaf backends

Level — one PARTITION BY in the tree; a root or a nested one. Partition schemes

Lifecycle policy — when the partitions of a progression level are created, detached and dropped. Lifecycle policies

Lifecycle unit — the partition directly under a progression level: what is created, counted, hooked and expired as one, subtree included.

Marker — the COMMENT written on a table at detach that makes it the library's to drop. Ownership

Orphan — a detached table carrying the marker. Ownership

Plan — the operations and findings for one run of one table. The maintenance plan

Progression level — a level whose members form an open-ended sequence with a cursor: RANGE windows, or a sliding LIST. The lifecycle dimension.

Reconcile — create the members a set level is missing, without creating ahead or expiring. service.reconcile().

Scheme — the shape of the tree, level by level. Partition schemes

Set level — a level whose members form a complete set: HASH buckets, LIST groups. Reconciled, never expired.

Sliding list — a LIST level over an IntegerSequence: one value per partition, rotated by application state. Partition schemes

Tick — one maintenance run for one table: plan and apply under the table's lock. Schedule maintenance

Window — one slot of a progression axis, [start, end): a month, a 100 000-id step, one list value. Boundaries