Differentiate between b-tree and b+ tree, Database Management System

Differentiate between B-tree and B+ tree   

Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time balanced and that the space wasted by deletion, if any, never becomes excessive. In a B-tree, each value of the search field appears just once at some level in the tree, along with a data pointer. In the B+-tree, data pointers are stored just only at the leaf nodes of the tree; hence, the structure of leaf nodes is different from the structure of internal nodes. The leaf nodes of the B+-tree are generally linked together to provide ordered access on the search field to the records. A few search field values from the leaf nodes are repeated in the internal nodes of the B+-tree to guide the search.

Posted Date: 5/4/2013 1:42:18 AM | Location : United States

Related Discussions:- Differentiate between b-tree and b+ tree, Assignment Help, Ask Question on Differentiate between b-tree and b+ tree, Get Answer, Expert's Help, Differentiate between b-tree and b+ tree Discussions

Write discussion on Differentiate between b-tree and b+ tree
Your posts are moderated
Related Questions
List the requirements needed to design a trigger. The requirements are:- Specifying when a trigger is to be implemented. State the actions to be taken when the trigger im

PHYSICAL DBMS ARCHITECTURE  The physical architecture defines the software components used to process and enter data, and how these software components are related and interc

What are the two statements regarding transaction? The two statements regarding transaction of the form are:- A)     Begin transaction B)      End transaction

Describe the various types of Online Analytical Processing (OLAP) tools and briefly discuss how the support common analytical operations.

find a name whose address is erode from student table

explain in details about one to one binary relationship

To do the division operation R1 ÷ R2, R2 should be a correct subset of R1. In the following example R1 have attributes A and B and R2 have only attribute B so R2 is a correct subse

All edges of a cube are expanding at a rate of 6 centimeters per second. How fast is the surface area changing when each edge is (a) 2 centimeters and (b) 10 centimeters?

Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.

For every n-ary relationship type R where n>2, we make a new table S to represent R. We contain as foreign key attributes in s the primary keys of the relations that show the parti