## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

________________________________________________________

A B-Tree is a height balanced search tree. A B-Tree of order m satisfies the following properties: • The root node has at least 2 children (if it is not empty or is not a leaf node) • All nodes other than root have at least ceil(m/2) children (i.e. links) and ceil(m/2)-1 keys • All leaf nodes are at the same level

**A B-Tree of order 4 (3-4 search tree)
**

1

B-TREE

________________________________________________________

The following is an example of a B-tree of order 5 (A 4-5 B-Tree). A 4-5 B-Tree means 4 key values and 5 links/children. To be precise, Other that the root node, all internal nodes have at least, ceil(5 / 2) = ceil(2.5) = 3 children. Maximum is 5. At least ceil(5/2)-1 = ceil(2.5)-1 = 3 -1 = 2 keys. Maximum is 4. In practice B-trees usually have orders a lot bigger than 5.

2

B-TREE

________________________________________________________

**B-tree of order 5: (Creation & Addition)
**

CNGAHEKQMFWLTZDPRXYS

3

B-TREE

________________________________________________________ CNGAHEKQMFWLTZDPRXYS

CNGAHEKQMFWLTZDPRXYS

4

B-TREE

________________________________________________________ CNGAHEKQMFWLTZDPRXYS

CNGAHEKQMFWLTZDPRXYS

5

B-TREE

________________________________________________________ CNGAHEKQMFWLTZDPRXYS

CNGAHEKQMFWLTZDPRXYS

6

B-TREE

________________________________________________________ CNGAHEKQMFWLTZDPRXYS

7

B-TREE

________________________________________________________

Deletion:

Delete H: Since H is in a leaf and the leaf has more than the minimum number of keys, this is easy. We move the K over where the H had been and the L over where the K had been. (Next T)

8

B-TREE

________________________________________________________

Delete T : Since T is not in a leaf, we find its successor (the next item in ascending order), i.e. W, and move W up to replace the T. That way, what we really have to do is to delete W from the leaf, which we already know how to do, since this leaf has extra keys. In ALL cases we reduce deletion to a deletion in a leaf, by using this method. (Next R)

9

B-TREE

________________________________________________________

Delete R: Although R is in a leaf, this leaf does not have an extra key; the deletion results in a node with only one key, which is not acceptable for a B-tree of order 5. If the sibling node to the immediate left or right has an extra key, we can then borrow a key from the parent and move a key up from this sibling. In our specific case, the sibling to the right has an extra key. So, the successor W of S (the last key in the node where the deletion occurred), is moved down from the parent, and the X is moved up. (S and W are inserted in their proper place.) (Next E)

10

B-TREE

________________________________________________________

Delete E: This one causes lots of problems. Although E is in a leaf, the leaf has no extra keys, nor do the siblings to the immediate right or left. In such a case the leaf has to be combined with one of these two siblings. This includes moving down the parent's key that was between those of these two leaves. In our example, let's combine the leaf containing F with the leaf containing A C. We also move down the D.

11

B-TREE

________________________________________________________

Delete E: The parent node now contains only one key, G. This is not acceptable. If this problem node had a sibling to its immediate left or right that had a spare key, then we would again "borrow" a key. Since we have no way to borrow a key from a sibling, we must again combine with the sibling, and move down the M from the parent. In this case, the tree shrinks in height by one.

12

B-TREE

________________________________________________________ Another example:

Delete C: Find the immediate successor, which would be D, and move the D up to replace the C. However, this leaves us with a node with too few keys.

13

B-TREE

________________________________________________________

Delete C: C is removed and D went up so E is the only node (not allowed). Since neither the sibling to the left or right of the node containing E has an extra key, we must combine the node with one of these two siblings. Let's consolidate with the A B node.

14

B-TREE

________________________________________________________

Delete C: But now the node containing F does not have enough keys. However, its sibling has an extra key. Thus we borrow the M from the sibling, move it up to the parent, and bring the J down to join the F. Note that the K L node gets reattached to the right of the J.

15

B-TREE

________________________________________________________

Delete C: Thus finally C is deleted and tree is once again height balanced.

16

- DBMS-B+ and B trees
- B+ TREE TUTORIAL PPT
- a complete guide for building a AVL Tree
- File and Indexing
- B+ Trees
- DBMS Questions & Answers
- Types of Binary Tree
- B+Tree
- Comparison of All Sorting Algorithms
- B+ Tree
- Trees
- B+ Tree and Hashing
- 12.B-trees
- Trees_data structures
- Cs33- Data Structures Questions and Answers
- Graph Theory in Data Structure
- 22-mca-or-data structures
- Optimal MERGE PATTERN
- Normalization
- C program for Binary Search Tree Traversal
- UGC CSIR NET Question Paper 1 Download
- DBMS
- Assembly language_ Ytha Yu_Chap 5
- Application of Knapsack Algorithm
- Tree1
- AVL Tree Program
- B-Trees
- MICROPROCESSOR AND MICROCONTROLLER
- M WAY TREES PDF
- Graph Data Structure

- Content Based Image Retrieval Using Color and Texture Features
- Harvey Mudd Facebook Clinic Poster 2011
- Comparison of Various Web Image Re - Ranking Techniques
- The Query Construction Interface for Analogous Information Retrieval
- Content-Based Image Retrieval Using Features Extracted From Block Truncation Coding
- A Novel Approach for Travel Package Recommendation Using Probabilistic Matrix Factorization
- NLP to Create sql Query
- An Algorithm to Retrieve Unclear Information with Link Analysis Mining Methods
- Full-Text Retrieval in Unstructured P2P Networks using Bloom Cast Efficiently
- A Survey on Optimization of User Search Goals by Using Feedback Session
- An Intelligent IR for Natural Language Query Processing using Fuzzy Logic
- Simplified Data Search Using Imputation Approach
- Method and system for dynamically processing ambiguous, reduced text search queries and highlighting results thereof (US patent 7779011)
- Multibiometric Secure Index Value Code Generation for Authentication and Retrieval
- Accuracy-Constrained Privacy-Preserving Row Level Access Control Mechanism for Relational Data
- tmpD6EB.tmp
- A Comparative Study of Recent Ontology Visualization Tools with a Case of Diabetes Data
- Techniques and Issues in Image Mining
- UT Dallas Syllabus for cs6322.501.11s taught by Sanda Harabagiu (sanda)
- Custom-Made Ranking in Databases Establishing and Utilizing an Appropriate Workload
- Getting to grips with the National Pupil Database; personal data in an open data world
- An Enhance Image Retrieval of User Interest Using Query Specific Approach and Data Mining Technique
- tmp3CA6.tmp
- A Review on Content Based Image Retrieval using Mixture Model for Image Representation
- A Survey on Matching and Retrieval of Near Duplicate Images
- A System for Efficient Retrieval of the Images from Large Datasets using Ripplet Transform and Edge Histogram Detector
- 43987_1930-1934
- An Introduction of Content Based Image Retrieval Process
- A Review Paper on Content based Video Retrieval
- A Survey on Content Based Image Retrieval using Low-Level Features Extraction

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading