B+ trees

This is a discussion on B+ trees within the C Programming forums, part of the General Programming Boards category; Can anyone suggest a reliable source(preferably online) for B+ trees explaining the operations and the algorithm clearly? Googled for a ...

  1. #1
    Eager young mind
    Join Date
    Jun 2006
    Posts
    342

    B+ trees

    Can anyone suggest a reliable source(preferably online) for B+ trees explaining the operations and the algorithm clearly? Googled for a while, couldnt come up with anything good
    In the middle of difficulty, lies opportunity

  2. #2
    and the hat of wrongness Salem's Avatar
    Join Date
    Aug 2001
    Location
    The edge of the known universe
    Posts
    32,484
    If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
    If at first you don't succeed, try writing your phone number on the exam paper.
    I support http://www.ukip.org/ as the first necessary step to a free Europe.

  3. #3
    Eager young mind
    Join Date
    Jun 2006
    Posts
    342
    I could only find this : http://www.nist.gov/dads/HTML/bplustree.html. Am I missing something here.?
    In the middle of difficulty, lies opportunity

  4. #4
    and the hat of wrongness Salem's Avatar
    Join Date
    Aug 2001
    Location
    The edge of the known universe
    Posts
    32,484
    Yes, click on the links which describe b-trees in general, which b+trees are a variation of.
    If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
    If at first you don't succeed, try writing your phone number on the exam paper.
    I support http://www.ukip.org/ as the first necessary step to a free Europe.

  5. #5
    Eager young mind
    Join Date
    Jun 2006
    Posts
    342
    I still have a little difficulty in understanding that case where a node is filled upto the limit and I still try to insert a number into it.

    THis is what I have thought of , feeling too tired to actually code it now, please let me know if I am wrong:

    1. insert the new value into the node as though it is still a valid operation.
    2. split this node at the middle, push the middle value to the parent node and repeat step1 for the parent node
    3. re-arrange the fragments of the split node to obey the rules of the B+tree.

    repeat until I find a node that can accomodate the number that I have passed up or till I hit the root.

    If I hit the root, perform 1,2,3 on the root , set the root to point to the "new root".
    In the middle of difficulty, lies opportunity

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Trees
    By masterg in forum C++ Programming
    Replies: 2
    Last Post: 12-04-2008, 12:42 PM
  2. Binary Search Trees Part III
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 16
    Last Post: 10-02-2004, 03:00 PM
  3. Trees
    By samtay in forum C++ Programming
    Replies: 7
    Last Post: 03-28-2004, 08:35 AM
  4. Binary Trees...
    By SirCrono6 in forum C++ Programming
    Replies: 5
    Last Post: 11-25-2003, 03:54 PM
  5. AVL Trees
    By kwigibo in forum C Programming
    Replies: 2
    Last Post: 04-17-2002, 05:46 PM

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