Data structure and algorithm analysis in C language

P101 refers to the range of disk block sizes [32, 256], but

Http://pclt.sites.yale.edu/blog/2010/03/10/disk-block-size mentions that because there is a minimum unit of read and write (512byte, which now has 4096), So sometimes a buffer is used to save a bit more at the end of the file, but not enough to 512byte of the portion, until the buffer is full and then write together.

The internal node of the B-tree contains the number of keys [d,2d], in other words, the number of child nodes of the inner node is [d+1,2d+1], and an M-order B-tree refers to M = 2d+1

Https://en.wikipedia.org/wiki/B-tree

About blocks:

"The Linux kernel also requires block_size = Sector_size * (2 of the N-square), and block_size <= memory page_size (page size)" This is the next textual research, but generally speaking, the sector is physically present, Block is the concept of talking about the operating system, the page is memory-related concepts, the relationship seems to be right, another time to verify it.

Data structure and algorithm analysis in C language