原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
1000 keys. This B-tree has 1001 nodes at depth 1 and over one million leaves at depth 2.
Large B-trees stored on disk drives often have branching factors between 50 and 2000, depending on the size of a key relative to the size of a block. A large branching factor dramatically reduces both the height of the tree and the number of disk accesses required to find any key.
Figure 18.3 shows a B-tree with a branching factor of 1001 and height 2 that can store ov
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea