Can any one tell briefly about B+ tree. I searched. But their is no
detailed explanation.
If any one have that, pls post!
detailed explanation.
If any one have that, pls post!
-
-
Re: B+ tree
lak <lakindia89@gma il.comwrites:
I do not believe you. I think that you are lazy:>Can any one tell briefly about B+ tree. I searched. But their is no
>detailed explanation.
Brief != detailed.
--
Chris.
-
Re: B+ tree
On 7 May 2008 at 8:34, lak wrote:There's a good overview on Wikipedia, of course:Can any one tell briefly about B+ tree. I searched. But their is no
detailed explanation.
There are some "external links" at the bottom of the page, some of which
might be useful.
These newsgroups are generally better for specific questions, rather
than asking for explanations of a broad subject: text books are usually
the right place to look for that.
Comment
-
Re: B+ tree
On May 7, 1:34 am, lak <lakindi...@gma il.comwrote:It is like an ordinary binary tree, except that the leaves are stuffedCan any one tell briefly about B+ tree. I searched. But their is no
detailed explanation.
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.progr amming. 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.progr amming
Comment
Comment