In-memory: More details

- I want to do a little review…just so you won't get lost…when we go in and talk about indexing.…And what I have up here is a nonclustered index.…On the top, above the orange line,…I have the B tree, or the balanced tree,…so called because as information is inserted into an index,…so you're adding rows,…then the tree, when it needs to,…will split in a balanced way…so that here you see one drops down to two.…

And then if that tree needed to split, it would square,…so we would have four, two below the left…and two below the right, etc., etc.,…which real quick, by the way,…is the reason not to have a lot of nonclustered indexes…laying around that you don't use…because they take up room.…Okay, so there's the balanced, or the B tree,…part of the index, and if we point down…below the orange line, you're at the leaf level.…Now, the leaf level contains pointers to the actual data,…whereas the B tree is a way of getting you…down to the leaf level below.…

Just think of it as splitting the middle every time…between so and so, between so and so,…