Heikki Linnakangas <[EMAIL PROTECTED]> writes: > I've been experimenting with the idea of a so-called Block B-Tree. The > basic idea is that instead of storing an index tuple for each heap > tuple, we store an index tuple for each heap block. This dramatically > reduces the size of an index, leading to savings on I/O.
VACUUM?
regards, tom lane
---------------------------(end of broadcast)---------------------------
TIP 5: don't forget to increase your free space map settings
