Database - What are B-trees?

What are B-trees?

- A method of placing and locating files (called records or keys) in a database is known as a B-Tree.
- The number of times a medium must be accessed to locate a desired record, thereby speeding up the process is minimized by the B-tree algorithm.

Uses of a B-tree in databases:

1. The keys are kept in sorted order for sequential traversing
2. A hierarchical index is used to minimize the number of disk reads
3. Partially full blocks are used to speed insertions and deletions
4. Keep the index balanced with an elegant recursive algorithm

- A B-tree also minimizes the waste by making sure that the interior nodes are at least half full.
- An arbitrary number of insertions and deletions can be handled by a B-tree.
Database - Explain Table Scan and Index Scan
Database Table Scan and Index Scan.....
Database - Describe FillFactor concept in indexes
Describe FillFactor concept in indexes....
Database - What are Index statistics?
Database index statistics.....
Post your comment
Discussion Board
A B-tree is a method of placing and locating files (called record and keys) in a database.
Manjushree k 07-4-2014