CSE332: Data Abstractions
Lecture 9 B Trees Dan Grossman Spring 2010 Our goal Problem A dictionary with so much data most of it is on disk Desire A balanced tree logarithmic height that is even shallower than AVL trees so that we can minimize disk accesses and exploit diskblock size
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "CSE332: Data Abstractions" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.