Skip to content
KEDBYTE
Site navigation
How Data Works
Reference
A–Z

Glossary

Across all 52 chapters|973 terms|24 letters
Definitions retain their context. Read the linked sections before treating a term as a universal rule.

A

ABA pattern

a value changes away and later returns to its earlier value — an intervening history that a comparison of only the final value cannot detect.

Read in context: 12.6.6

ABA problem

a value changes and returns, hiding intervening work — a limitation of equality-only checks that do not identify the relevant state history.

Read in context: 25.5.6

Accepted operation

a committed result under a declared contract — the business outcome represented by the transaction, not merely a received HTTP request.

Read in context: 51.1.6

Access method

the machinery behind a route — an engine-defined algorithm and operator interface used to organise and search index entries.

Read in context: 15.1.6

Accuracy

closeness to what is actually being measured; technically, closeness of agreement between a measured value and a true value of the measurand, not a numerical quantity in VIM usage.

Read in context: 4.3.6

Acknowledgement boundary

what a positive receipt actually confirms — the defined acceptance point represented by a queue, consumer or provider response.

Read in context: 26.5.6

Acknowledgement chain

the sequence of accepted handovers — responses from application, database, operating system and storage layers with distinct meanings.

Read in context: 30.1.6

Acknowledgement loss

the result exists but the sender did not learn it — a source of uncertainty rather than proof that the action failed.

Read in context: 51.3.6

Acquisition order

the sequence in which resources are requested — a shared ordering protocol intended to prevent cyclic waits.

Read in context: 24.4.6

Admission control

deciding which work to accept — protection of bounded resources through explicit entry policies.

Read in context: 50.4.6

Adversarial input

data chosen to exploit assumptions — inputs deliberately selected to cause incorrectness, excessive resource use or other unwanted behaviour.

Read in context: 17.5.6

Advisory lock

a coordination agreement writers must choose to follow — an application-defined locking facility not automatically tied to every relevant data mutation.

Read in context: 24.1.6

Affected-row check

verify how many target records changed — inspection of the statement result against an expected cardinality.

Read in context: 22.3.6

After-value

the state an accepted update should leave — a logical replacement used by this teaching recovery model.

Read in context: 28.5.6

Aggregate state

information accumulated for a group — working values sufficient to compute an aggregate such as a sum and count.

Read in context: 19.1.6

Aggregation

combining several records into an answer; technically, a calculation over a defined group of inputs.

Read in context: 2.3.6

Agreed line price

the price attached to a particular historical agreement — a transaction-specific fact distinct from a product’s current catalogue price.

Read in context: 9.6.6

Agreed price snapshot

the price stored at acceptance — an order fact distinct from the mutable catalogue.

Read in context: 51.2.6

Alias

a name attached to an output expression — a result-column label that does not itself alter the source table’s schema.

Read in context: 12.4.6

Alignment

place values at required byte boundaries — padding and layout rules supporting an implementation’s representation or access requirements.

Read in context: 27.3.6

Allocated cost

a share assigned under a rule — a reporting quantity based on an explicit apportionment policy.

Read in context: 50.5.6

Allowed history

a sequence the contract permits — an operation trace used to evaluate a consistency or correctness claim.

Read in context: 36.6.6

Allowed lateness

the accepted revision interval — a configured policy governing how long late window data may affect retained computation.

Read in context: 41.5.6

Allowlisted query choice

selecting among explicitly permitted statement structures — a validated mapping from a caller’s option to trusted fixed SQL.

Read in context: 12.6.6

Analytical workload

queries that study populations of records — work often involving scans, grouping and historical comparison.

Read in context: 42.1.6

Analyzer

the text interpretation pipeline — extraction, tokenization and normalization rules used for indexing and querying.

Read in context: 44.2.6

Append-only

ordinary updates add rather than replace — a mutation policy whose enforcement and exceptions must be specified.

Read in context: 6.6.6

Application

the program people use; technically, the software that implements a workflow and requests operations from other components.

Read in context: 1.1.6

Application consistency

related service components agree — correctness of references and workflows beyond one engine’s internal file validity.

Read in context: 31.2.6

Apply position

how far changes affect the readable replica — the prefix already replayed into the destination’s visible state.

Read in context: 33.3.6

Approximate nearest-neighbour search

a shortcut to likely close items — retrieval that may miss exact neighbours to reduce cost.

Read in context: 45.3.6

Architecture trade-off

a benefit obtained with another cost or constraint — a choice evaluated against the complete task rather than one isolated metric.

Read in context: 42.6.6

Archive coverage

the recovery history actually retained and retrievable — verified continuity of required log material over a stated range.

Read in context: 31.3.6

Arithmetic bound

the largest or smallest result an operation may produce — a range derived from operand limits and the operation’s cardinality.

Read in context: 10.4.6

Artefact identity

which exact candidate was used — a stable reference, often a digest, linking execution to reviewed bytes.

Read in context: 49.6.6

As-of time

when the available information was evaluated — the observation or snapshot boundary attached to a report.

Read in context: 19.4.6

Association

quantities vary together in observations — a statistical relationship that does not by itself establish intervention effects.

Read in context: 46.5.6

Asymmetric failure

reachability differs by direction or path — a condition in which one observer’s connectivity does not describe the whole system.

Read in context: 36.3.6

Asynchronous commit

acknowledge before full local log persistence — a configured contract that can trade recent-transaction durability for lower latency.

Read in context: 28.2.6

Asynchronous replication

remote progress may follow acknowledgement — a configuration that does not wait for a selected remote replication milestone before reporting success.

Read in context: 33.3.6

At-least-once delivery

retries may deliver a message repeatedly — a delivery contract that prioritizes eventual attempts while permitting duplicates under its stated assumptions.

Read in context: 26.5.6

Atomic commitment

one compatible commit-or-abort decision — a property distinct from simultaneous visibility or complete transaction isolation.

Read in context: 38.1.6

Atomic intent recording

accept the business change and its follow-up instruction together — committing state and outbox intent in one local transaction.

Read in context: 26.4.6

Atomic metadata publication

one accepted version replaces its expected predecessor — a concurrency boundary preventing incompatible partial or stale updates.

Read in context: 42.4.6

Atomic publication

output becomes accepted as one local change — committing records and their completion evidence within one transaction boundary.

Read in context: 40.5.6

Atomic visibility

observers do not see an intermediate replacement state — a concurrency property distinct from surviving a crash or power loss.

Read in context: 30.3.6

Atomicity

the grouped changes take effect together or not at all — a transaction property at a specified resource boundary.

the selected changes take effect together — all-or-nothing transactional acceptance of the covered database work.

Read in context: 8.4.6, 21.3.6

Attempt amplification

extra work caused by retries — the ratio or count of transaction attempts relative to completed business operations.

Read in context: 23.6.6

Attribute closure

everything the starting fields let you determine — the set of attributes implied by repeatedly applying the specified functional dependencies.

Read in context: 13.4.6

Audit trail

information used to explain actions; technically, a record of relevant operations and context, with its own integrity and retention requirements.

Read in context: 2.6.6

Authentication

establish a source or actor under a security protocol — a property not supplied merely by an unkeyed matching checksum.

Read in context: 32.2.6

Authorisation

permission to perform an action — an access decision separate from whether the action is a valid domain transition.

permission for a particular act — evaluation of a principal’s rights over a resource in a defined context.

Read in context: 6.2.6, 47.1.6

Authoritative counter

a stored total used to make decisions — state whose agreement with the underlying events or allocations needs its own maintained invariant.

Read in context: 11.4.6

Authoritative field source

the record allowed to decide a disputed value — a defined authority for a particular fact, not necessarily one universal source for every field.

Read in context: 32.4.6

Authoritative outcome

a result accepted under the valid authority path — a state distinct from a cached guess or tentative local proposal.

Read in context: 36.6.6

Authoritative representation

the record a decision is defined to rely on — a source-of-truth role assigned by the architecture.

the selected source of meaning — the version whose value governs while multiple copies coexist.

Read in context: 8.6.6, 49.2.6

B

Backfill

transforming already-stored records — population of a new representation under explicit source assumptions.

Read in context: 49.3.6

Backoff

wait longer before another attempt — a retry-spacing strategy that reduces repeated contention or overload.

Read in context: 24.5.6

Backpressure

make upstream work respect downstream limits — a mechanism that slows or bounds production when consumers cannot keep up.

downstream limits affect upstream admission — a mechanism preventing work from accumulating without bound.

Read in context: 20.3.6, 39.5.6

Backup

retained material intended for restoration — a copy or representation with a defined consistency and recovery scope.

a copy retained for a defined recovery purpose — data and metadata acquired under a procedure that supports a stated restoration objective.

Read in context: 8.5.6, 31.1.6

Backup retention

how long recovery copies remain available — a policy governing restore-point preservation and eventual retirement.

Read in context: 31.6.6

Backup verification

check the retained input against defined expectations — structural, manifest or checksum validation that may precede a full restore.

Read in context: 31.5.6

Baseline

the saved comparison point — a defined workload, configuration and observed result before an intervention.

Read in context: 18.6.6

Benchmark contract

the rules of the measurement — a specification of inputs, operations, environment, timing boundaries and success criteria.

Read in context: 20.1.6

Binary format

a byte layout read under explicit rules — a representation not restricted to a plain-text grammar.

Read in context: 7.5.6

Birthday effect

collisions become plausible before the space is full — pair growth causes collision probability to rise around the square root of a uniform output-space size.

Read in context: 17.5.6

Blocking

waiting for conflicting access to be released — a resource wait that need not contain a dependency cycle.

progress waits for unavailable coordination — a limitation distinct from a participant process being physically stopped.

Read in context: 24.3.6, 38.3.6

Blocking operation

input must accumulate before output can proceed — a stage such as a full sort under its particular execution strategy.

Read in context: 18.4.6

BM25

a family of lexical ranking rules — scoring that combines term weighting, frequency saturation and document-length effects.

Read in context: 44.4.6

Bound parameter

a value supplied separately from query text — data passed through a driver’s parameter interface rather than inserted into SQL by string concatenation.

a value supplied separately from SQL structure — driver-mediated binding to a placeholder without interpreting the supplied value as new statement syntax.

Read in context: 8.2.6, 12.6.6

Boundary coverage

which protected paths were exercised — an inventory of tested interfaces, scopes and states, not a universal guarantee.

Read in context: 47.6.6

Boundary evidence

proof about a particular stage — an acknowledgement or record whose scope must not be exaggerated.

Read in context: 39.6.6

Boundary test

a test at an acceptance limit — a selected case at, immediately below or immediately above a declared domain boundary.

Read in context: 11.1.6

Bounded observation

a deliberately limited check — a query or measurement with named scope and minimal unintended change.

Read in context: 52.3.6

Buffer hit

a needed page was already in the relevant cache — an engine-level observation, not a statement that all possible lower-level work vanished.

Read in context: 18.5.6

Buffer pool

the database’s in-memory page workspace — a managed cache of pages and metadata used by the storage engine.

Read in context: 27.2.6

Business domain

the values that make sense for a particular purpose — a semantic acceptance set including units, bounds, missingness and interpretation.

Read in context: 10.4.6

Business precondition

what must be true before an operation is accepted — an application rule that may require checking affected rows or queried state.

Read in context: 21.1.6

Business reconciliation

compare representations that should agree — an identity- and meaning-aware check of records, totals and state transitions.

Read in context: 32.4.6

Business revision

the edit state named by the application — an explicit version value used for conflict detection or documented history.

Read in context: 25.1.6

Busy outcome

the system cannot complete the requested access immediately — a contention result that requires an explicit wait, retry or failure policy.

Read in context: 8.1.6

Byte order

which end of a multi-byte number comes first — the endianness used to encode a numeric value.

Read in context: 7.5.6

Byzantine behaviour

a participant acts arbitrarily or maliciously — a failure model stronger than ordinary crash and omission failures.

Read in context: 37.5.6

C

Cache

a retained result or copy used to avoid repeated work — a derived store with explicit validity, scope and eviction rules.

Read in context: 39.1.6

Cache hit

the needed item is already in the named cache — an access resolved at a specified cache layer.

a lookup finds an eligible entry — an event that establishes presence, not automatically freshness or correctness.

Read in context: 27.2.6, 39.1.6

Cache-aside

the application loads missing data — a pattern in which code checks a cache and populates it from another source.

Read in context: 39.1.6

Calibration

comparing indications with suitable references; technically, establishing the specified relationship between reference values and indications with their associated uncertainties.

Read in context: 4.3.6

Candidate

a record ready for the next acceptance stage — a validated, non-conflicting input that has not necessarily been published.

Read in context: 7.6.6

Candidate eligibility

the conditions a replacement must satisfy — requirements covering authority, history and readiness rather than mere reachability.

Read in context: 34.3.6

Candidate key

a possible way to identify each row uniquely — a minimal identifying attribute set under the model’s constraints.

Read in context: 11.2.6

Candidate match

a pair worth investigating; technically, a proposed association that has not yet satisfied the final decision policy.

Read in context: 5.5.6

Candidate recall

how much required material reaches the later stage — coverage that limits what reranking can ultimately recover.

Read in context: 45.3.6

Candidate retrieval

finding possible answers — selecting documents for further scoring and verification under a query model.

Read in context: 44.1.6

Candidate row

a record not yet ruled out — input retained until the necessary conditions can be evaluated correctly.

Read in context: 43.4.6

Canonical ID

the receiving system’s chosen reference; technically, an identifier used for the entity representation treated as the current reference under a stated mapping policy.

Read in context: 5.6.6

CAP theorem

a limit on joint guarantees under unreliable communication — the incompatibility of the specified atomic service and availability requirements in the partition-prone model.

Read in context: 36.4.6

Capture boundary

the point at which this exercise obtains its input — the boundary after which one immutable byte string is used for parsing and diagnostics.

Read in context: 7.1.6

Cardinality

how many; here, the number of rows in a dataset or intermediate result.

how many related rows are permitted or required — the minimum and maximum counts on each side of a relationship.

how many records or matches there are — a count or relationship multiplicity whose context must be stated.

how many distinct labelled combinations exist — a property that can drive metric storage and query cost.

Read in context: 1.4.6, 9.3.6, 13.2.6, 50.2.6

Cardinality estimate

a predicted row count — the planner’s expected output size for an operation under its available statistics and model.

Read in context: 18.2.6

CASE expression

an explicit choice among result alternatives — a SQL conditional expression selecting an output according to its stated conditions.

Read in context: 12.4.6

Case mix

the composition of the observed population — subgroup proportions that can influence aggregate comparisons.

Read in context: 46.2.6

Catalogue

organized metadata about data assets — a service or representation locating tables and describing their definitions and versions.

Read in context: 42.3.6

Catalogue price

the current listed price in the product model — a mutable reference value that must not silently replace historical agreement values.

Read in context: 9.6.6

Catch-up rate

how quickly a backlog shrinks — destination progress minus continuing source generation over the measured interval.

Read in context: 33.4.6

Catch-up suffix

changes after an initial copy boundary — the remaining ordered work needed before a destination matches the selected source state.

Read in context: 35.4.6

Causal consistency

effects follow their relevant causes — a model preserving causal dependencies while allowing flexibility for concurrent unrelated operations.

Read in context: 36.1.6

Causal order

one event preceding another through a dependency — the order induced by the model’s local actions and communications.

Read in context: 6.3.6

Causal token

evidence of a required prior position — a scoped marker used to ensure that a read includes specified earlier work.

Read in context: 33.5.6

Censored observation

a boundary rather than an exact value; technically, partial information restricting a value to a range, such as an unobserved completion time known to exceed a deadline.

completion time is only partly known — an observation limited by a timeout or stopping rule rather than a measured final duration.

Read in context: 4.5.6, 20.2.6

Change data capture

following source mutations — obtaining inserts, updates and deletions for downstream processing.

Read in context: 40.3.6

CHECK constraint

a declared predicate on acceptable values — an engine-enforced condition whose NULL semantics must also be understood.

Read in context: 9.2.6

Check predicate

an expression used to reject prohibited row values — a condition evaluated under an engine’s CHECK semantics.

Read in context: 11.1.6

Check-then-insert race

two requests act on the same observed absence — an unsafe gap between an existence query and an unprotected insertion decision.

Read in context: 22.4.6

Checker scope

the objects and properties actually examined — the boundary limiting what a successful diagnostic result establishes.

Read in context: 32.3.6

Checkpoint

how far processing has reached — a recorded boundary of incorporated source input.

a recorded starting boundary for recovery — coordinated data and metadata progress that limits required redo under an engine’s protocol.

recorded safe progress — a recovery marker bound to preserved state and explicitly scoped effects.

Read in context: 6.4.6, 28.4.6, 40.5.6

Checkpoint pressure

current work caused by reaching that boundary — I/O and related overhead generated by checkpoint activity.

Read in context: 28.4.6

Checksum coverage

the bytes included in an integrity calculation — the exact range or file set a checksum can help verify.

Read in context: 32.2.6

Child row

a row carrying a reference — a record constrained to refer to an allowed parent under the declared semantics.

Read in context: 9.3.6

Choreography

