Re: range remove in BTree, or other table storage

On 2007-02-23, Cimode wrote:

> The most efficient way to do bulk inserts is interset fusion.

What's that? I've probably stumbled onto it, but under a different name.

> As B-trees are themselves hacks because they do not separate logical
> and physical, the chances you will be able to build efficient bulk
> insert through b-trees are NULL.

I don't really understand this either. I've always thought of B-trees as a physical implementation detail, so I don't see where they contain anything logical at all. Especially if hidden behind some neat abstraction, like a GiST.

-- 
Sampo Syreeni, aka decoy - mailto:decoy_at_iki.fi, tel:+358-50-5756111
student/math+cs/helsinki university, http://www.iki.fi/~decoy/front
openpgp: 050985C2/025E D175 ABE5 027C 9494 EEB0 E090 8BA9 0509 85C2