This shows you the differences between two versions of the page.

b-tree [2015/08/01 00:57] will created |
b-tree [2015/08/11 22:17] will |
||
---|---|---|---|

Line 1: | Line 1: | ||

====== B-tree ====== | ====== B-tree ====== | ||

+ | |||

+ | A B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123). Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. B-trees are a good example of a data structure for external memory. It is commonly used in databases and filesystems. | ||

+ | |||

+ | [[https://en.wikipedia.org/wiki/B-tree]] | ||

[algorithm b-tree] | [algorithm b-tree] |

b-tree.txt ยท Last modified: 2015/08/11 22:17 by will