
Designing Data-Intensive Applications – To B-Tree or not to B-Tree
Coding Blocks
00:00
The Clustered Index and the Clustering of the Indexes in a Bee Tree
The clustered index is essentially your table, this being stored. Whereas non clustered indexes are pointers to those rows from that main table. So even with ta regular index, as you insert things, if that index had to be alphabetical, we'll say it's going to have to keep that index to date so that it knowsit has to know where to point things,. It will sort that stuff appropriately as well. And th that's part of the where i was trying to describe where the shuffling would occur in the bee tree. Once you find that that key on a leaf note in the ges, when you update that value, basically you just overwriding the entire block.
Play episode from 33:26
Transcript



