lec0401-BTrees - Announcements: MP5 available. Due 4/1,...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Announcements: MP5 available. Due 4/1, 11:59p. Exam 2: Tue, 4/5, 7-9p, locations TBA on Exams page of web site Today: A nifty bug: Classic balanced BST structures: Red-Black trees – max ht 2log 2 n. Constant # of rotations for ins/rm/find. AVL trees – max ht 1.44log 2 n. O(log n) rotations upon remove. Balanced BSTs, pros and cons: + Insert, Remove, and Find are always O(log n) An improvement over: + Range finding & nearest neighbor - Possible to search for single keys faster - If data is so big that it doesn’t fit in memory it must be stored on disk and we require a different structure.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
B-trees (the only “out of core” data structure we’ll discuss) Can we always fit data into main memory? So where do we keep the data? Big-O analysis assumes uniform time for all operations. But…
Background image of page 2
2GHz machine gives around 2m instructions per _____. Seek time around _______ for a current hard disk. Imagine an AVL tree storing US driving records.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/26/2012 for the course CS CS 225 taught by Professor Heeren during the Spring '09 term at University of Illinois, Urbana Champaign.

Page1 / 12

lec0401-BTrees - Announcements: MP5 available. Due 4/1,...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online