数据库系统概念(database system concepts)英文第六版 PPT 第11章.pptVIP

Example of B+-Tree Non-Leaf Nodes in B+-Trees Non leaf nodes form a multi-level sparse index on the leaf nodes. For a non-leaf node with m pointers: All the search-keys in the subtree to which P1 points are less than K1 For 2 ? i ? n – 1, all the search-keys in the subtree to which Pi points have values greater than or equal to Ki–1 and less than Ki All the search-keys in the subtree to which Pn points have values greater than or equal to Kn–1 Handling Duplicates With duplicate search keys In both leaf and internal nodes, we cannot guarantee that K1 K2 K3 . . . Kn–1 but can guarantee K