b-tree is a balanced (! binary) tree

better than binary search tree (or red-black) for the purpose of disk-access. need to minimize disk reads.

Obviously u want to cover as much “data” in one disk-read as possible. Perhaps as a result, each node contains thousands (t-1) of keys i.e. t-1 RowIDs

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s