participants react to events — an arrangement distributing workflow reactions while still requiring explicit correctness and observability.

Read in context: 38.5.6

Cleanup horizon

the boundary beyond which old state can be reclaimed — the visibility or retention limit constraining safe version removal.

Read in context: 25.3.6

Client-server database

an engine operating as a separate service — an arrangement in which clients exchange requests and results with a database server.

Read in context: 8.3.6

Closed-loop load

clients wait before issuing their next request — a workload in which completion controls later arrivals.

Read in context: 20.1.6

COALESCE

choosing the first supplied value — an expression returning the first non-null argument, not a recovery of missing truth.

Read in context: 12.4.6

Code point

an assigned position in the Unicode code space; technically, a numeric value used in the character model, not a guarantee of one visible glyph.

Read in context: 3.4.6

Coercion

automatic conversion; technically, a transformation between types that may preserve or change intended meaning.

converting a value into another representation or type — an engine or application behaviour that must be deliberate when it changes interpretation.

Read in context: 2.2.6, 9.2.6

Collision

different inputs share one hash result — equality of hash outputs without equality of original inputs.

Read in context: 17.2.6

Collision resistance

hard to deliberately find two matching fingerprints — computational difficulty of finding distinct inputs with equal digests under the algorithm’s security assumptions.

Read in context: 17.4.6

Column

a named role within each row — an attribute position with declared type and associated meaning.

Read in context: 9.2.6

Column-oriented format

a layout that groups values by column within its storage structure — an organisation suited to some selective and analytical reads, not a universal performance guarantee.

Read in context: 7.5.6

Columnar storage

values grouped by field — a layout that can reduce irrelevant reads for analytical projections.

Read in context: 43.1.6

Combined standard uncertainty

the uncertainty after input effects are combined; technically, the standard uncertainty of the result obtained from its input uncertainty model, including relevant dependence.

Read in context: 4.6.6

Command

a request to do something — an intention evaluated against current state and applicable rules.

Read in context: 6.2.6

Commit

accepting the transaction; technically, the transaction-completion operation under the engine’s documented configuration.

accepting the transaction’s database changes — successful completion under the engine’s stated persistence and visibility semantics.

accept a transaction’s database changes — the completion operation whose acknowledgement has engine- and configuration-specific guarantees.

Read in context: 1.5.6, 8.4.6, 21.2.6

Commit eligibility

evidence satisfying a commitment rule — the conditions permitting a particular log position to become committed.

Read in context: 37.6.6

Commit-time failure

rejection when trying to complete a transaction — an error arising at the commit boundary rather than necessarily during an earlier statement.

Read in context: 11.5.6

Committed prefix

the log portion accepted as final under the protocol — entries eligible for ordered application rather than merely present on one disk.

Read in context: 37.1.6

Commutative operation

an operation whose result is unchanged by swapping order — a property that does not automatically extend to validation rules or external effects.

Read in context: 6.3.6

Compaction

merge and reorganize stored runs — background work that installs a new representation and discards only eligible obsolete state.

Read in context: 29.5.6

Compaction backlog

reorganization work waiting to be completed — pending maintenance that can increase read cost, space use or write stalls.

Read in context: 29.6.6

Compare-and-set

write only when the expectation still matches — an atomic conditional mutation based on an expected value, revision or generation.

Read in context: 25.5.6

Compatibility

the ability of specified participants to exchange usable data — a tested relationship between writer, reader and semantic contracts.

Read in context: 7.5.6

Compatibility window

the overlap period for contracts — the time during which specified old and new consumers must coexist.

Read in context: 49.1.6

Compensation

a later action that addresses an earlier effect — a domain-specific response that need not restore the exact original world.

a new action addresses an earlier effect — an explicit corrective operation, not erasure of the original history.

a new action addressing an earlier completed action — an application-defined correction distinct from local transaction rollback.

Read in context: 6.5.6, 21.6.6, 38.4.6

Complete scope

all identity dimensions needed to select the intended record — the tenant, branch and local key components required by the data model.

Read in context: 22.3.6

Completion order

the sequence in which effects finish — an order that may differ from publishing or delivery order.

Read in context: 39.4.6

Completion predicate

the exact rule for saying an action is done — a condition over declared tasks, evidence and exceptions.

Read in context: 48.6.6

Composite index

one index built from several fields — an access structure over tuples of expressions in a specified order.

Read in context: 15.3.6

Composite key

an identifier made from several parts; technically, a key consisting of more than one attribute.

several fields identifying a row together; technically, a key consisting of more than one attribute.

an identity made from several values together — a unique column combination whose scope is not supplied by any one component alone.

several fields identify one thing together — an identifying attribute set whose combined values are unique in its declared scope.

Read in context: 2.4.6, 5.3.6, 9.4.6, 13.2.6

Composite reference

a link made from more than one value — a tuple of child columns identifying a parent within the corresponding scope.

Read in context: 11.3.6

Composite uniqueness

a combination must be distinct — a constraint enforcing uniqueness over a tuple of columns.

Read in context: 22.4.6

Compression block

a unit compressed and decoded together — a boundary affecting storage efficiency and selective-read cost.

Read in context: 43.3.6

Concurrency

work that overlaps in time; technically, the execution of operations whose interleaving can affect their observed results.

Read in context: 1.3.6

Conditional write

change a record only when its requirement still holds — a write guarded by a predicate evaluated under the database’s concurrency rules.

Read in context: 22.3.6

Confidence interval

a range from a sampling procedure — an interval method with stated repeated-sampling coverage under assumptions.

Read in context: 46.6.6

Conflict group

records claiming one identity with incompatible content — a set for which this batch policy refuses to choose a winner.

Read in context: 7.6.6

Conflict policy

what to do when a rule prevents a write — an explicit decision to reject, reconcile, return an equivalent result or apply a defined update.

Read in context: 22.4.6

Conflict resolution

decide what to retain after incompatible changes — a policy for rejection, reviewed replacement, safe merge or recomputation.

Read in context: 25.6.6

Confounder

a factor affecting the causal comparison — a variable related to both assignment/exposure and outcome in a relevant causal structure.

Read in context: 46.5.6

Confused deputy

a privileged helper misused through supplied instructions — an authority-bearing component acting for the wrong caller or scope.

Read in context: 47.4.6

Connection

a session through which an application interacts with an engine — a context carrying database access and potentially transactional state.

Read in context: 8.3.6

Connection context

identity-related state attached to database work — information whose establishment, reuse and clearing form part of the security boundary.

Read in context: 47.3.6

Connection pool

a managed set of reusable connections — a bounded resource-sharing mechanism, not unlimited server capacity.

Read in context: 8.3.6

Consensus

agreeing under a specified failure model — a protocol problem requiring compatible decisions and defined progress conditions.

Read in context: 37.1.6

Consensus trace

a record of protocol-relevant transitions — evidence connecting terms, votes, log positions and application state.

Read in context: 37.6.6

Conservative pruning

skipping only what cannot match — a rule that may retain extra candidates but must not discard valid results.

Read in context: 43.5.6

Consistency

accepted states obey the specified rules — validity relative to actual constraints and invariants, not an assurance that every stored claim is true.

Read in context: 21.3.6

Consistency downgrade

a weaker observation contract is used — a change that must be explicit and acceptable for the operation.

Read in context: 36.4.6

Consistent backup boundary

the state the recovery procedure can validly reconstruct — a snapshot or log-supported acquisition point with matching metadata.

Read in context: 31.2.6

Consistent cut

observations that fit one permitted source history — a boundary that avoids incompatible mixtures of concurrent states.

Read in context: 40.2.6

Consistent hashing

a scheme limiting remapping when owners change — a family of placement techniques whose exact balance and movement properties depend on the design.

Read in context: 35.6.6

Constraint

a rule enforced at a defined database boundary — a declared condition whose violation prevents a relevant operation from succeeding under the engine’s semantics.

Read in context: 11.1.6

Constraint validation

checking records against a declared rule — an operation whose data scope and timing must be distinguished from future enforcement.

Read in context: 11.6.6

Consultation date

when a source was checked — a historical marker that does not turn a moving page into an immutable specification.

Read in context: 52.6.6

Consumer

anything relying on the data contract — a reader, writer, job, export, API adapter or replay process.

Read in context: 49.1.6

Consumer acknowledgement

a worker reports a delivery handled — a protocol action whose timing must match the application’s processing contract.

Read in context: 39.3.6

Containment

limit further harm while investigating — an action that can precede full diagnosis or repair.

Read in context: 32.6.6

Content addressing

name bytes by a content-derived identifier — object identification based on a specified representation and digest scheme.

Read in context: 17.6.6

Content digest

a compact fingerprint of captured bytes — the result of applying a specified hash function to an exact byte sequence.

Read in context: 7.1.6

Contention

operations competing for a shared resource — overlapping demand that can require waiting, rejection or coordination.

Read in context: 8.6.6

Contiguous progress

every required earlier position is included — a stronger condition than merely having seen a large position number.

Read in context: 40.6.6

Contract

what participants can rely on; technically, specified inputs, outputs, invariants, errors and relevant guarantees.

retire the old path — removing obsolete fields, adapters or access after dependencies are checked.

Read in context: 1.6.6, 49.2.6

Contribution identity

which source fact a result uses — a stable scoped identifier for a counted or summed input contribution.

Read in context: 19.6.6

Control plane

the machinery choosing and configuring behaviour — coordination mechanisms such as role assignment and membership management.

Read in context: 34.1.6

Conversion factor

the multiplier between compatible units; technically, the ratio used to transform numerical values while preserving the represented quantity.

Read in context: 4.2.6

Coordination boundary

the interval or operation within which competing work is controlled — the scope of a lock, version condition or transactional mechanism.

the operations that must be ordered or made indivisible together — the scope within which an invariant’s read, decision and write are protected.

Read in context: 8.1.6, 11.4.6

Coordinator

the component managing a shared decision — a protocol participant that gathers votes and records or distributes the transaction outcome.

Read in context: 38.1.6

Correction

a change to repair a stated defect; technically, an authorised transition whose scope, evidence and consequences should be recorded.

Read in context: 2.6.6

Correction target

the particular entry being repaired — an explicit reference needed to validate and explain a correction.

Read in context: 6.5.6

Correctness oracle

a separate expected-answer check — a mechanism that rejects a fast but semantically wrong variant.

Read in context: 20.5.6

Correlated failure

one cause affects several copies — a failure pattern that invalidates an assumption of independent redundancy.

Read in context: 30.5.6

Correlation

values vary together — a relationship that can invalidate an assumption that conditions are independent.

Read in context: 18.2.6

Cosine similarity

directional agreement — inner product divided by the product of nonzero vector norms.

Read in context: 45.2.6

Cost boundary

which charges are counted — the stated inclusions and exclusions behind a reported amount.

Read in context: 50.5.6

Counterbalancing

vary which option runs first — an experimental ordering technique intended to reduce systematic sequence effects.

Read in context: 20.4.6

Counterexample

a concrete case that disproves an overbroad statement — an input or sequence for which a claimed invariant or interpretation does not hold.

Read in context: 10.6.6

Covariance

how two quantities vary together; technically, a measure of joint variation that contributes to propagation when input estimates are dependent.

Read in context: 4.6.6

Covering index

the guide carries the values this question needs — an index containing sufficient query attributes for an eligible index-only or covering access path.

Read in context: 15.4.6

Crash trace

the ordered evidence surrounding an interruption — a record of persisted state, surviving log material and recovery decisions.

Read in context: 28.6.6

Cross-reference

a route to related material — a stable chapter, section or source identifier rather than a guessed page number.

Read in context: 52.1.6

Cross-row invariant

a rule about several records together — a condition involving relationships, aggregates or coordinated state beyond one proposed row.

a rule about several records together — a correctness condition involving a set of rows rather than one row’s fields.

Read in context: 11.4.6, 22.5.6

Crosswalk

a mapping between identifier systems; technically, a relation connecting scoped source identifiers with identifiers in another model.

Read in context: 5.6.6

Cryptographic erasure

making protected ciphertext unusable by sanitising necessary key material — a claim dependent on key scope and remaining copies.

Read in context: 48.5.6

CSV

a text representation of tabular records — comma-separated values with a specified dialect and quoting rules.

Read in context: 7.3.6

Current attribute

what a record says about the present state — a value whose intended temporal interpretation follows the entity’s current representation.

Read in context: 10.3.6

Current-term commitment

commit advancement based on a new-term entry — the Raft rule preventing unsafe conclusions from replica counts of older entries alone.

Read in context: 37.3.6

Cursor

the driver’s interface to a statement and its results — an object through which rows and relevant execution information are retrieved.

Read in context: 12.1.6

Cutover

the point a new path becomes authoritative — a transition with explicit prerequisites and postconditions.

switching the authoritative path — a controlled transition from old to new representation or service behaviour.

Read in context: 35.4.6, 49.4.6

D

Data clustering

placing similar values near one another — a layout choice that can tighten summaries and improve selective access.

Read in context: 43.5.6

Data contract

the agreement about incoming information — explicit structure, semantics, identity and compatibility rules for a data interface.

Read in context: 40.1.6

Data dictionary

the reference explaining what fields mean — maintained metadata describing grain, domains, units, source, lifecycle and interpretation.

Read in context: 10.5.6

Data lineage

how outputs depend on inputs — a recorded graph of source versions, transformations and derived assets.

Read in context: 42.5.6

Data minimisation

avoiding unnecessary stored detail — collecting and retaining only the information justified for the defined purpose.

keeping only what the task needs — reducing unnecessary fields, copies or lifetime under a stated requirement.

Read in context: 6.6.6, 48.1.6

Data minimization

limiting information to a justified purpose — a design practice reducing unnecessary collection, copying and exposure.

Read in context: 42.5.6

Data plane

where requests produce actual effects — the operational path that must enforce the control plane’s decisions.

Read in context: 34.1.6

Database

the organised records; technically, a managed collection of data interpreted under a model and its rules.

Read in context: 1.1.6

Database engine

the software managing stored data operations — the component that executes supported queries, changes and integrity mechanisms.

Read in context: 8.2.6

Database page

a unit in the engine’s physical layout — a fixed-size storage block containing records, index entries or other engine structures.

Read in context: 27.1.6

Date

a calendar position; technically, a calendar day without necessarily specifying a time of day or an instant.

Read in context: 3.5.6

DBMS

the record-management machinery; technically, the engine providing database operations and its documented guarantees.

the database-management software — facilities for defining, accessing and administering databases.

Read in context: 1.1.6, 8.2.6

Dead-letter disposition

work is moved aside after unsuccessful processing — a recorded outcome requiring review rather than automatic proof that the business task finished.

Read in context: 39.6.6

Deadlock

a cycle of participants waiting on one another — a condition requiring some participant to release, abort or otherwise break the cycle.

Read in context: 24.3.6

Deadlock victim

the transaction selected to break a cycle — a participant aborted by the engine so other work can proceed.

Read in context: 24.4.6

Decimal arithmetic

arithmetic based on decimal representation; technically, operations over decimal values under a precision and rounding context.

Read in context: 3.3.6

Decision record

retained evidence of commit or abort — information needed to resolve participants consistently after interruption.

Read in context: 38.2.6

Declarative query

a request that describes the required result — a statement whose logical meaning does not prescribe one physical execution plan.

Read in context: 12.1.6

Decode cost

work to reconstruct usable values — CPU and memory effort introduced by an encoding or compression layer.

Read in context: 43.6.6

Decoding

turning bytes into characters — interpreting a byte sequence under a specified character encoding.

Read in context: 7.2.6

Deduplication

recognising repeated representations of the same thing; technically, a policy-driven process whose identity assumptions and conflict handling must be explicit.

recognising a repeated identity; technically, detecting and handling duplicate deliveries or records under an explicitly defined equivalence and retention policy.

Read in context: 2.4.6, 5.4.6

Deduplication horizon

how long repeated intent remains recognizable — the retention interval and protocol conditions under which replay records are available.

Read in context: 26.3.6

Deduplication key

what identifies one contribution — the scoped fields used to recognise a replay rather than a separate event.

Read in context: 19.5.6

Deferred constraint

a rule whose check is postponed to a declared later boundary — an eligible constraint allowed to be temporarily unsatisfied within a transaction but required by successful final checking.

Read in context: 11.5.6

Degraded mode

a documented reduced service — an operational state with explicit limits rather than an undisclosed weakening of guarantees.

Read in context: 36.2.6

Degraded redundancy

fewer healthy copies than intended — an operational state that may persist after the service resumes.

Read in context: 34.3.6

DELETE

removing selected stored rows — a SQL operation whose effects are constrained by referential rules and transaction boundaries.

Read in context: 12.5.6

Delimiter

the mark used to separate fields — a structural character interpreted according to the parser’s current state.

Read in context: 7.3.6

Delivery attempt

one effort to transport a message; technically, a transmission attempt that may repeat the same logical event.

Read in context: 5.4.6

Delivery gap

uncertainty between an external action and its recorded acknowledgement — a failure window that can require replay or reconciliation.

Read in context: 24.6.6

Delta encoding

storing changes from earlier values — a representation whose savings depend on the size and regularity of differences.

Read in context: 43.2.6

Denominator

