• a virtual address space with K pages needs K PT entries
• since K may be large, do not want to store whole PT
• especially since working set tells us n < K needed at once

Effective because not all pages in virtual address space are required
(e.g. the pages between the top of the heap and the bottom of the stack)