Prev: cutting sticks problem
Next: Ultimate Prime Sieve -- Sieve Of Zakiya (SoZ)
From: user923005 on 7 May 2008 15:33
On May 7, 1:34 am, lak <lakindi...(a)gmail.com> wrote:
> Can any one tell briefly about B+ tree. I searched. But their is no
> detailed explanation.

It is like an ordinary binary tree, except that the leaves are stuffed
into clumps. The idea is that when you read a clump into memory, it
is likely that the nearby leaf you are looking for is already in
memory and it will save time.

P.S.
Your post has nothing to do with the C language as far as I can see.
Your post is more topical in news:comp.programming. Ben Pfaff posts
over there, and he is a tree guru if there ever was one.

P.P.S
Follow-ups set to news:comp.programming
 | 
Pages: 1
Prev: cutting sticks problem
Next: Ultimate Prime Sieve -- Sieve Of Zakiya (SoZ)