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.


You are reading an archived discussion.

Related Posts

If you get some news about job openings for instrumentation engineers in your city, please post it here. It will be useful for many engineers around.
Techastra ’11 is a platform for all students from various disciplines of engineering and management pan India, which provides an opportunity to present share and improve the knowledge. It’s a...
POINTERS-2K11 is a National Level Technical Symposium, conducted by the Computer Science and Engineering Department of Arunai Engineering College, TamilNadu. The Symposium is going to be conducted on 8-9 September,...
Dear All; Good evening can any one upload IRC 16 - 2008 required urgently Thanks & Regards Wilson
Can SCM contribute to the durability of the concrete structures? Please provide information regarding this 😀 regards gopisbee