what the division is over; technically, the quantity that defines the base of a ratio or average.

what the total is divided by — the explicitly defined count or weight underlying a ratio.

the population a rate is out of — the eligible count or exposure giving a numerator its meaning.

Read in context: 3.6.6, 19.2.6, 46.2.6

Denormalisation

deliberately keeping an extra representation — controlled redundancy introduced for stated requirements with explicit maintenance obligations.

Read in context: 13.5.6

Derived data

an answer made from other data; technically, a representation produced by a transformation or calculation over inputs.

Read in context: 1.4.6

Deserialisation

rebuilding values from a stored representation — decoding and interpreting data into runtime objects under a specific format.

Read in context: 7.4.6

Design trade-off

a choice that improves some requirements at a cost to others — an explicit comparison of behaviour and responsibility under stated assumptions.

Read in context: 8.6.6

Destination capacity rule

an extra bound imposed by this storage adapter — a limitation distinct from parsing and the earlier domain contract.

Read in context: 9.2.6

Detection versus prevention

finding a violation versus stopping it from being committed — distinct responsibilities requiring different evidence.

Read in context: 11.4.6

Deterministic replay

the same retained inputs and rules give the same state — reconstruction without uncontrolled dependencies on current external values.

Read in context: 6.4.6

Deterministic result order

a sequence fixed by the stated query and data assumptions — an ordering whose relevant ties are resolved under chosen comparison rules.

Read in context: 12.3.6

Deterministic transformation

the same complete inputs yield the same output — a rule without uncontrolled time, randomness or external-state dependencies.

Read in context: 40.4.6

Dialect

the particular set of parsing conventions — settings governing delimiters, quotation marks, escaping and related behaviour.

Read in context: 7.3.6

Dictionary encoding

replacing values with reusable codes — a representation containing a distinct-value dictionary and an occurrence-code sequence.

Read in context: 43.2.6

Digest

a compact fingerprint of bytes — a fixed-length output of a hash algorithm, whose meaning depends on the exact input bytes and algorithm.

Read in context: 17.1.6

Dimension

the physical kind of a quantity; technically, its expression in powers of the chosen base quantities, such as length or time.

descriptive context for grouping facts — attributes connected to facts under a current or historical interpretation.

Read in context: 4.2.6, 42.2.6

Dimensional analysis

checking a calculation through its units; technically, checking compatibility of dimensions across an equation while recognising that semantics require further checks.

Read in context: 4.2.6

Directory durability

preserve the file’s naming relationship — persistence of directory metadata needed to find the intended file after failure.

Read in context: 30.3.6

Dirty page

a changed cached page awaiting corresponding writeback — a buffer whose managed contents differ from its lower stored representation.

Read in context: 27.4.6

Dirty read

seeing a change before it commits — observation of another transaction’s uncommitted data.

Read in context: 23.1.6

Disagreement

two observations or expectations do not match — a finding that requires diagnosis rather than automatically proving storage damage.

Read in context: 32.1.6

Dispatcher

the worker attempting recorded external tasks — a process that reads delivery intent and manages sends and acknowledgements.

Read in context: 26.4.6

Display name

the label shown to a person; technically, a presentation attribute that need not be unique or stable.

Read in context: 5.1.6

DISTINCT

removing repeated output rows — a SQL operation over selected result values, not automatic repair of a data model.

Read in context: 9.1.6

Distinct count

count different values under a rule — cardinality of the included value set after the specified equality and NULL treatment.

Read in context: 19.5.6

Divergent history

copies contain incompatible continuations — a situation requiring authority and recovery analysis rather than simple row copying.

Read in context: 34.6.6

Document

the searchable unit — an identified body of content, potentially a whole page or a bounded passage.

Read in context: 44.1.6

Document frequency

how many documents contain a term — a collection statistic used to distinguish common from rarer terms.

Read in context: 44.4.6

Domain

the allowed kind of value; technically, the set of permitted values and associated meaning for an attribute.

the values and meaning permitted for a role — a business-level contract potentially narrower than a storage type.

Read in context: 2.1.6, 9.2.6

Domain type

the business meaning of the value; technically, a model-specific type whose rules may exceed the underlying storage type.

Read in context: 3.1.6

Downstream impact

outputs and decisions depending on disputed data — the propagation scope that must be reviewed after a correction.

Read in context: 32.6.6

Draft record

unfinished work that remains open to revision — a lifecycle-specific representation with explicit incompleteness rules and no implied finalisation.

Read in context: 10.3.6

Dual-write gap

one system changes while another does not — a failure window between separately committed operations in different resources.

Read in context: 26.4.6

Duplicate member

a name repeated within one object — an interoperability hazard rejected by this book’s input profile.

Read in context: 7.4.6

Durability

surviving specified failures; technically, the persistence guarantee for accepted changes under stated assumptions.

the promised survival of committed work — persistence under defined failures, engine configuration and storage assumptions.

acknowledged work survives specified failures — persistence under a named configuration, recovery model and failure boundary.

Read in context: 1.5.6, 8.4.6, 21.4.6

Durability contract

what accepted data is promised to survive — a guarantee defined against specified failures and storage assumptions.

Read in context: 30.1.6

Durability evidence

observations supporting a bounded persistence claim — a test record tied to configuration, fault model and verification procedure.

Read in context: 30.6.6

Durable prefix

the surviving accepted beginning of a log — the valid ordered region known to have reached the required persistence boundary.

Read in context: 28.3.6

Duration

elapsed amount of time; technically, a measured or specified interval whose units and arithmetic semantics must be stated.

Read in context: 3.5.6

E

Edit distance

the number of selected character edits between strings — a spelling similarity measure, not a proof of intended identity.

Read in context: 44.5.6

Edit precondition

the state an update expects to replace — a condition checked at the write boundary to detect intervening changes.

Read in context: 25.2.6

Effect count

how many accepted changes occurred — distinct from how many attempts or deliveries were observed.

Read in context: 51.4.6

Effective privilege

what the identity can actually do — the result of direct grants, memberships, ownership and special execution rules.

Read in context: 47.2.6

Elapsed time

how long the chosen boundary took on a clock — wall-clock duration including waits within that boundary.

Read in context: 14.6.6

Election

selecting a coordinator under protocol rules — an authority decision with explicit membership and eligibility conditions.

Read in context: 34.3.6

Eligible access path

a route that can implement the required semantics — an index or scan option permitted by the query, operators and engine rules.

Read in context: 15.6.6

Eligible set

items permitted by the request’s complete conditions — the population within which retrieval should answer the question.

Read in context: 45.5.6

Embedded database

an engine included in an application process — database functionality supplied through library calls rather than a separate server process.

Read in context: 8.3.6

Embedding

an item’s numerical representation — an ordered vector produced by a defined encoder and preprocessing pipeline.

Read in context: 45.1.6

Embedding space

the coordinate system used for comparison — a representation whose geometry depends on its model and training objective.

Read in context: 45.1.6

Empty string

text containing no characters; technically, a zero-length string, distinct from SQL NULL in the engines discussed here.

Read in context: 3.6.6

Encoding

the mapping into bytes; technically, a defined representation of a character sequence for storage or interchange.

Read in context: 3.4.6

End-to-end boundary

the complete chain whose result is claimed — all participating systems and effects required for a stated business outcome.

Read in context: 26.6.6

End-to-end correctness

the complete operation preserves its contract — a property spanning components rather than inferred from any single successful API call.

Read in context: 39.6.6

End-to-end measurement

timing the complete defined operation — evidence that includes all stages required to produce and consume the intended result.

Read in context: 43.6.6

Enforcement gap

a declared rule without sufficient protection — a condition the implementation can violate despite the intended policy.

Read in context: 10.6.6

Entity

the thing the model is about; technically, a distinguishable object, concept or occurrence represented within a domain model.

Read in context: 5.1.6

Entity resolution

deciding which records concern the same thing; technically, inference over records that may lack a shared reliable identifier.

Read in context: 5.5.6

Envelope

the wrapper around a payload — metadata and framing interpreted before the enclosed message.

Read in context: 7.5.6

Epoch

a generation of authority or configuration — a value distinguishing successive valid ownership periods under a defined protocol.

Read in context: 34.4.6

Equality contract

the rule for deciding that two keys are the same — a domain-specific equivalence relation that hashing and comparison must respect.

Read in context: 17.3.6

Error budget

the allowed nonconformance under an objective — an arithmetic planning quantity whose definition does not override other requirements.

Read in context: 50.1.6

Estimand

the exact quantity a study seeks — the defined performance or outcome measure to which observations are intended to speak.

the precise quantity a study seeks — a defined population-level contrast under specified interventions or conditions.

Read in context: 20.5.6, 46.5.6

Euclidean distance

straight-line separation — the square root of summed squared coordinate differences.

Read in context: 45.2.6

Event

a record of something relevant happening — an occurrence interpreted under a stated event schema.

Read in context: 6.1.6

Event identity

the name of one accepted occurrence or change; technically, the identifier combination that distinguishes an event under the producer’s contract.

Read in context: 5.4.6

Event sourcing

keeping the accepted event history as the principal record — an architecture that reconstructs state from authoritative events.

Read in context: 6.1.6

Event time

when the described occurrence happened; technically, the timestamp assigned to the event under its source’s semantics.

when the described event is said to have happened — a timestamp assigned under the source and pipeline’s semantic contract.

Read in context: 2.5.6, 41.2.6

Eviction

remove a cached item to make room — replacement subject to usage, dirty-state and recovery constraints.

Read in context: 27.2.6

Evidence

what supports a claim; technically, information whose relevance and limitations must be assessed for that claim.

Read in context: 1.2.6

Evidence boundary

the limit of a justified conclusion — the tested scope, assumptions and unresolved properties attached to a result.

Read in context: 51.6.6

Evidence gap

something the records cannot establish — missing information or verification needed to support a claim about the world.

Read in context: 10.6.6

Evidence-preserving repair

fix a problem without concealing its original state — a procedure retaining provenance and disclosing reconstructed or lost information.

Read in context: 32.5.6

Exclusion

a deliberately unimplemented responsibility — an explicit limit such as payment settlement or physical dispatch.

Read in context: 51.1.6

Exclusion register

explain what did not contribute — recorded counts and reasons for records outside the report’s accepted population.

Read in context: 19.6.6

Executable assertion

a machine-checkable expectation — a predicate comparing an observed result with a declared outcome.

Read in context: 51.6.6

Execution plan

the chosen route to the answer — a structured set of access, join, calculation and ordering operations used by the executor.

Read in context: 18.1.6

Existence precheck

asking whether a record is present before attempting a write — a read that does not by itself prevent a concurrent conflicting insert.

Read in context: 11.2.6

Existence test

asking whether at least one match is present — a condition that need not reproduce every matching row in the output.

Read in context: 9.4.6

Expand

add a compatible new path — introducing representation or capability before removing the old one.

Read in context: 49.2.6

Expanded uncertainty

a stated multiple of standard uncertainty; technically, U = k × u_combined, accompanied by the coverage factor and justified interpretation.

Read in context: 4.6.6

Expected complexity

cost under specified distribution assumptions — an average or probabilistic bound, not a guarantee for every input.

Read in context: 17.3.6

Expected version

the history position a request relies on — a concurrency precondition used to detect stale writes.

Read in context: 6.2.6

Extended error code

a machine-readable refinement of a failure category — an implementation-specific identifier that distinguishes more precise error causes.

Read in context: 11.6.6

External effect

something changes beyond the local transaction — an action in another system or the physical world not automatically reversed by database rollback.

a change outside the local transaction — an email, print, remote API action or other operation not undone by ordinary database rollback.

Read in context: 21.6.6, 24.6.6

External outcome

an event beyond the local transaction — payment, delivery or another result needing separate evidence.

Read in context: 51.4.6

External validity

whether a result transfers beyond its test — the justified scope of applying observations to other workloads, environments or populations.

Read in context: 20.6.6

Extraction boundary

exactly which source state or records were selected — the snapshot, interval or immutable object defining a batch’s coverage.

Read in context: 40.2.6

F

Fact table

measurable observations at a declared grain — analytical records whose keys and units define what may be aggregated.

Read in context: 42.2.6

Failover runbook

the documented role-transition procedure — steps, prerequisites, checks and failure dispositions for transferring service authority.

Read in context: 34.6.6

Failure domain

what one failure can affect together — a process, host, device, availability zone or other explicitly bounded component group.

components that can fail together — a shared physical, software, administrative or operational dependency boundary.

things that can fail together — a boundary such as process, host, power supply, site or administrative authority.

Read in context: 21.4.6, 30.5.6, 33.1.6

Failure injection

deliberately create a specified fault — a controlled experiment against an authorized disposable system.

Read in context: 30.6.6

Failure policy

the permitted response to an interruption — explicit rules for retry, waiting, reconciliation, compensation or escalation.

Read in context: 38.6.6

Failure suspicion

evidence that a participant may be unavailable — an observation requiring protocol handling rather than certain knowledge of a crash.

Read in context: 34.2.6

False positive

a match accepted when the entities differ; technically, a positive decision for a negatively labelled case in the stated evaluation.

a possible match that is not actually present — a positive candidate result rejected by a later exact check.

Read in context: 5.5.6, 17.6.6

False suspicion

a healthy participant is treated as failed — a classification possible under delays, partitions or process pauses.

Read in context: 34.2.6

Fan-out

one source row producing several matched result rows — multiplicity introduced by a one-to-many match in a query.

one record becomes several joined contributions — multiplication of rows through a one-to-many or many-to-many relationship.

how many next regions one guide can select — the number of child references in an internal tree node.

Read in context: 9.4.6, 13.6.6, 16.2.6

Fault injection

deliberately interrupting a known path — a test technique whose simulated failure must be named precisely.

Read in context: 51.5.6

Fault model

the failures an experiment assumes or injects — the specific process, operating-system, device or communication conditions being tested.

the failures considered — the boundary within which a mechanism’s reasoning and tests are intended to apply.

Read in context: 28.6.6, 52.4.6

Fencing

preventing obsolete authority from acting — enforcement at a protected resource or infrastructure boundary that rejects stale owners.

Read in context: 34.4.6

Field

one named part of a record; technically, an attribute position with an agreed interpretation.

Read in context: 2.1.6

Field ID

stable column identity independent of a display name — metadata used to preserve meaning through supported schema changes.

Read in context: 42.4.6

File extension

the familiar suffix on a name — a naming convention that does not independently validate the represented format.

Read in context: 7.1.6

File format

how bytes are arranged; technically, the syntax and interpretation rules for a representation.

Read in context: 1.3.6

File synchronization

request persistence of pending file state — an operating-system operation with documented data, metadata and completion semantics.

Read in context: 30.3.6

File-level error

a failure affecting interpretation of the input as a whole — an outcome that withholds publication when trustworthy complete parsing is unavailable.

Read in context: 7.6.6

Filter false positive

a filter suggests a candidate that is absent — extra verification work without a false final membership claim.

Read in context: 29.4.6

Flattened export

related information copied into a single rectangular result — a representation that may repeat parent attributes at a finer output grain.

Read in context: 10.2.6

Floating point

a number representation with a movable scale; technically, a finite significand and exponent representation with defined rounding behaviour.

Read in context: 3.3.6

Flush

push pending changes toward a specified lower layer — an operation whose persistence guarantee depends on the API and storage contract.

Read in context: 27.4.6

Forecast error

the difference between prediction and observation — evidence used to update assumptions rather than hide uncertainty.

Read in context: 50.6.6

Foreign key

a checked reference to another stored key; technically, a constraint requiring referencing values to correspond to an eligible referenced key, subject to the database’s rules.

a declared reference to another allowed key — a referential-integrity constraint linking child values to parent values.

a stored link required to match an eligible parent — a referential constraint on child values with defined missingness, actions and checking time.

Read in context: 5.3.6, 9.3.6, 11.3.6

Fragmentation

useful space is distributed inconveniently — a layout condition whose performance effect depends on the engine and access pattern.

Read in context: 27.5.6

Framing

marking where messages or records begin and end — a boundary convention independent of the meaning of each payload.

make field boundaries unambiguous — an encoding convention that preserves where components begin, end and differ in type or length.

Read in context: 7.2.6, 17.1.6

Freelist

storage recorded as available for reuse — an engine-managed collection of free pages or blocks.

Read in context: 27.6.6

Frequent value

one value appears in many records — a high-frequency member of a distribution relevant to selectivity estimation.

Read in context: 15.5.6

Freshness objective

how current a result must be — an explicit bound connecting publication to its required source state.

Read in context: 42.6.6

Full-transaction retry

repeat the decision from fresh protected reads — a new attempt that does not reuse an invalidated transaction’s conclusions blindly.

Read in context: 23.6.6

Functional dependency

one part determines another; technically, a constraint under which equal determining attributes imply equal dependent attributes.

one set of fields fixes another under a rule — X → Y means equality on X implies equality on Y in every legal relation instance.

Read in context: 2.3.6, 13.4.6

G

Generation identifier

distinguish separate lifetimes of a reused key — an immutable identity component that changes when a resource is recreated.

Read in context: 25.4.6

Global invariant

a rule spanning several owners — a correctness condition not established by independent local checks alone.

