Disk and File Organization Flashcards

1
Q

magentic storage

A

hard disk drives and floppy disks use magnetic fields to store data on a rotating disk. the data is later accessed using a read/write head that moves across the surface of the disk

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

flash storage

A

solid state drives and usb drives use non-volatile memory chips to store data. flash storage can be accessed electronically, this makes it faster and more reliable than magnetic storage

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

non-volatile

A

refers to the ability of a type of memory to retain its data even when the power is turned off

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

redundant array of independent disks (raid)

A

disk organization technique to manage a large number of disks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

mirroring

A

duplicate every disk; every write is carried out on both disks and read can use either disk

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

bit-level striping

A

split the bits of each byte across multiple disks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

block-level striping

A

with n disks, block i of a file goes to disk (i mod n) + 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

parity blocks

A

a parity block’s ith bit is the XOR (exclusive or) of the ith bits of all the blocks in the set (reverse to get a block’s data back)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

raid 0

A

disk arrays with striping at the level of the blocks, but no redundancies
- use when data safety is not important

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

raid 1

A

disk mirroring with block striping (has a copy of each disk)
- better write performance than raid 5

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

raid 4

A

disk arrays with striping across multiple disks and a dedicated parity block
- not useful for reads
- bad for writes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

raid 5

A

partitions data and parity among all N+1 disks, rather than storing data in N disks and parity in 1 disk
- for applications where write are sequential and large and new large amounts of data storage

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

raid 6

A

similar to raid 5 but stores 2 error correction blocks instead of a single parity block to guard against multiple disk failures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

heap

A

record can be placed anywhere in the file where there is space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

free space map

A

an array containing 1 entry for each block in the relation where each entry is a few bits to 1 byte in size; each bloc contains a fraction indicating haw much space in the block is free

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

sequential file organization

A

the records (triples) are ordered by search key

17
Q

buffer manager

A

the subsystem responsible for allocating buffer space
- when the database system need the read a block from a disk, a request is made to the buffer manager and space is allocated for the new block