other

B-link tree

Variant of the B-tree introduced by Philip Lehman and S. Bing Yao in 1981, in which each page holds a link to its right sibling and a high key so that readers can traverse a concurrently splitting tree without lock coupling.

Known aliases

B-Link Tree
Lehman & Yao B-Link Tree

Relationships

No evidence-backed relationships are recorded.

Current clusters

build1 publisher

Postgres skips the fresh status index when 45,120 of 100,000 rows match the filter

A dev.to walkthrough shows a new index on orders(status) skipped for a sequential scan. The plan's own numbers say the planner priced it correctly, because nearly half the 100,000 rows match the filter.

Publishers:dev.to

Reality

Evidence52
Adoption: Insufficient
Hype gap+12
Incentives30
Confidence55