Re:PostgreSQL partitioning explained
by windsurfer on Sunday May 04, 2014 @12:54PM
(#7694881)
Why can't the index store the branches of the b-tree as separate objects on disk instead of loading all branches into memory piece by piece?
The problem happens when this B-tree is too large to fit into your working memory: swapping parts of the B-tree in and out of memory repeatedly to answer a query is very slow. The solution that partitioning offers is to allow you to split your indexes (and your data) so that, depending on your access-patterns you could see less swapping of that index.