13.5

It is important to be able to quickly find out if a block is present in the buffer, and if so where in the buffer it resides. Given that database buffer sizes are very large, what (in-memory) data structure would you use for this task?

---

Hash table is the common option for large database buffers. The hash function helps in locating the appropriate bucket on which linear search is performed.