Chapter 16, Problem 16E

Program Plan Intro

B+- Tree Index:

The B+ tree index is used for speeding up retrieval of data. It is a pointer to data.

Following the pointer chains, the value is either found or not found.

• The data pointers point to the leaf nodes. A leaf node has an additional pointer.
• Each node is filled at least half except the root node. It must have two entries minimum.
• Searching of a value starts at the root node and follows pointer chains till it does not reach a leaf node.
• The leaf nodes and internal nodes have key values which are used for searching for entries in the index.
• The tree is balanced because each path from the root node to the leaf node is similar in length. The same number of nodes are needed for each search.