Read in context: 35.5.6

Glossary

a vocabulary reference — definitions connected to their contexts and teaching locations.

Read in context: 52.1.6

Grain

what one record stands for; technically, the observation or business unit represented by each row.

what one row represents; technically, the unit of observation or business fact represented at the dataset’s chosen level.

Read in context: 1.4.6, 2.3.6

Grain contract

a precise statement of what one row represents — documentation tying a record’s unit, key, multiplicity and temporal meaning together.

Read in context: 10.2.6

Grapheme cluster

a unit closer to what a reader perceives as a character; technically, a text-segmentation unit defined by applicable Unicode rules and possible tailoring.

Read in context: 3.4.6

Gross mass

goods plus the included packaging; technically, mass under a definition that includes the stated container and packing materials.

Read in context: 4.1.6

Grounded answer

a response supported by inspected evidence — claims linked to sources that actually establish them, with limitations retained.

Read in context: 45.6.6

Group commit

one synchronization supports several commits — batching log persistence while meeting each transaction’s selected acknowledgement condition.

Read in context: 28.2.6

Grouping key

the fields defining each collection — expressions whose equal grouping values identify one aggregate group.

Read in context: 19.1.6

Guarded update

a mutation conditional on identity and expected state — a write whose predicate tests the specific prior condition required by the operation.

Read in context: 12.6.6

H

Half-even

choosing the even final digit at a tie; technically, rounding halfway cases to the nearest value whose retained least significant digit is even.

Read in context: 4.4.6

Half-open interval

include the start but not the end — an interval [a,b) useful for adjoining non-overlapping ranges.

Read in context: 16.5.6

Half-specified reference

only part of a multi-component link is supplied — an incomplete child tuple that needs an explicit acceptance policy.

Read in context: 11.3.6

Harness overhead

work caused by the measurement setup — time and resources consumed by generation, instrumentation and reporting rather than the target operation alone.

Read in context: 20.5.6

Hash function

a rule making an organising or checking value — a deterministic mapping under specified parameters and input representation.

Read in context: 17.1.6

Hash join

match through a temporary hashed key structure — a build-and-probe strategy that still checks equality and preserves required duplicates.

Read in context: 18.3.6

Hash partition

a piece selected through a repeatable mapping — placement based on a hash-derived value rather than original key order.

Read in context: 35.2.6

Hash partitioning

choose a data region from a key’s hash — routing through a versioned mapping from derived values to partitions.

Read in context: 17.6.6

Headroom

usable spare capacity — margin under stated workload and failure assumptions, not a generic machine percentage.

Read in context: 50.4.6

Heartbeat

a repeated liveness signal — periodic communication used to detect absence or delay under a configured policy.

Read in context: 34.2.6

Heuristic resolution

an exceptional locally chosen disposition — a decision outside normal coordinated evidence that can create inconsistency and requires explicit treatment.

Read in context: 38.3.6

Histogram

a summary of how values are distributed — a bucketed representation used for approximate frequency or range reasoning.

Read in context: 18.2.6

Historical recovery point

a selected earlier usable state — a state reconstructible from compatible retained recovery material.

Read in context: 33.6.6

Historical snapshot

a saved description of an earlier state — data retained under an explicit capture time, purpose and correction policy.

Read in context: 13.1.6

Historical snapshot attribute

a value copied to describe an earlier event or agreement — a stored attribute with event-specific temporal semantics, not automatic immutability.

Read in context: 10.3.6

Historical value

a value tied to an earlier event or agreement; technically, information whose interpretation must not be replaced by an unrelated current-state value.

Read in context: 2.3.6

HNSW

hierarchical neighbour-graph search — an approximate indexing approach navigating graphs at several levels of detail.

Read in context: 45.4.6

Hold

an explicit suspension of an action — a governed exception with reason, authority and review conditions.

Read in context: 48.2.6

Hot partition

one piece receives disproportionate work — a localized throughput, latency or resource bottleneck.

Read in context: 35.3.6

Hybrid retrieval

combining different candidate methods — often lexical and vector search followed by merging or reranking.

Read in context: 45.6.6

Hypothesis

a candidate explanation — a claim that should be distinguished from alternatives through suitable evidence.

Read in context: 52.3.6

Hypothesis-driven tuning

change what evidence suggests — performance investigation linking an explicit suspected cause to a controlled test.

Read in context: 18.6.6

I

Idempotency

repeating the operation without repeating its intended effect; technically, stability of the declared effect under repeated application within the operation’s identity and failure model.

Read in context: 5.4.6

Idempotency scope

where a replay identity is meaningful — the tenant, operation and retention boundary governing duplicate handling.

Read in context: 51.3.6

Identifier

a reference to a particular thing; technically, a value or tuple interpreted within a defined namespace and lifecycle.

a value used to refer to something; technically, a designation interpreted within an issuing namespace and its lifecycle rules.

Read in context: 2.4.6, 5.1.6

Identity boundary

the scope inside which a label identifies something — the domain over which a key or composite key is interpreted and uniqueness is enforced.

Read in context: 10.2.6

Identity conflict

one ID attached to incompatible content; technically, a violation of the mapping from an identifier to the immutable or otherwise controlled claim it is supposed to name.

Read in context: 5.4.6

Identity history

the record of how associations changed; technically, retained versions or events describing identifier mappings and their applicable decision boundaries.

Read in context: 5.6.6

Identity scope

the domain in which a key is unique — the tenant, operation and other components defining a request key’s namespace.

Read in context: 26.2.6

Idle in transaction

a transaction remains open without active useful work — a state that can retain locks and snapshots while the application waits elsewhere.

Read in context: 24.2.6

Idle input

a source currently producing no records — a condition requiring a policy, not proof that earlier events can never return.

Read in context: 41.4.6

Immediate constraint

a rule checked at its ordinary early boundary — an invariant enforced without the supported transaction-level postponement.

Read in context: 11.5.6

Immutable table file

a sorted file replaced rather than updated in place — an installed run whose ordinary contents do not change after creation.

Read in context: 29.2.6

Implementation boundary

where a claim stops generalising — the product, version and configuration for which a detail is established.

Read in context: 52.1.6

Implementation detail

how a particular system works; technically, behaviour that must not be assumed to apply to every conforming or competing system.

Read in context: 1.6.6

Import profile

the exact agreement for an exchange — a bounded specification combining encoding, syntax, fields and application rules.

Read in context: 7.3.6

In-doubt transaction

prepared work lacks a known final decision — a state requiring authoritative recovery information before safe resolution.

Read in context: 38.3.6

Inbox

the consumer’s delivery record — an identity committed with the local effect to support repeat handling.

Read in context: 51.3.6

Inbox record

remember which message identity was accepted — a consumer-side deduplication record committed with the participating local effect.

retained evidence of an accepted incoming message — a local identity and outcome record used to recognize duplicates and conflicts.

Read in context: 26.5.6, 39.3.6

Included column

payload carried alongside search keys — a non-key attribute stored in an index by an engine supporting that feature.

Read in context: 15.4.6

Inclusive interval

a range containing its endpoints — the boundary interpretation used by BETWEEN in the illustrated SQL conditions.

Read in context: 12.2.6

Incompatible key reuse

one identity is presented with different meaning — a conflict requiring rejection or explicit reconciliation, not silent replacement.

Read in context: 26.3.6

Incremental extraction

reading changes since recorded progress — a method whose cursor must account for the source’s actual change semantics.

Read in context: 40.2.6

Incremental maintenance

updating a result from a change — applying a justified delta instead of recomputing everything.

Read in context: 48.4.6

Indeterminate outcome

the caller cannot yet tell whether it completed — uncertainty commonly caused by losing communication around a commit or external effect.

Read in context: 21.2.6

Index

an extra route to selected records — a maintained data structure supporting specified search, ordering or constraint operations.

Read in context: 15.1.6

Index maintenance

keeping the extra route correct — updates, cleanup and related work required as the underlying data changes.

Read in context: 15.2.6

Indication

what the instrument shows; technically, the quantity value supplied by a measuring instrument or system.

Read in context: 4.1.6

Indirection

use a directory instead of embedding a location — a mapping layer separating stable identity from changing placement.

Read in context: 35.6.6

Indistinguishable histories

different realities look the same to an observer — executions with identical local evidence that require different correct outcomes.

Read in context: 36.4.6

Information leakage

using knowledge unavailable at the intended decision point — contamination that can make evaluation results unrealistically strong.

Read in context: 46.4.6

Information need

what the reader is trying to learn — the task that a query attempts to express.

Read in context: 44.1.6

Ingestion time

when a system accepted the input — a separately useful observation that does not replace the original event time.

Read in context: 41.2.6

Inner join

returning matching row combinations — a join that omits rows without a match in the joined relation.

keep successful pairings — a join that contributes only row combinations satisfying the join condition.

Read in context: 9.5.6, 13.3.6

Inner product

coordinate products added together — a similarity score affected by stored-vector magnitudes as well as direction.

Read in context: 45.2.6

INSERT

adding records — a SQL write operation that proposes new rows under the target table’s active rules.

Read in context: 12.5.6

Instant

one point on a timeline; technically, a temporal position distinguishable from its local display representation.

Read in context: 3.5.6

Instrumentation

measurements added to execution — observation code collecting timings, counts or resource evidence, potentially with its own overhead.

Read in context: 18.5.6

Integer

a whole number; technically, a value in the set of signed whole numbers, represented with implementation-specific limits.

Read in context: 3.2.6

Integer division

division evaluated using integer operands and rules — an operation that can discard the fractional component rather than produce a decimal quotient.

Read in context: 12.4.6

Integrity check

a check that retained content agrees with a reference — evidence of consistency, not automatic evidence of real-world truth.

inspection of declared structural properties — one layer of validation, distinct from complete business or security correctness.

Read in context: 6.6.6, 51.5.6

Interface

how one component asks another to do something; technically, the exposed operations and their input, output and error contracts.

Read in context: 1.3.6

Interleaving

the steps of different requests mixed together — an operation ordering that preserves each participant’s required local order.

Read in context: 22.1.6

Intermediate state

a visible stage before final completion — a condition that a saga-based application must interpret correctly.

Read in context: 38.6.6

Intervention threshold

the point to act before exhaustion — a chosen policy leaving time and resources for a controlled response.

Read in context: 50.3.6

Invalidation

mark a cached result unusable — a signal or state transition preventing further eligible reuse.

Read in context: 39.2.6

Invariant

a rule that must keep holding; technically, a predicate required of accepted states or permitted transitions.

a rule that must remain true — a property the chosen model preserves across accepted operations.

a condition the system is meant to preserve — a stated property that every accepted state transition must maintain.

a condition that must keep holding — a predicate preserved across the operations within its specified scope.

a rule every accepted state must preserve — a condition maintained by constraints and operation protocols across permitted transitions.

a rule accepted operations must preserve — a predicate over the relevant system state that the protocol is designed to maintain.

Read in context: 1.1.6, 6.2.6, 8.1.6, 11.4.6, 21.3.6, 26.1.6

Invariant check

testing a condition that should always hold — a verification step distinct from testing only one successful output.

Read in context: 37.6.6

Inverted index

a word-to-document map — an access structure locating documents containing searchable terms.

Read in context: 44.3.6

Irreversible transformation

one that loses needed distinctions — a mapping whose original inputs cannot be recovered from the retained output alone.

Read in context: 49.5.6

IS NULL

a direct test for missingness — a SQL predicate that checks whether an expression yields the NULL marker.

Read in context: 12.2.6

Isolation

rules for concurrent work seeing and affecting data — the semantics governing interaction between overlapping transactions.

rules for overlapping work — guarantees governing visibility and interaction among concurrent transactions.

Read in context: 8.4.6, 21.4.6

Isolation level

the chosen rules for overlapping transactions — a named contract restricting visibility and permitted concurrency anomalies.

Read in context: 23.1.6

IVF index

search through selected coarse groups — an inverted-file organization assigning vectors to regions before candidate evaluation.

Read in context: 45.4.6

J

Jitter

deliberately vary the waiting time — bounded randomness used to avoid synchronized retries.

Read in context: 24.5.6

Join

combining rows through a stated condition — an operation whose result can contain multiple matches for one source row.

Read in context: 9.4.6

Join predicate

the rule for pairing records — a Boolean condition controlling which row combinations contribute to a joined relation.

Read in context: 13.2.6

JSON array

a sequence of values — an ordered collection whose elements may themselves be structured.

Read in context: 7.4.6

JSON object

a group of named values — a collection of name/value members within a JSON representation.

Read in context: 7.4.6

Junction table

a table of links — an associative relation whose rows represent a defined pairing or richer relationship.

Read in context: 9.4.6

K

Key collision

two attempted records using the same constrained identity — a uniqueness conflict whose business interpretation requires the surrounding policy.

Read in context: 11.2.6

Key conservation

no entry disappears or is invented — equality between the intended inserted entries and those represented after restructuring.

Read in context: 16.4.6

Key dependency

recovery requires particular cryptographic material — an access and availability requirement for decrypting retained data.

Read in context: 31.6.6

Keyset progress

resuming from a stable ordered key — a traversal technique whose eligibility and concurrent-change boundaries still need design.

Read in context: 49.3.6

Known subtotal

a total over available values only — a partial calculation that must not be labelled complete when required observations are missing.

Read in context: 19.2.6

L

Last-write-wins policy

accept the selected later replacement — a conflict rule that can discard competing state and requires a defined ordering basis.

Read in context: 25.6.6

Latch

short-lived protection of an internal structure — a synchronisation mechanism distinct from a transaction’s logical locking policy.

Read in context: 16.6.6

Late arrival

a record received after its event period — an observation whose processing time occurs later than the event-time window it describes.

Read in context: 19.4.6

Late data

a record behind the accepted progress frontier — input whose event time precedes the relevant watermark or closed-window boundary.

Read in context: 41.4.6

Layout version

the identity of a placement map — metadata distinguishing successive assignments of logical partitions to owners.

Read in context: 35.2.6

Leader

the current coordinator for specified work — a role granted under a protocol with a defined authority scope.

Read in context: 34.1.6

Leader completeness

later valid leaders retain committed history — a safety property established by the full consensus protocol.

Read in context: 37.4.6

Leading key

the first part of an ordered index key — the prefix that groups entries before later components are compared.

Read in context: 15.3.6

Leaf

the bottom searchable page — a node containing data entries rather than further child pages in this teaching B+ tree.

Read in context: 16.1.6

Least privilege

only the authority needed — minimising effective permissions and their duration for a defined responsibility.

Read in context: 47.2.6

Left join

preserving the left input when no right match exists — an outer join that supplies NULL right-side values for unmatched left rows.

Read in context: 9.5.6

Left outer join

keep every left record, even without a match — a join adding a null-extended row for each unmatched left input row.

Read in context: 13.3.6

Length prefix

a size written before the content — a field giving the amount of following data in a stated unit.

Read in context: 7.2.6

Lexeme

a normalized searchable form — a dictionary or analyzer output that may combine several written word forms.

Read in context: 44.2.6

Lexicographic order

compare the first difference — tuple ordering determined by the earliest component on which two tuples differ.

Read in context: 15.3.6

LIMIT

a cap on rows returned by a query — an output selection clause that does not by itself bound all execution work.

Read in context: 12.3.6

Lineage

how one result came from other data; technically, the dependency path between inputs, transformations and outputs.

where a result came from — recorded relationships among inputs, transformations, executions and outputs.

Read in context: 2.5.6, 48.4.6

Linearizability

operations appear to take effect in one real-time-respecting order — a correctness condition placing each operation within its invocation-response interval.

Read in context: 36.1.6

Liveness

required progress eventually occurs under the assumptions — a property distinct from avoiding incorrect outcomes.

Read in context: 37.5.6

Load factor

how full the hash structure is — entries divided by the relevant bucket or slot count under a stated convention.

Read in context: 17.2.6

Locality

useful records are close in the accessed representation — spatial or temporal concentration that can reduce repeated movement or improve cache reuse.

related work stays close together — placement or access behaviour reducing the number of independent resources an operation must involve.

Read in context: 15.5.6, 35.1.6

Lock compatibility

which access modes can coexist — the engine’s conflict relation between requested and held lock modes.

Read in context: 24.2.6

Lock holder

the participant currently retaining protected access — the session or transaction owning a granted lock.

Read in context: 24.1.6

Lock lifetime

how long protected access remains held — the release boundary determined by transaction, statement, session or explicit protocol.

Read in context: 24.2.6

Lock scope

the resource access being coordinated — the row, table, key or other engine/application object covered by a lock.

Read in context: 24.1.6

Lock upgrade

requesting stronger access while already holding weaker access — a mode transition that can introduce additional conflicts.

Read in context: 24.4.6

Log

a recorded event — timestamped or otherwise ordered details describing a particular occurrence.

Read in context: 50.2.6

Log index

a position in the command sequence — an ordinal distinct from the term in which an entry was created.

Read in context: 37.2.6

Log matching

matching positions imply compatible preceding history under the protocol — a property enforced through entry terms and append checks.

Read in context: 37.2.6

Log sequence number

a position in a named recovery stream — an engine-defined offset used to identify and compare WAL progress.

