Re: range remove in BTree, or other table storage
From: laurent <laurentoget_at_gmail.com>
Date: 23 Feb 2007 08:18:48 -0800
Message-ID: <1172247528.678016.153500_at_j27g2000cwj.googlegroups.com>
> The most efficient way to do bulk inserts is interset fusion. Any
> procedurally inspired algorhythmics is at best a hack to reach the
> objective. 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. Sorry to discourage
> you but been there done that.
Date: 23 Feb 2007 08:18:48 -0800
Message-ID: <1172247528.678016.153500_at_j27g2000cwj.googlegroups.com>
>
> The most efficient way to do bulk inserts is interset fusion. Any
> procedurally inspired algorhythmics is at best a hack to reach the
> objective. 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. Sorry to discourage
> you but been there done that.
I have no particular investment in B-Trees, and would appreciate any link to something better. Received on Fri Feb 23 2007 - 17:18:48 CET