B -Tree Index Files

1. Primary disadvantage of index-sequential file organization is that performance degrades as the file grows. This can be remedied by costly re-organizations.
2. B -tree file structure maintains its efficiency despite frequent insertions and deletions. It imposes some acceptable update and space overheads.
3. A B -tree index is a balanced tree in which every path from the root to a leaf is of the same length.
4. Each nonleaf node in the tree must have between and n children, where n is fixed for a particular tree.

• Structure of a B -Tree
• Queries on B -Trees
• Updates on B -Trees
• B -Tree File Organization