1 / 5

CSE 373: Data Structures and Algorithms

Explore B-Trees for disk-based data handling exceeding main memory limits. Understand memory hierarchy, time complexity, and page size optimization for faster access operations.

alter
Download Presentation

CSE 373: Data Structures and Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSE 373: Data Structures and Algorithms Lecture 24: B-Trees

  2. Disk Based Data Structures • All data structures we have examined are limited to main memory • Have been assuming data fits into main memory • Counter-example: transaction data of a bank > 1 GB per day • uses secondary storage (hard disks, tapes, etc) • operations: insert, delete, searches • Idea: Make a search tree that is secondary storage enabled

  3. Memory Hierarchy • Big-Oh assumes all operations take the same amount of time • Is this really true? • Cycle – time it takes to execute an instruction

  4. Cycles to access: CPU Registers 1 tens Cache hundreds Main memory Disk millions

  5. Hard Disks • Large amount of storage but slow access • Identifying a page takes a long time • Pays to read or write data in pages (i.e. blocks) of 0.5 – 8 KB in size

More Related