root 13 2 3 5 7 14 16 17 24 19 20 22 30 24

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ancy (except for root). Each node contains d <= m <= 2d entries. The parameter d is called the order of the tree. •  Supports both equality and range ­searches efficiently. Index Entries (Direct search) Data Entries ("Sequence set") Example B+ Tree •  Search begins at root, and key comparisons direct it to a leaf •  Search for 5*, 15*, all data entries >= 24* ... Root 13 2* 3* 5* 7* 14* 16* 17 24 19* 20* 22* 30 24* 27* 29*   Based on the search for 15*, we know it is not in the tree! 33* 34* 38* 39* B+ Trees in Prac6ce •  Typical order: 100. Typical fill ­factor: 67%. –  average fanout = 133 •  Typical capaci6es: –  –  Height 4: 1334 = 312,900,700 records Height 3: 1333 = 2,352,637 records •  Can oVen hold top levels in buffer pool: –  –  –  Level 1 = 1 page = 8 Kbytes Level 2 = 133 pages...
View Full Document

This document was uploaded on 03/12/2014 for the course CSCI 165B at UC Davis.

Ask a homework question - tutors are online