If the whole idea of the B+-tree structure, that the MySQL clustered index uses, is to be efficient in accessing disk data. Then it's logical to make index page size equal to the disk block size which is usually 512 bytes.
Then one physical disk lookup (required rotations and other movements) will provide us with one index page data. So why index page size is more like 16k instead? (As I understood, retrieving such a page requires reading of different disk blocks, not always sequential, and a lot of disk rotations).
What am I missing here?