Ankita
Member • Aug 17, 2011
B+ Tree implementation in C - Concept Discussion
A B+ tree or "B plus tree" is a data structure used as an index to facilitate fast access of different entries in a database.
Each object/node is associated with an index key. Each node also has one more pointers to the address of a location in memory.
At the bottom level of the B+ tree are leaves. Each pointer on the leaf except the last (rightmost) one points to the data object whose key stands immediately to the right of that pointer.
The rightmost pointer points to the next leaf over to the right.
Could someone explain the basics of B+ Tree implementation in C?
We can discuss and analyze different methods here.
Each object/node is associated with an index key. Each node also has one more pointers to the address of a location in memory.
At the bottom level of the B+ tree are leaves. Each pointer on the leaf except the last (rightmost) one points to the data object whose key stands immediately to the right of that pointer.
The rightmost pointer points to the next leaf over to the right.
Could someone explain the basics of B+ Tree implementation in C?
We can discuss and analyze different methods here.