Re: range remove in BTree, or other table storage
Date: 23 Feb 2007 09:13:10 -0800
Message-ID: <1172250790.013387.189290_at_h3g2000cwc.googlegroups.com>
On Feb 23, 5:18 pm, "laurent" <laurento..._at_gmail.com> wrote:
> > 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.
Your best investment would be to understand the logical model that
speaks of how logically optimize such operations then deduce a
computing model that does what you are asking...Here are a few
pointers...
Introduction to Database Systems - CJ DATE Received on Fri Feb 23 2007 - 18:13:10 CET