Storing Data Dina Said.

Slides:



Advertisements
Similar presentations
CPS216: Data-Intensive Computing Systems Data Access from Disks Shivnath Babu.
Advertisements

Secondary Storage Devices: Magnetic Disks
Databasteknik Databaser och bioinformatik Data structures and Indexing (II) Fang Wei-Kleiner.
- Dr. Kalpakis CMSC Dr. Kalpakis 1 Outline In implementing DBMS we need to answer How should the system store and manage very large amounts of data?
Physical DataBase Design
Problems in IO & File System CS 1550 Recitation November 4 th /6 th, 2002 The questions in this slide are from Andrew S. Tanenbaum's textbook page 375,
Tutorial 8 CSI 2132 Database I. Exercise 1 Both disks and main memory support direct access to any desired location (page). On average, main memory accesses.
CS4432: Database Systems II Data Storage - Lecture 2 (Sections 13.1 – 13.3) Elke A. Rundensteiner.
Advance Database System
13.2 Disks Mechanics of Disks Presented by Chao-Hsin Shih Feb 21, 2011.
1 Storage Hierarchy Cache Main Memory Virtual Memory File System Tertiary Storage Programs DBMS Capacity & Cost Secondary Storage.
1 CS143: Disks and Files. 2 System Architecture CPU Main Memory Disk Controller... Disk Word (1B – 64B) ~ x GB/sec Block (512B – 50KB) ~ x MB/sec System.
CS4432: Database Systems II Lecture 2 Timothy Sutherland.
1 Hard Drive Storage. 2 Introduction zThis sections discusses: yHow a hard drive works yHow to estimate storage size yHow to estimate time.
CS 342 – Operating Systems Spring 2003 © Ibrahim Korpeoglu Bilkent University1 Input/Output – 5 Disks CS 342 – Operating Systems Ibrahim Korpeoglu Bilkent.
Disk Storage, Basic File Structures, and Hashing
CS 728 Advanced Database Systems Chapter 16
CENG 351 Fall Secondary Storage Devices: Magnetic Disks.
1 Disk Storage, Basic File Structures, and Hashing.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
DISK STORAGE INDEX STRUCTURES FOR FILES Lecture 12.
1 Introduction to Computers Day 4. 2 Storage device A functional unit into which data can be –placed –retained(stored) –retrieved(accessed)
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
Hard Drive / Hard Disk Functions of hard disk
CS4432: Database Systems II Data Storage (Better Block Organization) 1.
Disk Memory Topics Disk Memory Structure Disk Capacity class10.ppt.
CS 346 – Chapter 10 Mass storage –Advantages? –Disk features –Disk scheduling –Disk formatting –Managing swap space –RAID.
1 6 Further System Fundamentals (HL) 6.2 Magnetic Disk Storage.
External Storage Primary Storage : Main Memory (RAM). Secondary Storage: Peripheral Devices –Disk Drives –Tape Drives Secondary storage is CHEAP. Secondary.
IDA / ADIT Databasteknik Databaser och bioinformatik Data structures and Indexing (I) Fang Wei-Kleiner.
Chapter 13 Disk Storage, Basic File Structures, and Hashing. Copyright © 2004 Pearson Education, Inc.
CS 405G: Introduction to Database Systems 25 Exercise Chen Qian University of Kentucky.
Chapter 8 External Storage. Primary vs. Secondary Storage Primary storage: Main memory (RAM) Secondary Storage: Peripheral devices  Disk drives  Tape.
Storing Data Dina Said 1 1.
Database Systems Disk Management Concepts. WHY DO DISKS NEED MANAGING? logical information  physical representation bigger databases, larger records,
Disk Basics CS Introduction to Operating Systems.
Section 13.2 – Secondary storage management (Former Student’s Note)
DBMS 2001Notes 2: Hardware1 Principles of Database Management Systems Pekka Kilpeläinen (after Stanford CS245 slide originals by Hector Garcia-Molina,
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
Disk storage systems Question#1 (True/False) A track is divided into multiple units called sectors.
Section 13.2 – Secondary storage management. Index 13.2 Disks Mechanics of Disks The Disk Controller Disk Access Characteristics.
Magnetic Disk Rotational latency Example Find the average rotational latency if the disk rotates at 20,000 rpm.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
Programmer’s View of Files Logical view of files: –An a array of bytes. –A file pointer marks the current position. Three fundamental operations: –Read.
COSC 6340: Disks 1 Disks and Files DBMS stores information on (“hard”) disks. This has major implications for DBMS design! » READ: transfer data from disk.
CPS216: Advanced Database Systems Notes 03: Data Access from Disks Shivnath Babu.
1 Lecture 16: Data Storage Wednesday, November 6, 2006.
 To arrange the data on the disk surface, the disk surface is divided in to different sections called :-  Slides or heads  Tracks  Sectors  Cylinders.
CS 405G: Introduction to Database Systems 13b Exercise Chen Qian University of Kentucky.
CS422 Principles of Database Systems Disk Access Chengyu Sun California State University, Los Angeles.
File organization Secondary Storage Devices Lec#7 Presenter: Dr Emad Nabil.
Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Lec 5 part1 Disk Storage, Basic File Structures, and Hashing.
© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems DISK I/0.
File Organization Record Storage and Primary File Organization
CS522 Advanced database Systems
File Structures How are the database tables stored on disk?
Section 13.2 – Secondary storage management (Former Student’s Note)
Secondary Storage Devices
Database Management Systems (CS 564)
Hard Drives.
9/12/2018.
File Organizations What an OS provides Copyright © Curt Hill.
Disks and Files DBMS stores information on (“hard”) disks.
Chapters 17 & 18 6e, 13 & 14 5e: Design/Storage/Index
Disk Storage, Basic File Structures, and Hashing
Disk Storage, Basic File Structures, and Buffer Management
Disk storage Index structures for files
Parameters of Disks The most important disk parameter is the time required to locate an arbitrary disk block, given its block address, and then to transfer.
CPS216: Advanced Database Systems Notes 04: Data Access from Disks
CS 245: Database System Principles Notes 02: Hardware
Presentation transcript:

Storing Data Dina Said

Question 9.4 If you have a large file that is frequently scanned sequentially, explain how you would store the pages in the file on a disk.

Question 9.4 If you have a large file that is frequently scanned sequentially, explain how you would store the pages in the file on a disk. The pages in the file should be stored ‘sequentially’ on a disk. We should put two ‘logically’ adjacent pages as close as possible. In decreasing order of closeness, they could be on the same track, the same cylinder, or an adjacent cylinder.

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. What is the capacity of a track in bytes? What is the capacity of each surface? What is the capacity of the disk?

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. What is the capacity of a track in bytes? What is the capacity of each surface? What is the capacity of the disk? Image from: http://pushypanda.blogspot.ca/2011/01/keeping-up-with-hard-times.html

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. What is the capacity of a track in bytes? bytes/track = bytes/sector × sectors/track = 512 × 50 = 25K What is the capacity of each surface? bytes/surface = bytes/track × tracks/surface = 25K × 2000 = 50, 000K What is the capacity of the disk? bytes/disk = bytes/surface× surfaces/disk = 50, 000K × 5 × 2 = 500, 000K

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. How many cylinders does the disk have?

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. How many cylinders does the disk have? The number of cylinders is the same as the number of tracks on each platter, which is 2000.

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. Give examples of valid block sizes. Is 256 bytes a valid block size? 2048? 51200?

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. Give examples of valid block sizes. Is 256 bytes a valid block size? 2048? 51200? The block size should be a multiple of the sector size. We can see that 256 is not a valid block size while 2048 is. 51200 is not a valid block size in this case because block size cannot exceed the size of a track, which is 25600 bytes.

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. If the disk platters rotate at 5400 rpm (revolutions per minute), what is the maximum rotational delay?

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. If the disk platters rotate at 5400 rpm (revolutions per minute), what is the maximum rotational delay? If the disk platters rotate at 5400rpm, the time required for one complete rotation, which is the maximum rotational delay, is 1/5400 × 60 = 0.011seconds

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. If the disk platters rotate at 5400 rpm (revolutions per minute), what is the maximum rotational delay? If the disk platters rotate at 5400rpm, the time required for one complete rotation, which is the maximum rotational delay, is 1/5400 × 60 = 0.011seconds The average rotational delay is half of the rotation time, 0.006 seconds.

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. /*Reward*/ If one track of data can be transferred per revolution, what is the transfer rate?

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. /*Reward*/ If one track of data can be transferred per revolution, what is the transfer rate? The capacity of a track is 25K bytes. Since one track of data can be transferred per revolution, the data transfer rate is 25K/ 0.011= 2, 250Kbytes/second

Question 9.6 Consider again the disk specifications from Exercise 9.5, and suppose that a block size of 1024 bytes is chosen. Suppose that a file containing 100,000 records of 100 bytes each is to be stored on such a disk and that no record is allowed to span two blocks. 1. How many records fit onto a block?

Question 9.6 Consider again the disk specifications from Exercise 9.5, and suppose that a block size of 1024 bytes is chosen. Suppose that a file containing 100,000 records of 100 bytes each is to be stored on such a disk and that no record is allowed to span two blocks. 1. How many records fit onto a block? 1024/100 = 10. We can have at most 10 records in a block.

Question 9.6 Consider again the disk specifications from Exercise 9.5, and suppose that a block size of 1024 bytes is chosen. Suppose that a file containing 100,000 records of 100 bytes each is to be stored on such a disk and that no record is allowed to span two blocks. How many blocks are required to store the entire file?

Question 9.6 Consider again the disk specifications from Exercise 9.5, and suppose that a block size of 1024 bytes is chosen. Suppose that a file containing 100,000 records of 100 bytes each is to be stored on such a disk and that no record is allowed to span two blocks. How many blocks are required to store the entire file? we need 10,000 blocks to store the file.

Question 9.6 Consider again the disk specifications from Exercise 9.5, and suppose that a block size of 1024 bytes is chosen. Suppose that a file containing 100,000 records of 100 bytes each is to be stored on such a disk and that no record is allowed to span two blocks. If the file is arranged sequentially on the disk, how many surfaces are needed?

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. What is the capacity of a track in bytes? bytes/track = bytes/sector × sectors/track = 512 × 50 = 25K What is the capacity of each surface? bytes/surface = bytes/track × tracks/surface = 25K × 2000 = 50, 000K What is the capacity of the disk? bytes/disk = bytes/surface× surfaces/disk = 50, 000K × 5 × 2 = 500, 000K

Question 9.6 Consider again the disk specifications from Exercise 9.5, and suppose that a block size of 1024 bytes is chosen. Suppose that a file containing 100,000 records of 100 bytes each is to be stored on such a disk and that no record is allowed to span two blocks. If the file is arranged sequentially on the disk, how many surfaces are needed? One track has 25 blocks, one surface has 25*2000=100,000 blocks. we need 10,000 blocks to store this file. So we need less than one surface to store this file. Is it correct?

Question 9.5 Consider a disk with a sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, five double- sided platters, and average seek time of 10 msec. Image from: http://gerardnico.com/wiki/data_storage/disk

Question 9.6 Consider again the disk specifications from Exercise 9.5, and suppose that a block size of 1024 bytes is chosen. Suppose that a file containing 100,000 records of 100 bytes each is to be stored on such a disk and that no record is allowed to span two blocks. If the file is arranged sequentially on the disk, how many surfaces are needed? One track has 25 blocks, One cylindar has 25*5*2=250 blocks. we need 10,000 blocks to store this file. So we need 10,000/250 = 40 cylindars, i.e. We will need the 10 surfaces to store the file.