Read in context: 28.3.6

Log tail

the final portion of the recorded sequence — a region that can be incomplete or require validity checks after failure.

Read in context: 28.1.6

Logical backup

reconstruct objects from their logical definitions and values — an export such as SQL or another supported logical representation.

Read in context: 31.1.6

Logical clock

a counter that helps preserve event order — a timestamping mechanism that need not represent physical time.

Read in context: 6.3.6

Logical deletion

removal from ordinary active data — a change to the database’s visible record state.

Read in context: 48.3.6

Logical inconsistency

records or calculations violate their intended meaning — a mismatch that can exist even when all files are structurally readable.

Read in context: 32.1.6

Logical payload

the data’s application representation — the meaningful values before engine and operational overhead.

Read in context: 50.3.6

Logical record

one complete parsed record — a structure that may span more than one physical text line.

Read in context: 7.3.6

Logical replication

following changes to data objects — replication based on record identity and logical operations rather than identical physical placement.

Read in context: 33.2.6

Loop count

how often a node is invoked — an execution multiplicity that must be considered alongside per-loop measurements.

Read in context: 18.5.6

Lossless coercion

changing representation without losing the represented value — an allowed conversion such as a supported textual integer into integer storage.

Read in context: 10.4.6

Lossless compression

a smaller representation with exact recovery — byte encoding whose decoder reproduces the original input.

Read in context: 43.3.6

Lossless decomposition

splitting without inventing or losing combinations on reconstruction — decomposition whose natural join recovers every legal original relation instance under the stated dependencies.

Read in context: 13.4.6

Lossy conversion

a change that forgets information; technically, a mapping from which the original value cannot always be reconstructed.

Read in context: 3.1.6

Lossy index entry

a representation that does not retain all distinguishing information — an entry requiring rechecking against fuller data to establish a match.

Read in context: 17.3.6

Lossy transformation

some source detail is discarded — a mapping that cannot generally be inverted to recover the original records.

Read in context: 40.4.6

Lost update

one accepted contribution disappearing beneath another write — a concurrency anomaly caused by insufficient coordination of read-modify-write operations.

one accepted change is overwritten by another — a write anomaly in which a later write fails to preserve an effect that should remain represented.

Read in context: 8.1.6, 22.2.6

LSM tree

organize writes through memory and merged sorted runs — a log-structured merge family of storage designs with deferred reorganization.

Read in context: 29.1.6

M

Magic marker

an initial clue about the representation — a fixed signature used to select or validate a format boundary, not authenticate a producer.

Read in context: 7.5.6

Majority

more than half of the configured group — floor(N/2)+1 participants for a fixed N-member configuration.

Read in context: 37.3.6

Manifest

the record of which storage files belong to the current state — metadata coordinating installed runs and their lifecycle.

an explicit inventory for a data version — metadata naming the files or entries that belong to a committed state.

Read in context: 29.2.6, 42.3.6

Many-to-many

several records on either side can relate — an association that needs an explicit representation and participation rules.

Read in context: 9.4.6

Marginal cost

the change caused by an additional unit of work — distinct from dividing the total bill by current volume.

Read in context: 50.5.6

Materialisation

save an intermediate result for reuse — creation of a stored working representation rather than recomputing or streaming every use.

Read in context: 18.1.6

Materialised projection

an answer stored for later reading — a persisted derived view rather than a query result recomputed on every request.

Read in context: 6.4.6

Materialized view

a stored query result — derived data whose refresh policy determines how current it is.

Read in context: 42.1.6

Measurand

the quantity you intend to measure; technically, the quantity defined as the target of a measurement, with the necessary object and condition information.

Read in context: 4.1.6

Measurement boundary

what the timer includes — the explicitly chosen start and completion conditions of an observed operation.

Read in context: 20.6.6

Membership check

confirm that the target actually exists — equality verification after locating a candidate or insertion position.

Read in context: 16.3.6

Membership configuration

the participants counted by the protocol — a versioned set whose changes require safety-preserving rules.

Read in context: 36.3.6

Memtable

the searchable workspace for recent writes — an in-memory structure holding entries before or alongside persistent sorted files.

Read in context: 29.2.6

Merge decision

an explicit association of records; technically, a versioned decision to treat selected representations as referring to one entity under stated evidence and rules.

Read in context: 5.6.6

Merge fan-in

how many ordered streams are combined at once — the number of input runs a merge step can consume under its buffer and resource limits.

Read in context: 14.4.6

Merge granularity

the unit at which changes are compared — a document, row, field or operation boundary used by the conflict protocol.

Read in context: 25.6.6

Merge iterator

read several ordered runs as one ordered sequence — an iterator that combines candidates while resolving key and version rules.

Read in context: 29.3.6

Merge join

match while advancing through ordered inputs — a strategy using compatible sorted join keys and correct handling of equal-key groups.

Read in context: 18.3.6

Mergeable summary

subgroup evidence can be combined correctly — a summary with a defined merge operation preserving the intended metric or error model.

Read in context: 19.5.6

Message authentication code

a keyed check on a message — an integrity and authenticity mechanism for parties sharing a key, not automatically a public signature.

Read in context: 17.4.6

Metadata

information describing other managed information — structural definitions such as columns, constraints and indexes in this context.

Read in context: 8.2.6

Metric

a measured quantity — an aggregated or sampled numeric signal with units and dimensions.

Read in context: 50.2.6

Metric definition

the exact question behind a number — rules for population, units, timing, inclusion and calculation.

Read in context: 46.1.6

Metric owner

the accountable interpreter of a reported measure — a role responsible for definition changes, exclusions and disputes.

Read in context: 42.5.6

Migration

a controlled evolution of structure or data — a versioned change with preconditions and a recovery strategy.

Read in context: 8.5.6

Missingness

required information is unavailable — a property of the observation process whose causes affect interpretation.

Read in context: 46.3.6

Missingness policy

what absence means and how it is handled; technically, the domain rules for rejecting, preserving, classifying or analysing unavailable values.

Read in context: 3.6.6

Mixed-snapshot calculation

combining facts observed at different boundaries — a derived result that may correspond to no single database state.

Read in context: 23.3.6

Model

a deliberately limited representation; technically, a set of concepts and rules chosen to answer particular questions.

Read in context: 1.6.6

Model defect

a representation that cannot express the intended work correctly — a structural or semantic mismatch with valid domain cases.

Read in context: 10.6.6

Monotonic reads

not going backward in observed progress — a session constraint preventing later reads from using an older relevant state.

Read in context: 33.5.6

Multiset

a collection that can contain repeated values — the bag-style semantics relevant to many ordinary SQL results.

Read in context: 9.1.6

Mutation path

a way records can change — an application route, job, import, administrator action or other writer that must respect the invariant.

Read in context: 22.5.6

Mutation policy

the rules for changing a record — a specification of permitted transitions, authorization, evidence and failure handling.

Read in context: 10.3.6

MVCC

let readers use suitable versions while changes occur — multi-version concurrency control using versioned data and transactional visibility rules.

Read in context: 25.1.6

N

Namespace

where a name has its meaning; technically, the scope within which identifiers are interpreted and uniqueness is defined.

the context in which an identifier has meaning; technically, an issuing or interpretive scope within which names are assigned and resolved.

a named container used to distinguish object names — in PostgreSQL, a schema that can contain tables and other database objects.

Read in context: 2.4.6, 5.3.6, 10.5.6

Natural key

a key drawn from the work’s own attributes; technically, an identifying set of domain attributes rather than a record-only identifier introduced by the receiving model.

Read in context: 5.2.6

Nearest neighbour

an item closest under a metric — a geometric result whose usefulness depends on the representation.

Read in context: 45.3.6

Negative control

a case that should be refused — a deliberately unauthorised or invalid operation with a checked outcome.

Read in context: 47.6.6

Negative lookup

a search that establishes absence — a lookup returning no visible matching key after checking relevant structures.

Read in context: 29.4.6

Nested-loop join

repeat matching work for each outer record — a join strategy whose inner access can range from a full scan to a selective lookup.

Read in context: 18.3.6

Net growth

increase after relevant additions and removals — a rate whose measurement window and storage boundary must be stated.

Read in context: 50.3.6

Network partition

some participants cannot communicate — a communication failure that can separate live components.

Read in context: 36.3.6

No-op entry

an agreed command with no domain change — an entry useful for establishing protocol progress without altering the business state.

Read in context: 37.4.6

Non-repeatable read

rereading a row yields a later committed value — a permitted observation change under some isolation contracts.

Read in context: 23.3.6

Normal form

a named condition for placing relational facts — a dependency-based schema property such as 3NF or BCNF.

Read in context: 13.5.6

Normalisation

a specified way to standardise equivalent text sequences; technically, conversion to a Unicode normalisation form, not general identity verification.

Read in context: 3.4.6

NOT NULL

a requirement that a database value be present — a constraint rejecting SQL NULL for a column.

Read in context: 9.2.6

Not-null rule

a requirement that a value be present — a column condition excluding SQL NULL, distinct from nonempty text or positive numeric value.

Read in context: 11.1.6

NULL

a specific SQL missing/unknown marker; technically, a marker with defined behaviour in comparisons, logic, constraints and aggregates.

Read in context: 3.6.6

Null extension

empty right-hand fields for an unmatched record — synthetic NULL-valued attributes introduced by an outer join, not a stored right-hand record.

Read in context: 13.3.6

Nullable foreign key

a reference column that can contain SQL NULL — an optional association under the engine’s stated matching semantics.

Read in context: 9.5.6

O

Observation

something someone or something noticed; technically, an acquisition of information under a stated method and context.

something recorded as seen or measured — evidence that need not itself authorise or cause a state-changing business action.

Read in context: 1.2.6, 6.1.6

Observation contract

the stated point or interval a result describes — the temporal and visibility meaning assigned to a query or report.

Read in context: 23.3.6

Observed-only statistic

a result using records with available values — a measure whose population excludes unresolved observations.

Read in context: 46.3.6

Obsolete version

an earlier stored state no longer needed by relevant readers — a version eligible for reclamation under the engine’s visibility and maintenance rules.

Read in context: 25.3.6

Occupancy

how full a page is — the used share of its usable entry capacity under the actual layout.

Read in context: 16.2.6

Offsetting errors

wrong values cancel in an aggregate — discrepancies that preserve a total while corrupting individual records.

Read in context: 32.4.6

One-to-many

one parent can have several children — a relationship whose child references need not be unique across the child table.

Read in context: 9.3.6

One-to-one

no more than one related row at each relevant side — a relationship whose optionality must still be specified separately.

Read in context: 9.3.6

Open-loop load

arrivals follow an independent schedule — a workload whose offered demand does not automatically slow with each response.

Read in context: 20.1.6

Operation contract

the promise made for one action — a specification of valid results, timing, visibility and failure outcomes.

Read in context: 36.6.6

Operation reconciliation

checking a prior request’s authoritative result — resolving uncertainty through stable identity and retained outcome evidence.

Read in context: 34.5.6

Operational owner

the person or team responsible for running and recovering the system — a named responsibility beyond writing its initial code.

the accountable responder — the person or team responsible for a signal, policy or unresolved task.

Read in context: 8.6.6, 50.6.6

Operational workload

queries and changes that run the business — work often focused on small, current, constrained transactions.

Read in context: 42.1.6

Operationalization

turning an idea into a measurable procedure — implementing a definition through observable records and calculations.

Read in context: 46.1.6

Operator precedence

the default grouping rules for an expression — syntax rules that determine binding unless parentheses explicitly override the grouping.

Read in context: 12.2.6

Operator state

remembered information used by a computation — partial aggregates, identities, timers and metadata needed to process later input.

Read in context: 41.6.6

Optimistic concurrency

detect a conflict when saving rather than holding a long edit lock — a protocol that validates an earlier observation at the write boundary.

Read in context: 25.5.6

Optimistic concurrency check

accepting a change only when relevant expected state still matches — a conflict-detection technique whose adequacy depends on the chosen predicate and version-maintenance policy.

Read in context: 12.6.6

Optional relationship

a permitted link that need not be present — a reference with a minimum participation count of zero.

Read in context: 9.5.6

Oracle

an independent expected-result mechanism — a simpler model used to compare the behaviour of a tested implementation.

Read in context: 16.6.6

Orchestration

a coordinator directs workflow steps — an arrangement that centralizes sequencing and recovery decisions.

Read in context: 38.5.6

ORDER BY

the requested ordering of a query result — a clause specifying sort expressions, directions and applicable ordering semantics.

Read in context: 12.3.6

Orphan file

a stored object not referenced by an accepted table state — prepared or abandoned data requiring a deliberate retention or cleanup policy.

Read in context: 42.3.6

Orphan row

a child with no required matching parent — an existing record violating the intended referential relationship.

Read in context: 11.3.6

Out-of-line value

a large value stored separately from its main row — payload reached through a reference rather than fully embedded in the ordinary tuple.

Read in context: 27.3.6

Outbox

committed work carries a delivery instruction — a transactional record of an event or message to be delivered by a separate process.

a durable list of external work implied by accepted changes — message-intent records committed atomically with local business state.

atomically recorded delivery intent — a local record that survives with the business change but does not guarantee external completion.

Read in context: 21.6.6, 24.6.6, 51.3.6

Outcome reconciliation

resolve uncertainty using recorded identity and state — a procedure for determining what a prior attempt actually accepted.

Read in context: 26.6.6

Outer transaction

the enclosing acceptance boundary — the transaction whose final commit or rollback governs changes retained from inner savepoint work.

Read in context: 21.5.6

Output grain

one resulting row means one what — the level at which a transformed record states a fact.

Read in context: 40.4.6

Overfetching

retrieving extra candidates before later selection — a mitigation that must be evaluated rather than assumed to guarantee filtered recall.

Read in context: 45.5.6

Overflow

exceeding a representation’s capacity; technically, an operation whose mathematical result lies outside the representable range.

Read in context: 3.2.6

P

Page cache

operating-system memory holding file data — a cache between application I/O and lower storage devices.

Read in context: 30.2.6

Page occupancy

how much of a page is usefully filled — the proportion consumed by payload and required structures under a stated layout.

Read in context: 27.1.6

Page split

divide an overfull region — redistribution into two nodes with updated parent boundaries and relevant sibling links.

Read in context: 16.4.6

Pagination

splitting a result into separately retrieved pages — a reading pattern needing ordering and cross-request consistency decisions.

Read in context: 12.3.6

Parent row

the row being referenced — a record whose key is the target of a particular foreign-key relationship.

Read in context: 9.3.6

Parser

a shape reader; technically, software that recognises a representation according to its grammar.

Read in context: 2.2.6

Parsing

finding the structure in a representation — recognising records, fields and values under a grammar.

Read in context: 7.2.6

Partial aggregation

summarize locally before combining — retaining sufficient intermediate state for the intended final calculation.

Read in context: 35.5.6

Partial index

a guide for a defined subset — an index whose entries include only rows satisfying its predicate.

Read in context: 15.4.6

Partial operation

only part of a logically related change becoming effective — an incomplete business action whose pieces were not protected by the needed boundary.

Read in context: 8.1.6

Partial order

an order that does not compare every pair — a relation under which some distinct events remain unordered.

Read in context: 6.3.6

Partial rollback

discard only a selected later portion — rollback to a savepoint rather than abandonment of the entire outer transaction.

Read in context: 21.5.6

Partial write

fewer bytes were accepted than requested — an I/O result requiring explicit handling rather than an assumption of complete transfer.

Read in context: 30.2.6

Participant

a resource involved in a coordinated transaction — a resource manager responsible for its local prepared and final state.

Read in context: 38.1.6

Participation minimum

the least number of required related records — a cardinality condition such as “every completed order has at least one line”.

Read in context: 10.2.6

Partition key

the value deciding placement — a field or expression mapping a record into a defined partition.

Read in context: 35.1.6

Partition progress

how far one input segment has advanced — a scoped position that must not be confused with universal completion.

Read in context: 41.1.6

Path

instructions for locating something in a filesystem — a name interpreted under platform-specific pathname-resolution rules.

Read in context: 7.1.6

Path property

useful information about an intermediate route — characteristics such as ordering, parameter dependence and estimated size used in planning.

Read in context: 18.4.6

Payload

the useful represented content — bytes under a stated boundary, excluding or including overhead only as explicitly defined.

Read in context: 14.2.6

Payload equivalence

when two attempts mean the same thing — an explicit comparison contract over validated request semantics.

Read in context: 26.2.6

Peer group

rows tied under a window’s ordering — entries equal on all ordering expressions used to define peers.

Read in context: 19.3.6

Per-entity ordering

related changes follow one entity’s sequence — a scoped requirement rather than a claim of global ordering across all work.

Read in context: 39.4.6

Percentile

a position in an ordered population or sample — a quantile defined under a stated convention, such as nearest rank.

Read in context: 20.2.6

Phantom

a repeated condition matches a changed set — a predicate-query membership change caused by another transaction’s committed work.

Read in context: 23.1.6

Physical backup

preserve an engine’s storage representation — a copy requiring the matching consistency, version and recovery procedure.

Read in context: 31.1.6

Physical corruption

