•
|
Keys work better with larger pages. There are more branches per Btree node and thus fewer levels to the Btree. Fewer levels means fewer disk reads and writes. Fewer disk reads means better performance.
|
•
|
Concurrency works better with smaller pages, especially when client transactions are used. Since the transactional database engine locks some pages changed during the transaction, all other clients must wait for locked pages until the transaction is ended or aborted. With a lot of clients trying to access the same pages concurrently, the less that is found on each page is better.
|
•
|
Random access to pages works better with smaller pages since more of the stuff you actually use is in cache. If you access anything again, it is more likely to be still in cache.
|
•
|
Sequential access to a large volume of records works better with larger pages since more is read at once. Since you are using most everything on each page read, there will definitely be fewer reads.
|