B-Tree advantage

• B-Trees take advantage of this by maintaining a balanced binary tree structure through the use of two files:

  • index file: contains all the keys and the tree's topology is represented by the organization of data in this file.
  • data file: a file that contains all the objects and information stored by the “tree”. Objects contained here are referenced by block pointer references stored in the index file.