This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Outline: BTree Motivation Definition and properties Find Insertion Deletion The Data Structure Multiple keys in a node Multiple pointers in a node Lecture 9, BTree p. 1 Motivation Considering the page access of a real sys tem; try to minimize the number of page accesses. Definition, and Properties Each node stores [ b 1 , 2 b 1] keys. (The root node is exceptional.) Each node has [ b, 2 b ] children. (The root node is exceptional.) A node is full , if it contains 2 b 1 keys All leaves are in the same level of the tree Height of the tree: (log b n ) Lecture 9, BTree p. 2 Find a value in a Btree, starting from its root node Do Search in the root node If the key is found, return it Else, move to the proper subtree Until the subtree is empty Return false Lecture 9, BTree p. 3 Splitting When a key is inserted into a full node, the node is split into two nodes. There are 2 b keys to consider....
View
Full
Document
This note was uploaded on 07/17/2010 for the course CS 240 taught by Professor Ortiz during the Spring '09 term at Waterloo.
 Spring '09
 ORTIZ

Click to edit the document details