Tuesday, 3 January 2012

B-tree data structures

NOTE: B-tree data structures themselves allow searching of data to be performed with support for sequential access as well as insertions or deletions that may be being performed in logarithmic time. B-trees have roots at the top and leaves (or nodes) at the bottom.

Geekinterview.com defines B-tree as follows: “B-Tree is an indexing technique most commonly used in databases and file systems where pointers to data are placed in a balance tree structure so that all references to any data can be accessed in an equal time frame. It is also a tree data structure, which keeps data sorted so that searching, inserting and deleting can be done in logarithmic amortized time. ”