Thread: iNfO wAnTeD

Hi all,
I am presently implementing btrees..(not binary trees). Could you please provide me with links and information if any that will help me understand btrees better..


Thanx in advance
Vasanth

http://www.public.asu.edu/~peterjn/btree/
http://www.nist.gov/dads/HTML/btree.html

Thanx.. But ohh boy i am more confuced now.. I am seeing more than one kind of btees around.. Which is the right one.. or more effecient..


First one)
In the key values are only stored in the leaf nodes.. THough the parent or root nodes contain the element.. the eement is again repeated in the leaf node...


eg

Code:

                                                   
 
                                       60                       125
                             
                                22   40   59            60   80   90

the second one) Where if 60 is listed it is not put in the leaf node.. The value 60 is held only by that node

Code:

                                        60                       125
                             
                                22   40   59               80   90

In the first one the root nodes just acts as pointers to a page where all the values below 60 are stored but in the second one the root node containing 60 acts as a container of 60 and points to pages containing value less than 60...

In the first one the pointer to the record exists only in the leaf node.. Where as in the second one the pointer to the records in the database for 60 is stored in the root node 60 itself..


Which of these is the actual BTree..
Please clarify..

Did some research and found out that one is a B Tree and the other is B+ Tree.. Now which is better and effecient...

Can any one please shed some light on this issue...