What is B-Tree ?

  • B-Tree  is a data structure which holds the organized data in a organized tree manner.
  • B-Tree contains the
    •  Root node
    •  Intermediate Nodes
    • Leaf Nodes(where actual data might be linked/present).
    • Index Key:
      • Index key is a key that contains the location specific of the data selected in the table.
      • Index keys present at the leaf node map to the actual data in a non-clustered index.
      • But for a clustered index data is present at the leaf node itself hence intermediate index keys map to the leaf node where data is stored.
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