[工学]数据结构java版6.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Inserting a Key into a B-Tree (continued) Figure 7-8 Building a B-tree of order 5 with the BTreeInsert() algorithm Inserting a Key into a B-Tree (continued) Figure 7-8 Building a B-tree of order 5 with the BTreeInsert() algorithm (continued) Inserting a Key into a B-Tree (continued) Figure 7-8 Building a B-tree of order 5 with the BTreeInsert() algorithm (continued) Deleting a Key from a B-Tree Avoid allowing any node to be less than half full after a deletion In deletion, there are two main cases: Deleting a key from a leaf Deleting a key from a nonleaf node Deleting a Key from a B-Tree (continued) Figure 7-9 Deleting keys from a B-tree Deleting a Key from a B-Tree (continued) Figure 7-9 Deleting keys from a B-tree (continued) Deleting a Key from a B-Tree (continued) Figure 7-9 Deleting keys from a B-tree (continued) B+-Trees References to data are made only from the leaves The internal nodes of a B+-tree are indexes for fast access of data; this part of the tree is called an index set The leaves are usually linked sequentially to form a sequence set so that scanning this list of leaves results in data given in ascending order B+-Trees (continued) Figure 7-13 An attempt to insert the number 6 into the first  leaf of a B+-tree B+-Trees (continued) Figure 7-14 Actions after deleting the number 6 from the  B+-tree in Figure 7.13b B+-Trees B＋树是应文件系统所需而出的一种B-树的变型树。一棵m阶的B＋树和m阶的B-树的差异在于： 有n棵子树的结点中含有n个关键字。 所有的叶子结点中包含了全部关键字的信息，及指向含这些关键字记录的指针，且叶子结点本身依关键字的大小自小而大顺序链接。 所有的非终端结点可以看成是索引部分，结点中仅含其子树（根结点）中的最大（或最小）关键字。 通常在B＋树上有两个头指针，一个指向根结点，一个指向关键字最小的叶子结点。 * B+-Trees * B*-Trees In a B*-tree, all nodes except the root are required to be at least two-thirds full, not just half full as in a B-tree The frequency of node splitting is decreased by delaying