page cache

Memory the operating system or database uses to keep recently read disk blocks, so repeated reads skip the disk.

In more detail

The root and top levels of a busy B-tree are read so often that they almost always sit in the page cache, so a lookup usually costs only one or two real disk reads. This is why B-tree performance in practice is even better than its height suggests.

Related terms

Taught in

References