In postgres, everything is done in pages, so how ever many keys fit in
a page. Bigs keys mean less. For integers you can fit an awful lot of
keys.
OK, interesting. Does that mean, that when a node containing only small
values (e.g. integers) is split, then it gets an awful lot of child nodes?
In B-trees all non-leaf nodes have a bunch of pointers to its child
nodes. What is the size of such a pointer?
I imagine it's a page number, probably just a 32-bit integer.
OK, thanks a lot. Do you know if other database systems implement
b-trees this way too? I.e. one page per node.
Thanks!