stored representation is damaged or invalid — a failure involving bytes or engine structures rather than merely an undesirable business value.

Read in context: 32.1.6

Physical replication

following the storage engine’s changes — replication tied to physical representation and recovery information.

Read in context: 33.2.6

Physical row location

where one stored version currently resides — engine metadata such as PostgreSQL’s ctid, not an enduring logical identity.

Read in context: 25.1.6

Placeholder

a marked position for a bound value — syntax such as ? in the demonstrated Python/SQLite interface.

Read in context: 12.6.6

Placement invariant

a rule about where records belong — a condition linking keys, layout versions and valid owners.

Read in context: 35.6.6

Plan regression

a changed execution choice worsens a defined workload — an observed performance deterioration, not merely a different plan diagram.

Read in context: 15.6.6

Plan selection

choosing among legal routes — the optimiser’s decision based on estimated costs and available information.

Read in context: 15.6.6

Planner cost

an estimate for comparing execution choices — a model-specific quantity derived from statistics and configured operation costs.

Read in context: 14.6.6

Point-in-time recovery

restore a supported earlier state — replay from a matching base to a chosen engine-supported recovery target.

Read in context: 31.3.6

Policy bypass

an execution path exempt from a rule — special authority that must be accounted for when testing enforcement.

Read in context: 47.3.6

Policy oracle

the expected permission decision — the independently stated rule used to judge a test result.

Read in context: 47.6.6

Policy version

which rule was applied — an identity connecting a lifecycle decision to the exact governing definition.

Read in context: 48.2.6

Portability

the ability to move a defined workload between environments — compatibility of the used semantics and operations, not merely similar syntax.

Read in context: 8.6.6

Positional index

an index retaining term locations — metadata supporting phrases and proximity conditions beyond word presence.

Read in context: 44.3.6

Post-filtering

removing candidates after retrieval — an approach that can reduce returned coverage when the candidate budget was spent on ineligible items.

Read in context: 45.5.6

Postcondition

something promised after an action — a predicate the completed operation is intended to establish or preserve.

Read in context: 10.1.6

Posting list

occurrences associated with one term — document references, often accompanied by frequency or position information.

Read in context: 44.3.6

Power-loss protection

preserve specified device state during power interruption — a hardware capability whose scope and health must be verified.

Read in context: 30.4.6

Pre-aggregation

calculate a total before joining it to other detail — reducing a relation to the required grouping grain before a later join.

Read in context: 13.6.6

Pre-binding validation

checking input before the driver sends it — validation while original runtime distinctions remain available to application code.

Read in context: 10.4.6

Precision

repeated readings agreeing closely; technically, closeness among replicate indications or measured values under specified conditions.

how much of the returned material is relevant — relevant retrieved items divided by retrieved items under a stated cutoff and unit.

Read in context: 4.3.6, 44.6.6

Precision, matching

the share of accepted matches that are correct; technically, true positives divided by all positive predictions, not measurement precision from Chapter 4.

Read in context: 5.5.6

Precondition

something that must hold before an action — a predicate required at an operation’s entry boundary.

what must be true before a change — the checked state and authority on which safe execution depends.

Read in context: 10.1.6, 49.6.6

Predicate

a condition used to choose records — an expression whose truth controls qualification in a query operation.

a condition used to select records — an expression whose truth determines query eligibility under the relevant semantics.

Read in context: 14.1.6, 43.4.6

Predicate pushdown

evaluating selection closer to storage — moving supported filtering work earlier to reduce later processing.

Read in context: 43.4.6

Predicate tracking

remember the read conditions that matter — implementation metadata used to detect dependencies involving rows or ranges a transaction read.

Read in context: 23.5.6

Prefetch

how much unacknowledged work a consumer may receive — a broker/client flow-control setting with a defined scope.

Read in context: 39.5.6

Preimage

the exact state expected before a repair — captured values or bytes used to verify that a proposed change targets the reviewed input.

Read in context: 32.5.6

Preimage resistance

hard to work backwards from a digest — computational difficulty of finding an input producing a specified hash output.

Read in context: 17.4.6

Prepare

promise readiness for a later decision — a state in which a participant retains the resources and recovery information needed by the commit protocol.

Read in context: 38.2.6

Primary key

the table’s chosen identifying key; technically, a selected set of columns whose combined values uniquely identify each row and cannot be null under the relevant database rules.

the chosen required identifier for a table — the designated key used as a principal row identity in the current schema.

Read in context: 5.1.6, 11.2.6

Primary source

the originating documentation or research — evidence closer to the specified behaviour than a second-hand summary.

Read in context: 52.6.6

Prime attribute

a field belonging to at least one minimal key — an attribute contained in some candidate key, not necessarily the selected primary key.

Read in context: 13.5.6

Principal

the person or program asking — an authenticated or otherwise explicitly established security identity used in policy evaluation.

Read in context: 47.1.6

Probe sequence

alternative places checked after a collision — a defined traversal of slots in an open-addressed hash table.

Read in context: 17.2.6

Process boundary

a separation between running programs — an isolation and communication boundary that changes failure and resource handling.

Read in context: 8.3.6

Processing time

when a processor handles a record — time measured by the executing system, potentially different on replay.

Read in context: 41.2.6

Product quantization

compact codes for vector parts — a representation replacing subvectors with codebook references for storage and distance estimation.

Read in context: 45.4.6

Progress property

required work can eventually advance — a liveness claim dependent on assumptions about failures and resources.

Read in context: 52.4.6

Projection

an answer built from other records — a derived representation produced by applying transformation rules to source data.

choose the fields needed — a relational or SQL operation producing selected expressions rather than every available attribute.

Read in context: 6.1.6, 14.2.6

Projection pruning

avoiding unneeded fields — selecting only the columns required to compute the query result.

Read in context: 43.1.6

Projection version

which interpretation produced the answer — an identifier for the relevant transformation or state representation.

Read in context: 6.4.6

Projection, in a query

choosing which values to display — an operation that selects output columns and can hide source identity.

Read in context: 9.1.6

Promotion

making a replica an active authority — a role transition requiring a supported procedure and protection against competing writers.

Read in context: 33.6.6

Provenance

the history behind a record; technically, information about entities, activities, agents and derivations involved in producing it.

where information came from and how it was handled — recorded source, capture and transformation context, not automatic proof of truth.

the recorded origin and processing history — information linking source entities, transformations and resulting data.

Read in context: 2.5.6, 7.1.6, 40.1.6

Publication boundary

the point where accepted work becomes available in the destination — a separately controlled step beyond decoding and input validation.

Read in context: 7.6.6

Publication unit

the selected set of records accepted together — the transaction scope for this destination, distinct from an entire source file.

Read in context: 9.6.6

Publisher confirm

the broker acknowledges publication — evidence about the publisher-to-broker boundary rather than consumer completion.

Read in context: 39.3.6

Purpose limitation

using information for a defined need — an explicit boundary on collection and downstream use.

Read in context: 48.1.6

Q

Qualified name

a name that includes its containing scope — an identifier such as sales.orders rather than an unqualified table name.

Read in context: 10.5.6

Quantisation

fitting values to allowed steps; technically, mapping values to a discrete set of representable or permitted outputs.

replacing a continuous range with steps; technically, mapping input values to discrete output levels.

Read in context: 3.3.6, 4.4.6

Quarantine

retaining rejected material for controlled review — a handling state with separately specified access and retention rules.

Read in context: 7.6.6

Query

a precise question; technically, an operation expressing a requested result over data.

a request for a result from data — an expression evaluated under a data model and its language semantics.

Read in context: 1.4.6, 8.2.6

Query expansion

adding related search terms — a recall-oriented technique whose extra candidates can change precision and meaning.

Read in context: 44.5.6

Query grain

what one result row means — the level created by joins, projection and grouping.

Read in context: 52.2.6

Query plan

the engine’s proposed route to an answer — an execution structure using operations such as scans, filters, joins and aggregation.

Read in context: 8.2.6

Query rewrite

a semantics-preserving change in representation — transformation of a query before or during planning under the engine’s rules.

Read in context: 18.1.6

Queue age

how long work has waited — a latency and starvation signal distinct from the number of queued messages.

Read in context: 39.5.6

Queueing delay

time waiting before work can proceed — delay caused by contention or scheduling rather than the operation’s own active computation.

Read in context: 14.6.6

Quorum

a participant set sufficient for a protocol action — a set meeting defined size or intersection requirements.

Read in context: 36.5.6

Quorum intersection

relevant sets share participants — a necessary ingredient in many protocols whose meaning depends on retained state and rules.

Read in context: 36.5.6

Quoting

marking a region as one field — a representation mechanism that allows otherwise structural characters inside a value.

Read in context: 7.3.6

R

Race condition

an answer that depends on an unsafe overlap — behaviour whose correctness changes with the relative execution order of competing operations.

Read in context: 22.1.6

Range

the smallest through largest supported values; technically, the domain bounds of a representation or declared type.

Read in context: 3.2.6

Range partition

a piece owning an ordered interval — a partition defined by lower and upper key bounds.

Read in context: 35.2.6

Range scan

walk entries between boundaries — ordered traversal beginning near a lower bound and stopping when an upper condition fails.

Read in context: 16.5.6

Raw sample

an individual retained observation — an unaggregated measurement from which summaries can be recomputed.

Read in context: 20.6.6

Read amplification

extra storage work for a logical read — a defined ratio or probe count measured at a specified layer.

reading more bytes than the requested logical data — additional work caused by layout, blocks, metadata or access patterns.

Read in context: 29.4.6, 43.3.6

Read dependency

a decision relies on an observed fact — a relationship between a transaction’s read and another transaction’s relevant write.

Read in context: 23.4.6

Read scaling

sharing question-answering work — distributing eligible read operations across resources without assuming identical freshness.

Read in context: 33.1.6

Read-modify-write

read a value, compute a replacement, then store it — a multi-step sequence that needs an appropriate concurrency rule.

Read in context: 8.1.6

Read-your-writes

seeing your own completed changes — a session guarantee that later eligible reads include the session’s prior acknowledged writes.

Read in context: 33.5.6

Rebalancing

changing where pieces are served — controlled movement of data or ownership to meet capacity and workload needs.

Read in context: 35.4.6

Rebuild

write a reorganized physical representation — maintenance that can improve layout while requiring I/O, temporary capacity and coordination.

Read in context: 27.5.6

Recall

the share of true matches found; technically, true positives divided by the actual positive cases under the evaluation labels.

how much relevant material was found — relevant retrieved items divided by the known relevant population.

Read in context: 5.5.6, 44.6.6

Reciprocal rank

a measure of how soon the first useful answer appears — one divided by its rank, with an explicit no-answer convention.

Read in context: 44.6.6

Recomputation

rebuilding from an authorised source set — creating a new derived result under a recorded transformation version.

Read in context: 48.4.6

Reconciliation

comparing related accounts of the same work; technically, identifying and resolving or explicitly retaining discrepancies under a defined procedure.

checking whether related records agree as expected — a comparison of identities, relationships and totals rather than a single balancing sum.

explaining how the input relates to the output — accounting for candidates, repeats, rejections and file-level limits without silently losing material.

compare defined representations of the same work — an evidence-based check of populations, keys, amounts and explained differences.

compare related records to resolve disagreement — a procedure that checks quantities, identities and outcomes against stated invariants and evidence.

comparing expected and observed information — a set of coverage, identity, value and invariant checks across representations.

comparing meaningfully corresponding records — checking identities, values and declared exclusions rather than one headline total.

Read in context: 1.2.6, 6.5.6, 7.6.6, 13.6.6, 22.6.6, 40.6.6, 49.4.6

Reconciliation identity

an equation connecting related records — a check that quantities and recorded state changes agree under stated inclusions and exclusions.

Read in context: 26.1.6

Reconciliation population

the records intended for comparison — a defined set that prevents mixing separate fixtures or tenants.

Read in context: 51.4.6

Reconstruction boundary

how far an answer can be rebuilt — the scope supported by retained inputs, snapshots and interpretation rules.

Read in context: 6.6.6

Record class

a group with a common responsibility — data categorised by purpose, access and lifecycle requirements rather than file extension alone.

Read in context: 48.1.6

Record locator

information leading from an entry to its record — an engine-specific reference or identifying value used to retrieve associated data.

Read in context: 16.3.6

Recording time

when a defined system boundary recorded the information; technically, a timestamp whose acquisition point must be specified.

Read in context: 2.5.6

Recovery base

the known state from which replay begins — a checkpoint or backup identified together with its matching log boundary.

Read in context: 28.5.6

Recovery dependency

something required to make restored data usable — keys, configuration, software, access and other prerequisites beyond database bytes.

Read in context: 30.5.6

Recovery log

information needed to reconstruct a valid stored state — engine records supporting recovery after incomplete persistence or interruption.

Read in context: 28.1.6

Recovery oracle

independent evidence of the expected result — identities and values used to judge what should remain after the tested failure.

Read in context: 30.6.6

Recovery ownership

who is responsible for unresolved work — an operational assignment ensuring pending and in-doubt operations are not abandoned.

Read in context: 38.6.6

Recovery point objective

how much recent work the plan may lose — a stated acceptable recovery-point gap, not an achieved measurement by itself.

Read in context: 8.5.6

Recovery protocol

the rules for interpreting surviving evidence — a specified procedure connecting log validity, transaction status and stored data.

Read in context: 28.1.6

Recovery rehearsal

trying the recovery procedure in isolation — a test of restoration steps, evidence and operational assumptions before an incident.

Read in context: 33.6.6

Recovery target

the intended state or boundary to restore — a chosen time, log position or other engine-supported objective with matching evidence.

Read in context: 28.6.6

Recovery time objective

how long recovery may take — a target for restoring a defined service level under a stated scenario.

Read in context: 8.5.6

Recovery timeline

a named branch of physical recovery history — metadata distinguishing histories after recovery or promotion under the engine’s rules.

Read in context: 31.3.6

Recovery unit

the things the restoration claim includes — an explicit scope such as one database or a complete application service.

Read in context: 8.5.6

Redelivery

a message is delivered again — a transport event that must be distinguished from a new business event.

Read in context: 39.4.6

Redo

reconstruct an accepted change from recovery information — replay that restores data not fully reflected in the main data files before failure.

Read in context: 27.4.6

Redo horizon

the earliest recovery position still needed — the log boundary from which reconstruction must begin for a particular purpose.

Read in context: 28.4.6

Redundancy

several representations of a fact — duplication whose consistency depends on maintaining a specified relationship between representations.

Read in context: 13.1.6

Referential action

what happens to a relationship when a parent changes — a declared response such as restriction, cascading deletion or setting a reference to NULL.

Read in context: 11.3.6

Referential check

verify relationships between records — a test that child references resolve according to the schema’s key rules.

Read in context: 32.3.6

Referential integrity

references remaining valid under declared rules — the property enforced by active foreign-key constraints within their semantics.

Read in context: 9.6.6

Regression envelope

cases checked for unintended deterioration — representative workloads beyond the one case an intervention aims to improve.

Read in context: 18.6.6

Regression fixture

data and steps reproducing a past failure — a test case intended to prevent recurrence of the specific defect.

Read in context: 32.6.6

Regression test

a repeatable check preserving an intended behaviour — evidence that a known property still holds for the tested inputs after a change.

Read in context: 9.6.6

Rehearsal

a bounded execution before live work — an experiment whose representativeness and limitations must be stated.

Read in context: 49.6.6

Reinitialization

rebuilding a participant from valid source state — a controlled procedure restoring a compatible replica and its role.

Read in context: 34.6.6

Reintroduction

retired information returning through recovery — restoration of an older state without later lifecycle decisions.

Read in context: 48.5.6

Relative path

a location described from a starting point — a pathname whose interpretation depends on a working directory or another supplied base.

Read in context: 7.1.6

Relative update

describe the change rather than an old replacement — an expression such as value = value - amount evaluated by the database.

Read in context: 22.2.6

Release manifest

an inventory of delivered bytes — filenames, sizes and digests that support integrity checks.

Read in context: 51.6.6

Repair branch

a deliberate resolution of incomplete transactional work — an explicitly permitted continuation that restores the failed condition before a later commit.

Read in context: 11.5.6

Repair manifest

the record of a bounded correction — evidence, scope, changes, checks and authority supporting an intervention.

Read in context: 32.5.6

Replacement entry

the newly accepted corrected representation — a record distinguished from the earlier entry it supersedes or repairs.

Read in context: 6.5.6

Replacement result

a new complete answer for the same key — output that supersedes an earlier revision rather than adding to it.

Read in context: 41.5.6

Replay

another attempt carrying the same defined intent — a repeated request that should resolve through its existing identity and outcome.

Read in context: 26.3.6

Replay position

how far recovery has applied the stream — progress measured under the engine’s interpretation of log records.

Read in context: 28.3.6

Replay review

inspect historical pending work before reactivation — reconciliation of restored tasks with effects that may already exist outside the backup boundary.

Read in context: 31.5.6

Replay-safe delivery

repetition does not duplicate the intended effect — handling a repeated identity consistently while detecting conflicting payloads.

Read in context: 40.5.6

Replica

