a major problem with this design is poor cache locality caused by the hash function. tree-based designs avoid this by placing the page table entries for adjacent pages in adjacent locations, but an inverted page table destroys spatial locality of reference by scattering entries all over. an operating system may minimize the size of the hash table to reduce this problem, with the trade-off being an increased miss rate.