4 ms·
Also more btree index bloat and slower inserts due to random insert order.
by jeltz 4y ago
Also more btree index bloat and slower inserts due to random insert order.
- avinassh 4y agoHow would one measure the B Tree bloat in Postgres?
- srcreigh 4y agoB-trees are self balancing so I don't think there will be bloat. But if you insert towards the end of an index a lot, the right-side of the index will more likely be in cache which makes it a lot faster. If you inserted randomly then you need to do lots of traversals in different parts of the B-Tree.