another maintained copy — a data instance updated through a defined replication mechanism.

Read in context: 33.1.6

Replicated state machine

copies execute one agreed command sequence — an architecture connecting log agreement to matching application state.

Read in context: 37.1.6

Replication identity

the handle for locating a changed row — the key or supported old-row representation used to apply updates and deletions.

Read in context: 33.2.6

Replication lag

one replication stage is behind another — a difference measured using compatible positions, bytes or carefully interpreted timing evidence.

Read in context: 33.4.6

Replication slot

retained source progress for a consumer — a PostgreSQL mechanism whose log retention and restart behaviour require monitoring.

Read in context: 40.3.6

Report grain

what one result row describes — the precise unit represented after selection, joining and aggregation.

Read in context: 19.1.6

Representation compatibility

vectors can be compared meaningfully — agreement between encoder, dimension, normalization and metric contracts.

Read in context: 45.1.6

Representation contract

meaning attached to stored values — units, range, missingness and interpretation beyond the physical type.

Read in context: 52.2.6

Repricing

calculating using a different price basis — recomputation with current or alternative prices rather than the stored agreed values.

Read in context: 10.3.6

Reprocessing

applying rules again to retained inputs — a controlled rebuild whose interpretation depends on input and transformation versions.

Read in context: 40.6.6

Reproducibility record

enough context to repeat a result — candidate, inputs, environment, operations and observations.

Read in context: 52.5.6

Reproducible example

an example another reader can check; technically, one supplied with sufficient inputs, procedure and environment information to repeat its stated observation.

Read in context: 1.6.6

Request identity

the stable name of one intended operation — a scoped identifier linking repeated attempts to one business decision.

Read in context: 26.2.6

Reservation

a recorded allocation under defined rules — a business state transition that reduces available capacity while linking the allocation to a request.

Read in context: 22.6.6

Reset scope

what was actually returned to a starting condition — the exact layers or resources reinitialised before a measurement.

Read in context: 20.4.6

Residual copy

information remaining after selected actions — a retained, failed, blocked or unknown destination requiring explicit treatment.

Read in context: 48.6.6

Residual filter

a check made after finding candidates — a predicate evaluated after an access path has already visited candidate entries or rows.

Read in context: 14.5.6

Resolution

the smallest distinguishable change; technically, the change in the measured quantity that causes a perceptible change in the corresponding indication under the stated conditions.

Read in context: 4.3.6

Restated series

historical results recalculated under a new rule — a versioned view distinct from what was previously published.

Read in context: 46.1.6

Restatement

a later version of an earlier report — a deliberate correction whose relationship to previously published results remains visible.

Read in context: 41.6.6

Restoration

bringing back a stored copy — a recovery operation that must account for the copy’s age and subsequent required changes.

Read in context: 6.6.6

Restore acceptance

decide whether the recovered state meets its objective — a documented result based on actual recovery and relevant application checks.

Read in context: 31.5.6

Restore isolation

keep the recovered copy from affecting live systems — a controlled environment with outbound effects and production access disabled during validation.

Read in context: 31.2.6

Restore rehearsal

actually exercise the recovery procedure — a controlled test measuring whether the required state and service can be recovered.

recovering and checking a separate destination — evidence about a specific recovery procedure and input.

Read in context: 31.4.6, 51.5.6

Restore test

trying the recovery procedure and inspecting its result — evidence about a specified backup and environment rather than a promise about all future failures.

Read in context: 8.5.6

Restore-time suppression

prevent retired data from re-entering ordinary use — reapplication of approved deletion or access decisions after historical recovery.

Read in context: 31.6.6

Restricted retention

kept for a bounded exception — retained data whose access and use differ from ordinary active records.

Read in context: 48.5.6

Result cardinality

how many output rows there are — the row count at a specified stage, distinct from records examined or bytes read.

Read in context: 14.1.6

Result contract

the meaning promised by a query’s output — a specification of columns, units, grain, missingness and ordering where relevant.

Read in context: 10.5.6

Result population

the records or combinations included in an answer — the scope after joins and filters, which must match the report’s intended question.

Read in context: 9.5.6

Resurrection

an old deleted value becomes visible again — a correctness failure caused by losing the deletion information while older state remains reachable.

Read in context: 29.5.6

Retention

how long and why information is kept; technically, a policy governing continued storage and eventual disposition for defined record classes.

Read in context: 2.6.6

Retention boundary

which history remains available — a stated limit on kept records, detail, time or access.

Read in context: 6.6.6

Retention trigger

the event starting a lifecycle rule — a defined transition such as closure, not an assumed timestamp.

Read in context: 48.2.6

Retrieval boundary

what finding a source does and does not prove — the distinction between candidate similarity and verified, authorized factual support.

Read in context: 45.6.6

Retry amplification

repeated attempts adding load during trouble — feedback that can worsen the condition callers are trying to recover from.

Read in context: 50.4.6

Retry budget

the allowed additional effort — limits on attempts, elapsed time or resources spent resolving transient failures.

Read in context: 24.5.6

Retry deadline

the point beyond which another attempt is not allowed — an operation-level bound on time spent resolving transient failures.

Read in context: 23.6.6

Retry horizon

how long old requests remain recognizable — the interval over which a system retains the evidence needed by its idempotency contract.

Read in context: 34.5.6

Reusable space

allocated storage available for later records — free capacity inside an existing database structure rather than necessarily returned to the filesystem.

Read in context: 27.5.6

Reversal

an opposite recorded effect tied to an earlier entry — a constrained correction operation whose scope must be defined.

Read in context: 6.5.6

Revision

a particular state after a change; technically, an identifiable version of a record or artefact.

Read in context: 2.6.6

Revision exhaustion

no unused value remains in the chosen domain — a boundary requiring an explicit policy rather than silent counter reuse.

Read in context: 25.4.6

Revocation

withdrawing previously valid authority — disabling future accepted use, distinct from deleting one stored copy.

Read in context: 47.5.6

Revocation delay

time before a withdrawn permission stops working — the exposure window introduced by cached or long-lived authority.

Read in context: 47.1.6

Roll-forward

correcting through a subsequent change — a new reviewed transformation rather than automatic restoration of the past.

Read in context: 49.5.6

Rollback

cancelling uncommitted work; technically, discarding the transaction changes within the requested rollback scope.

abandoning uncommitted database work — restoration of the transaction’s prior database state, not reversal of unrelated external actions.

abandon uncommitted transactional work — restoration of the transaction’s database effects under its supported semantics.

returning within a defined reversible boundary — undoing a transaction or deployment, with scope that must be stated.

Read in context: 1.5.6, 8.4.6, 21.2.6, 49.5.6

Root

the starting guide — the top node from which every lookup begins.

Read in context: 16.1.6

Rotation

replacing active secret material — transitioning consumers to new authority under an explicit lifecycle.

Read in context: 47.5.6

Rounding

reporting a nearby value on a chosen scale; technically, mapping a value to a specified representable set under a tie-breaking rule.

Read in context: 4.4.6

Rounding policy

the chosen way to handle non-exact results; technically, the rule and stage used to select an allowed output value.

Read in context: 3.3.6

Row grain

what one row stands for — the unit of representation against which counts and aggregates must be interpreted.

what one row asserts — the identity and meaning that determine valid joins and constraints.

Read in context: 9.1.6, 51.2.6

Row group

a horizontal subset stored in column pieces — a unit connecting corresponding column chunks within a columnar file.

Read in context: 43.1.6

Row header

metadata around the visible field values — implementation information needed to locate, interpret or manage a stored row version.

Read in context: 27.3.6

Row width

the amount carried by one row representation — estimated or measured bytes per row at a specified physical or logical stage.

Read in context: 14.2.6

Row-level security

a filter or rule on individual rows — database policy enforcement beyond ordinary object privileges.

Read in context: 47.3.6

RPO

how much recent accepted work may be lost — a recovery-point requirement defined against a specified incident and acceptance boundary.

Read in context: 31.4.6

RTO

how long required service restoration may take — a recovery-time requirement with explicit start and completion events.

Read in context: 31.4.6

Run overlap

several files cover some of the same key range — a layout property affecting how many candidates a lookup may need to inspect.

Read in context: 29.3.6

Run-length encoding

storing repetitions as a value and count — an encoding effective when identical values are consecutive.

Read in context: 43.2.6

Runbook

a documented response path — observations, decisions, bounded actions and escalation conditions for an operational situation.

Read in context: 50.6.6

Runtime identity

the account serving ordinary work — the database or service identity used by the request-handling process.

Read in context: 47.2.6

Runtime provenance

which software actually produced the result — the recorded engine and interpreter versions and relevant configuration of an experiment.

Read in context: 27.6.6

S

Safety

prohibited outcomes never occur under the model — a property such as preserving a single committed command at each log position.

Read in context: 37.5.6

Safety property

a prohibited outcome never occurs — a correctness claim such as no duplicate accepted effect under the stated model.

Read in context: 52.4.6

Saga

a workflow of local transactions with recovery behaviour — a sequence whose partial completion is handled through continuation or compensation.

Read in context: 38.4.6

Sample standard deviation

the observed spread of a sample; technically, the square root of the sum of squared deviations from its mean divided by n - 1.

Read in context: 4.3.6

Sampling frame

the set from which observations can be selected; technically, the operational list or mechanism used to reach candidate sample units.

the cases available for selection — the actual population from which observations can be drawn.

Read in context: 4.5.6, 46.4.6

Sanitisation

rendering target media data infeasible to recover under a stated standard — a different layer from an empty application query.

Read in context: 48.3.6

Saturation

a limiting resource is at or near effective capacity — a condition in which additional demand tends to create waiting, rejection or deterioration rather than proportional useful work.

demand meeting a limiting resource — a condition producing increased waiting, rejection or reduced useful throughput.

Read in context: 20.3.6, 50.4.6

Savepoint

a local return point inside transaction work — a named boundary to which later transactional changes can be rolled back.

Read in context: 21.5.6

Scale

what one stored step represents; here, the fixed relationship between an integer amount and its displayed unit.

Read in context: 3.2.6

Scan

visit data through an access path — sequential or otherwise structured traversal of records or index entries to produce candidates.

Read in context: 14.1.6

Scatter-gather

ask several pieces and combine their replies — a distributed query pattern with completeness and coordination requirements.

Read in context: 35.5.6

Schedule evidence

the recorded sequence that actually ran — observations of operations, waits, errors and outcomes under a stated concurrency configuration.

Read in context: 22.1.6

Schema

the declared structure; technically, a definition of fields, types, relationships and applicable structural rules.

Read in context: 2.2.6

Schema boundary

what the declared database model does and does not enforce — the limit beyond which application workflow or other mechanisms remain necessary.

Read in context: 9.6.6

Schema design

the plan for organising records and their rules — a model of structures, domains, relationships and invariants implemented by a database and its surrounding system.

Read in context: 10.1.6

Schema migration

a controlled change to database structure or representation — a transition requiring data compatibility, verification and a defined failure disposition.

Read in context: 11.6.6

Schema version

which contract applies; technically, an identifier for a defined revision of the schema and its interpretation.

the named edition of a record contract — an identifier for the supported structure and meaning, distinct from a software release.

Read in context: 2.2.6, 7.4.6

Scope boundary

where the guarantee applies — the trusted helper, tenant, database and supported operations included in the claim.

Read in context: 51.1.6

Scoped guarantee

a promise with explicit limits — a correctness claim tied to defined effects, participants, failures and retention assumptions.

Read in context: 26.6.6

Scoped key

an identifier plus its domain — a composite identity such as tenant_id and order_id.

Read in context: 47.4.6

Search invariant

the condition kept true at every step — the target, if present, remains inside the selected subtree’s permitted range.

Read in context: 16.3.6

Secondary index

an additional searchable organisation — an access path distinct from the primary physical or identifying organisation of the table.

Read in context: 15.1.6

Secret

protected capability-bearing information — a credential or key requiring controlled disclosure and use.

Read in context: 47.5.6

Select list

the values requested for each output row — the column references or expressions following SELECT.

Read in context: 12.1.6

SELECT statement

a description of an answer to read — a SQL query specifying output expressions and the operations needed to define a result.

Read in context: 12.1.6

Selection bias

the selection process distorting the intended picture; technically, systematic differences caused by how observations enter the analysed sample relative to the target population.

the observed group systematically differs from the target — distortion caused by how cases enter or remain in the dataset.

Read in context: 4.5.6, 46.4.6

Selectivity

the fraction that passes a condition — qualifying rows divided by a stated candidate population, either estimated or observed.

Read in context: 14.5.6

Semantic compatibility

preserving meaning across versions — agreement about units and interpretation, not only accepted syntax.

Read in context: 49.1.6

Semantic reversal

restoring an intended business condition — an operation whose meaning is not necessarily identical to restoring old storage bytes.

Read in context: 38.4.6

Semantics

what a representation means; technically, the interpretation and permitted consequences assigned to it.

Read in context: 2.1.6

Sensitivity bound

a range under alternative assumptions — an explicit calculation showing how unknown information could change a conclusion.

Read in context: 46.3.6

Sentinel entity

a special record used to stand for a designated case — a modelling choice that must not fabricate identity or conceal unknown meaning.

Read in context: 9.5.6

Separator key

a boundary directing the next step — an internal key dividing ordered child ranges under a defined comparison convention.

Read in context: 16.1.6

Sequence gap

an expected predecessor is missing — a discontinuity that prevents this strict projector from claiming a complete prefix.

Read in context: 6.3.6

Sequencer

evidence describing a lock generation — a token that a recipient validates before accepting a protected operation.

Read in context: 34.4.6

Sequential consistency

one shared order respects each client’s own order — a model that does not additionally require all cross-client real-time precedence.

Read in context: 36.1.6

Serializability

concurrent work has a valid serial explanation — equivalence of committed transaction effects to an execution in some serial order.

Read in context: 23.5.6

Serializable outcome

a result explainable by a legal one-at-a-time execution — an outcome equivalent to some serial order of the participating transactions.

Read in context: 23.4.6

Serialization failure

a transaction is refused to preserve the isolation guarantee — an error requiring an appropriate full-operation retry or failure response.

Read in context: 23.5.6

Serverless, in SQLite

no separate database server is required — SQLite’s embedded-engine meaning, distinct from some cloud-service uses of the word.

Read in context: 8.3.6

Service-level indicator

a measured service outcome — a defined quantity such as the fraction of eligible requests meeting a correctness and latency condition.

a measured service property — a defined observation of availability, latency, correctness or another relevant outcome.

Read in context: 36.2.6, 50.1.6

Service-level objective

the target for an indicator — a specified level over a stated population and window.

Read in context: 50.1.6

Session window

a group linked by activity gaps — a window that may merge when an arriving event connects earlier groups.

Read in context: 41.3.6

Shard

an independently placed portion of data — commonly a partition hosted on a separate storage node or database, with product-specific semantics.

Read in context: 35.1.6

Shared guard record

one coordination point for a shared limit — a record whose guarded mutation serializes changes to the represented resource.

Read in context: 22.5.6

Side effect

an action beyond calculating the returned value — an external change that must not accidentally be repeated during reconstruction.

Read in context: 6.4.6

Significant figures

the digits deliberately retained in reporting; technically, a numerical presentation convention that does not alone specify a full uncertainty model.

Read in context: 4.4.6

Single-key contention

many operations compete on one identity — a workload limitation that ordinary redistribution of unrelated keys cannot remove.

Read in context: 35.3.6

Skew

some values occur much more often than others — a non-uniform distribution that can concentrate work and invalidate uniform assumptions.

an uneven distribution — concentration in key frequency, record size, cost or request rate.

Read in context: 14.5.6, 35.3.6

Skipped check

a check not executed under current conditions — neither a pass nor proof of failure of the underlying feature.

Read in context: 52.5.6

Sliding window

overlapping intervals — windows whose width exceeds their step, allowing one event to contribute to multiple results.

Read in context: 41.3.6

Sloppy quorum

substitute reachable nodes may count — a failure-handling scheme that differs from always using one fixed replica set.

Read in context: 36.5.6

Slot entry

a small reference locating an item within a page — metadata mapping an item identifier to its stored position and length.

Read in context: 27.1.6

Slowly changing dimension

a policy for evolving descriptions — a modelling approach that may overwrite attributes or preserve dated versions.

Read in context: 42.2.6

Snapshot

a saved position at a known boundary — a serialised state with enough metadata to resume a compatible interpretation.

Read in context: 6.4.6

Snapshot establishment

the event that chooses the view — the implementation-defined point at which a transaction’s snapshot is acquired.

Read in context: 23.2.6

Snapshot-to-stream handover

joining the initial copy to later changes — a protocol preventing gaps and managing overlap at a capture boundary.

Read in context: 40.3.6

Snippet

a displayed excerpt from a result — contextual text that requires source attribution and safe rendering.

Read in context: 44.5.6

Sort key

the values deciding order — the ordered sequence of expressions and comparison rules used to arrange records.

Read in context: 14.3.6

Sorted run

one already ordered batch — an intermediate sequence used by an external merge process.

a sequence already ordered by its search key — a file or logical collection that can be searched and merged using key order.

Read in context: 14.4.6, 29.1.6

