It seems that if you know your page size and you know your record size, you can compute the optimal size into which you should break your records into chunks an

It seems that if you know your page size and you know your record size, you can compute the optimal size into which you should break your records into chunks and link the chunks with pointers. This causes more memory accesses, but surely that's worth keeping everything in memory? More chunks per record means more pointers and more accesses, but it should still be way faster in many cases. How to compare this to compaction, in the general case, isn't immediately obvious to me.