B+Trees
From
(Difference between revisions)
(Created page with 'The variation of a B-Tree that is most often implemented in the B+ Tree. In this tree, internal nodes store only keys and all the data is stored in the leaves. The keys are simpl...') |
|||
| Line 1: | Line 1: | ||
The variation of a B-Tree that is most often implemented in the B+ Tree. In this tree, internal nodes store only keys and all the data is stored in the leaves. The keys are simply “sign posts” to direct a search to the proper leaf. In addition, nodes have sibling pointers, so that the nodes at each level form a linked list. | The variation of a B-Tree that is most often implemented in the B+ Tree. In this tree, internal nodes store only keys and all the data is stored in the leaves. The keys are simply “sign posts” to direct a search to the proper leaf. In addition, nodes have sibling pointers, so that the nodes at each level form a linked list. | ||
| - | + | <br/><br/> | |
While B-Trees have many uses, a common use is to implement the directory structure of an operating system’s file system using B-Trees. The key idea is that one node of the tree is the same size as a disk block. | While B-Trees have many uses, a common use is to implement the directory structure of an operating system’s file system using B-Trees. The key idea is that one node of the tree is the same size as a disk block. | ||
| + | <br/><br/> | ||
Revision as of 18:05, 28 March 2009
The variation of a B-Tree that is most often implemented in the B+ Tree. In this tree, internal nodes store only keys and all the data is stored in the leaves. The keys are simply “sign posts” to direct a search to the proper leaf. In addition, nodes have sibling pointers, so that the nodes at each level form a linked list.
While B-Trees have many uses, a common use is to implement the directory structure of an operating system’s file system using B-Trees. The key idea is that one node of the tree is the same size as a disk block.
