disk block
The fixed-size unit, typically a few kilobytes, in which data is read from and written to disk.
In more detail
Reading one byte from disk costs a whole block and far more time than a memory access, so on-disk structures try to use every byte of each block they fetch. A B-tree node is sized to fill exactly one block.
Related terms
- B-tree — A balanced search tree whose nodes each hold many sorted keys and have many children, so the tree is very wide and very shallow.
- I/O — Input and output: any time a program reads or writes data outside its own memory, such as files, networks or the terminal.
- page cache — Memory the operating system or database uses to keep recently read disk blocks, so repeated reads skip the disk.
Taught in
- Arrays: Contiguous Memory And Constant-Time Access — Algorithms & Data Structures for Working Engineers
- Stacks And Queues: Last In Or First In — Algorithms & Data Structures for Working Engineers
- Deques And Ring Buffers — Algorithms & Data Structures for Working Engineers
- Choosing The Right Sequence — Algorithms & Data Structures for Working Engineers
- Binary Search And Its Invariant — Algorithms & Data Structures for Working Engineers
- B-Trees: The Structure Behind Every Database Index — Algorithms & Data Structures for Working Engineers