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

Creation of doubly linked list, Program: Creation of Doubly Linked List ...

Program: Creation of Doubly Linked List OUTPUT Input the values of the element -1111 to come out : 1 Input the values of the element -1111 to come out : 2 Inpu

Data Structure, Ask consider the file name cars.text each line in the file ...

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

Algorithm for sorting a deck of cards, What is wrong with the following alg...

What is wrong with the following algorithm for sorting a deck of cards (considering the basic properties of algorithms)? I. Put the cards together into a pile II. For each ca

What are the objectives of visual realism applications, What are the Object...

What are the Objectives of visual realism applications After studying this unit, you should be able to know specific needs of realism, add realism to pictures by el

Find the optimal control, 1. Use the Weierstrass condition, find the (Stron...

1. Use the Weierstrass condition, find the (Strongly) minimizing curve and the value of J min for the cases where x(1) = 0, x(2) = 3. 2. The system = x 1 + 2u; where

Demonstrate that dijkstra''s algorithm, Demonstrate that Dijkstra's algorit...

Demonstrate that Dijkstra's algorithm does not necessarily work if some of the costs are negative by finding a digraph with negative costs (but no negative cost dicircuits) for whi

What do you understand by structured programming, What do you understand by...

What do you understand by structured programming Structured Programming  This term is used for programming design that emphasizes:- (1) Hierarchical design of programmi

Algorithm, Write an algorithm for compound interest.

Write an algorithm for compound interest.

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