Analytics Store Broadcast Versus Shuffle
A small table broadcasts down three straight links and lands a copy in each worker, then the links erase and the exchange mesh between the workers draws in their place.
A small table broadcasts down three straight links and lands a copy in each worker, then the links erase and the exchange mesh between the workers draws in their place.
Scattered key marks across ten micro-partitions give way to a monotone staircase, and the accent scan range collapses from the whole block to three neighbouring partitions.
A grid of storage cells holds cold while a single projected column is read downward in accent and a bytes-read gauge beside it extends only as far as that one column.
Nine ragged small files accumulate along the left axis, then slide right and fold into three full-width compacted files that land in accent.
A column of eight wide repeated values shrinks to eight narrow code stubs while the three-entry dictionary that replaced them builds along the strip beneath.
A record lands three partitions behind the head, and the old partition lifts out of line, is rewritten end to end by an accent wipe and settles back.
A predicate chip crosses the partition rail and every partition it clears goes dark, leaving two accent survivors before a byte is read.
Five row-major stripes retract to the left axis and eight column-major stripes grow down in their place, the same block re-shelved from rows to columns.
A strip of sixteen equal cells goes faint left to right as four accent run bars of five, three, six and two take their place beneath it.
A scanned-bytes bar runs the full width of the frame while the returned-bytes bar beneath it reaches a seventh of the same length, holding the gap that the query is billed for.
A working-memory tier fills past its dashed threshold, the excess drains as accent into the disk tier below, and the level recovers under the line.
On a timeline of base writes the accent staleness band widens behind a moving head, then the refresh marker fires and the window snaps shut to nothing.
A base table takes a new row, the materialised view beside it empties to a bare frame, then a refresh wipe repaints it solid and absorbs the change.
The request draws along the short upper route, the cache block lights as the head reaches it and the answer lands at the far node, while the lower route across five storage blocks is never scanned.
Five blocks each carry a min/max bracket and the query rule moves between two values, opening only the blocks whose range contains it and leaving the rest closed.