原书出处
Introduction to Algorithms, Fourth Edition
18 第18章 B树
amount of data handled is so large that all the data do not fit into main memory at once.
The B-tree algorithms copy selected blocks from disk into main memory as needed and write back onto disk the blocks that have changed.
B-tree algorithms keep only a constant number of blocks in main memory at any time, and t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter018.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea