华南理工大学数据结构chapter10.pptVIP

* B+-Tree Space Analysis (1) Example: Consider a B+-Tree of order 100 with leaf nodes containing 100 records. 1 level B+-tree: Min 0, Max 100 2 level B+-tree: Min: 2 leaves of 50 for 100 records. Max: 100 leaves with 100 for 10,000 records. 3 level B+-tree: Min: 2 x 50 nodes of leaves, each leaf of 50 records for 5000 records. Max: 1003 = 1,000,000 records. 4 level B+-tree: Min: 250,000 records (2 * 50 * 50 * 50). Max: 1004 = 100 million records. * B+-Tree Space Analysis (2) Ways to reduce the number of disk fetches: Keep the upper levels in memory. Manage B+-