关于树索引结构.ppt

The B-Tree Index Prof. Sin-Min Lee Department of Computer Science San Jose State University Outline Introduction The B-tree shape Dynamic changes in the B-tree Properties of the B-tree Create index statement syntax More about the B-tree Summary Introduction A B-tree is a keyed index structure, comparable to a number of memory resident keyed lookup structures such as balanced binary tree, the AVL tree, and the 2-3 tree. The difference is that a B-tree is meant to reside on disk, being made partially memory-resident only when entries int the structure are accessed. The B-tree structure is the most common used index type in databases today. It is provided by ORACLE, DB2, and INGRES. The B-Tree Shape A B-tree is built upside down with the root at the top and the leaves at the bottom. All nodes above the leaf level, including the root, are called directory nodes or index nodes. Directory nodes below the root are called internal nodes. The root node is known as level 1 of the B-tree and successively lower levels are given successively larger level numbers with the leaf nodes at the lowest level. The total number of levels is called the depth of the B-tree. The Problem of Unbalanced Trees a. A Troublesome Search Tree b. A More Troublesome Search Tree Disadvantage of unbalanced tree Searching an unbalanced tree may require traversing an arbitrary and unpredictable number of nodes and pointers. Unbalanced Tree (cont.) Problems: 1. The levels of the tree are only sparsely filled 2. Resulting in long 3. Deep paths and defeating the purpose of binary trees in the first place. The B-Tree Shape (c.) level1: root node, level2: directory nodes, level3: leaf nodes B-Trees For a binary search tree, the search time is O(h), where h is the height of the tree. The height cannot be less than roughly log2n for a tree with n nodes. If the tree is too large for internal memory, each access of a node is an I/O. For a tree with 10,000 nodes: log210000 = 100