About this document
Understanding B-Trees in DBMS by aankurkhanna is a document available to read on EtoBox.
B-trees are a commonly used index structure that are non-sequential and balanced. They adapt well to insertions and deletions by maintaining balance. B-trees consist of blocks holding keys and pointers, with blocks containing at least half the maximum number of keys and pointers. B-trees provide efficient access to records by supporting range queries and requiring only a few disk I/Os to retrieve a record.
- Author
- aankurkhanna
- Language
- EN