The Most Common Index in Relational Data Bases

Bee trees are the fundamental in extrating stratagy used in relational data bases. These bee trees also store key value pairs sorted by the key. And this make these range look ups fast, right ly. One could be one meg one could be ten megs. It's just basically where they started chopping them up. I am going to be curious, as we'll find out a little bit later in this chapter, if that continues to be the thing with the differences between ss tes and spinding desks.