B – trees, Data Structure & Algorithms

Assignment Help:

B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance.

A B-Tree is a special multiway tree. In a B-Tree each of nodes may contain a large number of keys. The number of subtrees of each of node may also be large. A B-Tree is designed to branch out in this great number of directions and to contain many keys in each node so that height of the tree is comparatively small.

It means that only a small number of nodes have to be read from disk to retrieve an item.

A B-Tree of order m is multiway search tree of order m such as

  • All leaves are onto the bottom level
  • All internal nodes (except root node) contain at least m/2 (non empty) children
  • The root node can have as few as 2 children if this is an internal node and can have no children if the root node is leaf node
  • Each leaf node has to contain atleast (m/2) - 1 keys. The given is the structure for a B-tree :

struct btree

{          int count;         // number of keys stored into the current node

            item_type key[3];        // array to hold 3 keys

            long branch [4];           // array of fake pointers (records numbers)

};                    

Figure depicts an order 5 B-tree.

1847_B – TREES.png

Figure: A B-tree of order 5


Related Discussions:- B – trees

Draw a flowchart to input start time and end time of vehicle, Speed cameras...

Speed cameras read the time a vehicle passes a point (A) on road and then reads time it passes a second point (B) on the same road (points A and B are 100 metres apart). Speed of t

Technique for direct search, Technique for direct search is    Hashing ...

Technique for direct search is    Hashing is the used for direct search.

Cohen sutherland algorithm, Using the cohen sutherland. Algorithm. Find the...

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Programming information system, Describe an algorithm to play the Game of N...

Describe an algorithm to play the Game of Nim using all of the three tools (pseudocode, flowchart, hierarchy chart)

Design a binary tree, (a) Suppose that t is a binary tree of integers (that...

(a) Suppose that t is a binary tree of integers (that is, an object of type BinTree of Int.) in the state shown in Figure 3.   Give the vectors returned by each of the f

What is quick sort, What is quick sort?   Answer Quick sort is on...

What is quick sort?   Answer Quick sort is one of the fastest sorting algorithm used for sorting a list. A pivot point is chosen. Remaining elements are divided or portio

Postorder traversal of a binary tree, Postorder traversal of a binary tree ...

Postorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; }; postorder(struct NODE

Prims algorithm, how to write prims algorithms? with example

how to write prims algorithms? with example

Complete trees, This is a k-ary position tree wherein all levels are filled...

This is a k-ary position tree wherein all levels are filled from left to right. There are a number of specialized trees. They are binary trees, AVL-trees, binary search trees, 2

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd