iNfO wAnTeD

This is a discussion on iNfO wAnTeD within the A Brief History of Cprogramming.com forums, part of the Community Boards category; Hi all, I am presently implementing btrees..(not binary trees). Could you please provide me with links and information if any ...

  1. #1
    Its not rocket science vasanth's Avatar
    Join Date
    Jan 2002
    Posts
    1,683

    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

  2. #2
    ....
    Join Date
    Aug 2001
    Location
    Groningen (NL)
    Posts
    2,386

  3. #3
    Its not rocket science vasanth's Avatar
    Join Date
    Jan 2002
    Posts
    1,683
    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..

  4. #4
    Its not rocket science vasanth's Avatar
    Join Date
    Jan 2002
    Posts
    1,683
    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...

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Help needed regarding the Browser Info file in VC++
    By intruder in forum C++ Programming
    Replies: 4
    Last Post: 04-15-2006, 08:54 AM
  2. help info for gcc
    By Jaguar in forum Linux Programming
    Replies: 2
    Last Post: 12-28-2002, 05:34 PM
  3. parameter info and member lists
    By bennyandthejets in forum Windows Programming
    Replies: 5
    Last Post: 12-01-2002, 05:30 AM
  4. sorting output on student info program
    By indigo0086 in forum C++ Programming
    Replies: 2
    Last Post: 11-05-2002, 10:29 AM
  5. GAURAV VIRUS - Info Wanted
    By andy668 in forum Windows Programming
    Replies: 2
    Last Post: 09-15-2001, 12:05 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21