Space amplification

physical footprint exceeds live logical data — a ratio whose scope includes the selected files, versions and temporary maintenance state.

Read in context: 29.6.6

Speculative suffix

entries not yet accepted as committed — a local log continuation that may be replaced under valid recovery rules.

Read in context: 37.4.6

Spill

working data moved out of the operation’s memory allowance — temporary external storage used to continue an operation such as sorting or hashing.

Read in context: 14.4.6

Split

revising an association into distinct entities; technically, a correction of mapping relationships whose downstream effects may require separate repair.

Read in context: 5.6.6

Split propagation

a full parent also needs room — upward restructuring triggered when adding a child exceeds an internal node’s capacity.

Read in context: 16.4.6

SQL

a language for working with data; technically, Structured Query Language and its standardised and product-specific features.

Read in context: 1.3.6

SQL expression

a rule for calculating an output value — a combination of column references, literals, operators or functions evaluated under engine semantics.

Read in context: 12.4.6

Stale client copy

an earlier result still held outside the database — data whose original read validity does not guarantee current edit validity.

Read in context: 25.2.6

Stale read

an observation that no longer describes the relevant current state — a previously read version that may be unsafe as an unconditional write basis.

an answer lacks required newer information — a read that does not meet the application’s freshness or consistency contract.

Read in context: 22.2.6, 33.4.6

Stale refill

an old in-flight result repopulates a cache — a race occurring after an update or invalidation unless the fill protocol prevents it.

Read in context: 39.2.6

Stale request

a request based on an older position — an operation whose assumed version no longer matches the accepted state.

Read in context: 6.2.6

Standard uncertainty

uncertainty expressed like a standard deviation; technically, measurement uncertainty expressed as a standard deviation under the stated model.

Read in context: 4.6.6

Standardization

applying a common comparison population — reweighting subgroup results under explicitly chosen weights.

Read in context: 46.2.6

Startup cost

estimated work before the first result — a planner quantity relevant to operations that must prepare or consume input before emitting rows.

Read in context: 18.4.6

State

the position the model currently holds — a representation at a defined logical boundary.

Read in context: 6.1.6

State checkpoint

a recoverable state boundary — a saved representation coordinated with the progress and effects it claims.

Read in context: 41.6.6

State transition

an allowed move between positions — a specified change from one model state to another.

one defined move from an old state to a new state — an operation with explicit preconditions, writes and outcomes.

Read in context: 6.2.6, 26.1.6

Statement rollback

undoing effects of one failed statement — a failure response distinct from abandoning all earlier work in the active transaction.

Read in context: 11.6.6

Statement snapshot

a view chosen for one statement — the visibility boundary used by a query under statement-level snapshot rules.

Read in context: 23.2.6

Statistical unit

the entity providing an observation — the request, person, item or time unit whose independence and weighting need definition.

Read in context: 46.6.6

Steady state

workload and maintenance remain sustainable together — an operating regime without unbounded growth of deferred work under the stated conditions.

Read in context: 29.6.6

Stock adjustment

an explicit change to the expected stock record — a domain operation distinct from a goods movement or a count observation.

Read in context: 6.1.6

Storage observation

a measured fact about one physical configuration — metadata or instrumentation interpreted with version, scope and timing.

Read in context: 27.6.6

Storage type

the engine’s representation category; technically, a supported type or storage class with documented operations and limits.

the kind of value an engine stores in a field — an implementation-level representation with defined conversion and operation rules.

Read in context: 3.1.6, 10.4.6

Store inventory

the declared destinations to address — an explicit set whose completeness must be assessed, not assumed.

Read in context: 48.3.6

Stream

an ongoing supply of records — input processed as a continuing sequence rather than only as a completed finite batch.

Read in context: 41.1.6

Stream sequence

a record’s position in one accepted history — a scoped ordering value used for interpretation or concurrency checks.

Read in context: 6.3.6

Structural integrity check

inspect engine representation rules — a diagnostic procedure for covered page, tree or table/index invariants.

Read in context: 32.3.6

Structural validation

check that the representation obeys its rules — inspection of ordering, ranges, links, occupancy and depth invariants.

Read in context: 16.6.6

Success boundary

the event a positive response promises has occurred — the precise acceptance or persistence condition represented to the caller.

Read in context: 30.1.6

Successor link

the route to the next ordered region — a reference or traversal mechanism connecting neighbouring entries or leaf nodes.

Read in context: 16.5.6

Surrogate key

an extra identifier created for the record; technically, a key whose principal role is row identity rather than existing business meaning.

Read in context: 5.2.6

Symptom

what was observed — a result needing explanation, not an already-proven cause.

Read in context: 52.3.6

Synchronous acknowledgement

success waits for specified remote progress — a policy whose exact receipt, flush or apply condition must be named.

Read in context: 33.3.6

Syntactic validity

being written in the right shape — conformance to a format’s grammar, distinct from business rules.

Read in context: 7.2.6

Syntax

the shape of a representation; technically, the grammar used to recognise valid constructions.

Read in context: 2.1.6

System metadata

information the engine stores about its own objects — structural descriptions exposed through catalogues or metadata interfaces.

Read in context: 10.5.6

T

Table

a collection of records with a declared shape — a managed SQL structure whose columns and constraints give rows a defined interpretation.

Read in context: 9.1.6

Table snapshot

a coherent table version — metadata selecting the files and interpretation visible to a reader.

Read in context: 42.4.6

Tail latency

the unusually slow end of the distribution — high-percentile delays whose meaning depends on the measured population and sample size.

Read in context: 20.2.6

Tare mass

the packaging amount taken away; technically, the measured or assigned container mass used in a net-mass calculation.

Read in context: 4.1.6

Target cardinality

how many records an operation is intended to affect — a result-scope requirement distinct from whether each resulting row is structurally valid.

Read in context: 12.5.6

Target population

everything the question is meant to describe; technically, the defined set of units about which an inference or descriptive claim is intended.

Read in context: 4.5.6

Temporal interpretation

which point or period a value describes — the time-related meaning that distinguishes a current attribute from a historical observation or agreement.

Read in context: 10.2.6

Tenant

one separately scoped customer organisation — an isolation domain within a service that may share infrastructure.

Read in context: 47.4.6

Tenant scope

the customer boundary in a shared service; technically, the domain boundary used to associate records and permitted operations with a tenant, requiring access control beyond identification.

Read in context: 5.3.6

Term

a protocol generation for leadership attempts — a monotonically advancing counter used to reject obsolete authority and compare log histories.

Read in context: 37.2.6

Test fixture

the controlled input state — synthetic or appropriately authorised data used for a specified check.

Read in context: 52.5.6

Text literal

text written as a value in a statement — a quoted string such as 'O-1042', distinct from a column identifier.

Read in context: 12.1.6

Theoretical availability

required requests eventually complete — a liveness property under a stated distributed-system model.

Read in context: 36.2.6

Three-valued logic

reasoning with true, false and unknown — SQL expression semantics needed when operands can be NULL.

Read in context: 12.2.6

Throughput

completed work per unit time — a rate whose counted operation and success condition must be defined.

Read in context: 20.3.6

Tie-break

a rule ordering equal-scored results — a deterministic convention that does not itself establish relevance.

Read in context: 44.4.6

Tie-breaker

an additional rule for equal primary sort values — a subsequent sort expression used to distinguish otherwise tied rows.

an extra rule for equal first choices — additional ordering attributes that distinguish otherwise tied results.

an additional ordering key — a rule making otherwise tied results deterministic where required.

Read in context: 12.3.6, 14.3.6, 52.2.6

Time bucket

the period a record contributes to — a reporting interval defined by clock semantics, timezone and boundary rules.

Read in context: 19.4.6

Time to live

an entry’s configured remaining lifetime — an expiry policy that does not by itself prove source-data age.

Read in context: 39.2.6

Tokenisation

splitting text into searchable units — applying a specified segmentation rule to content and queries.

Read in context: 44.2.6

Tombstone

a newer marker hiding an older value — a deletion record retained until older visible copies and snapshot requirements permit removal.

Read in context: 29.5.6

Top-N

keep the requested best few — an optimisation that retains a bounded candidate set under an ordering, without necessarily avoiding a full input scan.

Read in context: 14.3.6

Torn page

only part of a page update survives — a mixed old/new physical page caused by an interrupted multi-part write.

Read in context: 30.4.6

Trace

connected steps of an operation — spans and context describing work across a request path.

Read in context: 50.2.6

Traceability matrix

a record showing how a requirement is addressed — a mapping among assumptions, representation, enforcement, tests and remaining gaps.

Read in context: 10.6.6

Transaction

a controlled unit of database work; technically, operations managed together under an engine’s atomicity and related semantics.

a defined group of database work — a unit with a controlled commit or rollback boundary.

Read in context: 1.5.6, 8.4.6

Transaction boundary

the work accepted or rejected together — the scope of a database transaction’s reads, writes and completion decision.

Read in context: 21.1.6

Transaction owner

the code responsible for completion — the layer that controls commit and rollback for a defined unit of work.

Read in context: 21.1.6

Transaction ownership

responsibility for starting and ending a transaction — a contract defining which component may commit, roll back or leave the connection active.

responsibility for completion — the component entitled to commit or roll back the particular unit of work.

Read in context: 11.5.6, 51.2.6

Transaction rollback

abandoning a transaction’s pending changes — an explicit or engine-triggered reversal within that transaction’s defined scope.

Read in context: 11.6.6

Transaction snapshot

a retained view for related statements — a visibility boundary reused through a transaction under the chosen implementation.

Read in context: 23.2.6

Transformation precondition

what must be true before changing a row — the provenance, version or state justifying the operation.

Read in context: 49.3.6

Transformation version

identify the calculation rules used — a versioned definition of parsing, filtering, joining and aggregation semantics.

which processing rule was used — an identifier binding output to a particular implementation and its parameters.

Read in context: 19.6.6, 40.1.6

Tree height

how many levels a lookup crosses — the root-to-leaf depth under a stated counting convention.

Read in context: 16.2.6

Trigger

the rule deciding when to publish — a condition for emitting a window result or pane.

Read in context: 41.5.6

Truncation

an input ending before its promised content is complete — insufficient bytes to satisfy a declared structure or length.

Read in context: 7.2.6

Trusted expected digest

an integrity reference with justified provenance — a digest bound to an intended artifact through a trusted source or process.

Read in context: 32.2.6

Tuple

one same-shaped collection of attribute values — a row-like element of a relation in the relational model.

Read in context: 9.1.6

Two-phase commit

prepare followed by a final decision — an atomic-commit protocol across participating transactional resources.

Read in context: 38.2.6

Type

the kind of value; technically, a classification that governs representation and permitted or defined operations.

Read in context: 3.1.6

U

Unbounded input

no known final record — a collection whose completion is not generally available during normal operation.

Read in context: 41.1.6

Uncertainty budget

the explanation behind the uncertainty figure; technically, a statement of contributing uncertainty components, their evaluation and their combination in the measurement model.

Read in context: 4.6.6

Undo information

evidence for reversing unaccepted changes — recovery data used by designs that require explicit restoration of earlier state.

Read in context: 28.5.6

Uniform model

assume every output is equally likely — a mathematical distribution assumption whose applicability must be justified separately.

Read in context: 17.5.6

Unique constraint

a rule against repeated key values; technically, database enforcement that the relevant value combination cannot appear in conflicting rows under its null and comparison rules.

a prohibition on repeated constrained values — an invariant over one column or a composite value under the engine’s comparison and NULL rules.

Read in context: 5.2.6, 11.2.6

Unit

the agreed size of a numerical step; technically, a reference quantity used to express values of quantities of the same kind.

Read in context: 4.2.6

Unknown field

a member the contract does not recognise — data requiring an explicit reject, ignore, preserve or extension policy.

Read in context: 7.4.6

Unknown outcome

the caller lacks reliable completion evidence — a state in which a request may have committed even though its response was not received.

the caller lacks enough evidence to classify completion — a state distinct from confirmed success or confirmed rollback.

Read in context: 22.6.6, 34.5.6

Unknown result

a comparison that cannot be classified as true or false from the supplied values — the third truth outcome commonly produced by SQL expressions involving NULL.

Read in context: 11.1.6

UPDATE

changing values on selected records — a SQL write operation applying assignments to rows matching its predicate.

Read in context: 12.5.6

Update anomaly

one correction leaves conflicting copies — a state inconsistency caused by storing a dependent fact in multiple independently editable rows.

Read in context: 13.1.6

User-space buffer

data waiting inside the program or library — memory used to batch output before passing it to the operating system.

Read in context: 30.2.6

UTC offset

the difference from UTC in a representation; technically, a signed hours-and-minutes offset, not a complete named-zone rule set.

Read in context: 3.5.6

UUID

a standardised large identifier; technically, a 128-bit identifier whose version and variant determine the interpretation and generation rules.

Read in context: 5.2.6

V

Vacuuming

maintenance that reclaims and manages old storage — PostgreSQL’s process for handling obsolete tuples and other required maintenance tasks.

Read in context: 25.3.6

Validation

checking the stated rules; here, testing whether a representation meets declared structural or domain requirements.

Read in context: 1.2.6

Validation boundary

the exact state a check describes — its database, snapshot or time, schema and input scope.

Read in context: 49.4.6

Vectorized execution

processing batches of values together — an implementation approach reducing overhead and exploiting suitable data layout.

Read in context: 43.6.6

Verification scope

what a check could actually observe — the stores, identities, versions and authority included in the observation.

Read in context: 48.6.6

Version column

a field naming the accepted edit state — an application-managed revision value checked and advanced by relevant writes.

Read in context: 25.4.6

Version register

the declared implementation/document context — a record distinguishing documented versions from the runtime actually tested.

Read in context: 52.6.6

Visible sequence limit

the newest version a snapshot may use — a model or engine boundary excluding later updates from that reader.

Read in context: 29.3.6

Visible version

the row state allowed by a reader’s snapshot — a version satisfying the engine’s transaction-visibility rules.

Read in context: 25.2.6

Volatile write cache

acknowledged data still depends on power — intermediate storage that can lose pending writes when its power disappears.

Read in context: 30.4.6

Voting restriction

a rule limiting acceptable leadership promises — eligibility and one-vote-per-term conditions that help preserve committed history.

Read in context: 37.3.6

W

Wait-for graph

a map of who waits for whom — a directed graph used to reason about resource dependencies.

Read in context: 24.3.6

Warm state

earlier work remains useful — cached data or prepared resources available to later operations under a specified scope.

Read in context: 20.4.6

Watermark

a statement of event-time progress — a source- and framework-dependent frontier used for window and timer decisions.

Read in context: 41.4.6

Weighted mean

larger contributions receive proportionate influence — the sum of value-times-weight divided by total valid weight.

Read in context: 19.2.6

WHERE predicate

the condition deciding which source rows qualify — a Boolean-like SQL expression for which only true rows are retained by the filter.

Read in context: 12.2.6

Wilson interval

a binomial-proportion interval — a score-based method whose limits remain within the valid probability range.

Read in context: 46.6.6

Window

a defined group of time-related records — a membership rule used to bound aggregation over a stream.

Read in context: 41.3.6

Window frame

the contributing region for one current row — a bounded subset of its partition under ROWS, RANGE or another supported frame mode.

Read in context: 19.3.6

Window function

calculate across related rows without collapsing each one — an SQL function evaluated over a partition and, where applicable, an ordered frame.

Read in context: 19.3.6

Workflow

the steps around completing a piece of work — a sequence of operations, decisions and failure paths with defined state transitions.

Read in context: 10.1.6

Workflow state

the recorded stage and evidence of a process — durable information used to resume or reconcile a multi-step operation.

Read in context: 38.5.6

Workload

the work the system must actually handle — a defined mixture of reads, writes, sizes, timing and contention.

Read in context: 8.6.6

Workload envelope

the conditions a design was evaluated for — declared ranges of size, skew, query mix, concurrency and service requirements.

Read in context: 15.5.6

Workload mix

the combination of operations a system serves — their frequencies, parameters, sizes, concurrency and correctness requirements.

Read in context: 15.2.6

Workload specification

a description of the actual work — volumes, distributions, query patterns and operating requirements used to evaluate a design.

Read in context: 42.6.6

Write amplification

extra work caused by one logical change — a ratio of physical or internal writes to a clearly defined logical write baseline.

storage writes exceed logical input — a measured ratio of bytes written at a named layer to logical bytes accepted over a stated interval.

Read in context: 15.2.6, 29.1.6

Write path

a route through which information can change — an application, import, job or administrative mechanism capable of mutating stored state.

Read in context: 10.1.6

Write skew

separate writes jointly break a shared rule — an anomaly in which transactions act on overlapping read conditions while changing different records.

Read in context: 23.4.6

Write-ahead ordering

recovery evidence must precede dependent data persistence — the ordering constraint linking log durability and data-page writes.

Read in context: 28.2.6

Wrong-scope mutation

a valid change applied to the wrong set of records — an operation whose predicate does not express the intended target boundary.

Read in context: 12.5.6

Z

Zone map

summary bounds for a data region — metadata such as minimum and maximum used for conservative elimination.

Read in context: 43.5.6