1 / 15

Disk Storage & File Structures: A Comprehensive Guide

This chapter explores disk storage, basic file structures, and hashing techniques. It covers topics such as disk organization, concurrency, record storage formats, record organization, internal hashing, overflow handling, extendible hashing, data striping, and RAID levels.

lmarsh
Download Presentation

Disk Storage & File Structures: A Comprehensive Guide

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. Chapter 13 Disk Storage, Basic File Structures, and Hashing

  2. FIGURE 13.1(a) A single-sided disk with read/ write hardware. (b) A disk pack with read/write hardware.

  3. FIGURE 13.2Different sector organizations on disk. (a) Sectors subtending a fixed angle. (b) Sectors maintaining a uniform recording density.

  4. FIGURE 13.3Interleaved concurrency versus parallel execution.

  5. FIGURE 13.4Uses of two buffers, A and B, for reading from disk.

  6. FIGURE 13.5Three record storage formats. (a) A fixed-length record with six fields and size of 71 bytes. (b) A record with two variable-length fields and three fixed-length fields. (c) A variable-field record with three types of separator characters.

  7. FIGURE 13.6Types of record organization. (a) Unspanned. (b) Spanned.

  8. FIGURE 13.7Some blocks of an ordered (sequential) file of EMPLOYEE records with NAME as the ordering key field.

  9. FIGURE 13.8Internal hashing data structures. (a) Array of M positions for use in internal hashing. (b) Collision resolution by chaining records.

  10. FIGURE 13.9Matching bucket numbers to disk block addresses.

  11. FIGURE 13.10Handling overflow for buckets by chaining.

  12. FIGURE 13.11Structure of the extendible hashing scheme.

  13. FIGURE 13.12Data striping. File A is striped across four disks.

  14. FIGURE 13.13Multiple levels of RAID. From Chen, Lee, Gibson, Katz, and Patterson (1994), ACM Computing Survey, Vol. 26, No. 2 (June 1994). Reprinted with permission.

More Related