Lecture 14 Storage Cont

Lecture 14 Storage Cont - Unordered (Heap) Files Simplest...

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

View Full Document Right Arrow Icon
24 Unordered (Heap) Files v Simplest file structure contains records in no particular order. v As file grows and shrinks, disk pages are allocated and de-allocated. v To support record level operations, we must: § keep track of the pages in a file § keep track of free space on pages § keep track of the records on a page v There are many alternatives for keeping track of this.
Background image of page 1

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

View Full DocumentRight Arrow Icon
25 Heap File Implemented as a List v (heap file name, header page id) stored in a known place. v § Each page contains 2 `pointers’ plus data. v Upon insertion, scan the list of pages with space, or ask disk space manager to allocate a new page Header Page Data Page Data Page Data Page Data Page Data Page Data Page Pages with Free Space Full Pages
Background image of page 2
Heap File Using a Page Directory v A directory entry per page; it can include the number of free bytes on the page.
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.

Page1 / 13

Lecture 14 Storage Cont - Unordered (Heap) Files Simplest...

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