Re: range remove in BTree, or other table storage

From: paul c <>
Date: Sat, 24 Feb 2007 00:40:15 GMT
Message-ID: <PPLDh.1128282$R63.1101865_at_pd7urf1no>

Marshall wrote:
> On Feb 23, 12:54 pm, "Cimode" <> wrote:

>>On 23 fév, 19:54, "laurent" <> wrote:
>>>Certainly reading books in an excellent method of education,
>>>but I disagree that there is no educational value in using the
>>Disagree with whom ?

> With the guy who said "you will not get a serious database education
> by using google or online questions". It was in the context of
> my message but you snipped it.
> Marshall

just to get back on the topic, first, i don't have references but could care less about them when talking to somebody who's programmed a btree but I would think when applied to some level in the "tree" the removal of a very definite range should be very fast provided that the free list "underneath" it, if you will, is also physically organized with the same kind of structure as the tree itself.

as far as physical IO's are concerned, only the nodes at the highest levels would have to change.

bulk insert is another question. so is postponing the physical, conventional approaches for that would seem to require other components not to do with indexes, such as storage or concurrency managers.

it all reminds me of auto carburetors for some reason i can't explain very well. separate circuits whose performance effects overlap at certain engine speeds.

p Received on Sat Feb 24 2007 - 01:40:15 CET

Original text of this message