What I don't exactly get is how the pages are assigned. It's not really a hashing algorithm in that sense, it's more like a dictionary data structure where the

What I don't exactly get is how the pages are assigned. It's not really a hashing algorithm in that sense, it's more like a dictionary data structure where the user has to choose the storage locations. It's only possible to work from one end or the other, or more or less randomly. Either way fragmentation will creep in. This looks like it happens in the image of Locke's index.