B-Tree Descent
A three-level B-tree with a probe line that steps root to internal to leaf, each chosen node latching accent as the descent reaches it.
A three-level B-tree with a probe line that steps root to internal to leaf, each chosen node latching accent as the descent reaches it.
Two candidate bitmaps set their bits left to right in turn and the result row below fills with only the positions that were lit in both.
The leading columns of a composite key match and fill left to right, pausing on the segment boundary, then stop at the column the predicate cannot use.
A query drops into the index, the covered columns fill left to right and the answer leaves along the same line while the heap page below is never touched.
A key runs the rail into a hash box, the route draws to the bucket it hashed to and that bucket's overflow chain extends by one more cell.
An index entry latches, the arm draws across to the heap slot its pointer names, and the row travels back along the arm to the index where it rests.
Leaf pages rest packed to an even fill, drift back to uneven as writes land, and a rebuild head sweeps down the stack leaving every page level behind it.
One row lands on the table and is carried out along each spoke in turn, every secondary index latching as the write reaches it before the row returns.
A row of leaf pages joined by sibling links, with a range window stepping left to right one leaf at a time and the walk line drawing through each leaf it crosses.
A ring of hash slots with a probe pointer stepping clockwise past each occupied slot, which flashes as it is read, until it settles on a free slot that latches.
Two candidate plans hold cost columns against a cost rule, the estimates are redrawn so the columns cross over, and the selection bracket slides to whichever plan came in cheaper.
A refresh sweep crosses the frame and the chosen join operator swaps from the nested-loop glyph to the hash-join glyph, and the next sweep swaps it back.
An operator tree costs out from the leaves upward, each node ticking as it is estimated, and the branch that came in cheapest draws itself in as the winning path to the root.
Two page rails run the same query: the upper rail sweeps a head across every page and fills a read bar behind it while the lower rail marks only the three pages a seek touches.
A column histogram is resampled left to right into a new distribution and the selectivity marker slides to the new estimate before the sample returns.