Ok. Some more googling...
Good simple definition here:
Database Page Layout
Essentially saying a table / index is stored as an index of pages.
Similar a good analogy here where one poster describes them as just been like pages of a book:
database - MySQL: What is a page? - Stack Overflow
This is a good analogy as pages are of fixed size. And you can imagine if a pagesize was too big, there'd be plenty of wasted space. If page size was too small, the book would be too difficult to read / search etc.
So my questions are:
1. What are page sizes generally so small? Why can't I have a page size of say 1Meg or 100 Meg?
2. What happens if you have a very large rows (not to hard to beat size of 32KB) ? I presume your row is stored in multiple pages.
3. Also, I see DB2 has a concept of leaf pages and sequential pages and just pages. I can make a guess at what these mean, but would really like to know exactly what they mean and have a deep understanding.
So determines if a page is leaf / sequential or not? How do I check?
Do pages have children and a leaf just has no children?
Cheers.