AOBD 2009/10AOBD 2009/10

Storage and File StructureStorage and File Structure

Overview of Physical Storage MediaOverview of Physical Storage Media Magnetic DisksMagnetic Disks Tertiary Storage Tertiary Storage Storage AccessStorage Access RAIDRAID File OrganizationFile Organization Organization of Records in FilesOrganization of Records in Files Data-Dictionary StorageData-Dictionary Storage

Overview

AOBD 2009/10AOBD 2009/10

Overall DBMS Structure Overall DBMS Structure

AOBD 2009/10AOBD 2009/10

Classification of Physical Storage Classification of Physical Storage MediaMedia

Criteria: Criteria: SpeedSpeed with which data can be accessed with which data can be accessed CostCost per unit of data per unit of data ReliabilityReliability

• data loss on power failure or system crashdata loss on power failure or system crash• physical failure of the storage devicephysical failure of the storage device

Volatility: Volatility: Can differentiate storage into: Can differentiate storage into:• volatile storagevolatile storage: : loses contents when power is loses contents when power is

switched offswitched off• non-volatile storagenon-volatile storage : contents persist even when : contents persist even when

power is switched off. power is switched off.

AOBD 2009/10AOBD 2009/10

Storage HierarchyStorage Hierarchy

AOBD 2009/10AOBD 2009/10

Storage Hierarchy (Cont.)Storage Hierarchy (Cont.)

primary storageprimary storage: : Fastest media but volatile Fastest media but volatile (cache, main memory).(cache, main memory).secondary storagesecondary storage:: next level in hierarchy, non- next level in hierarchy, non-volatile, moderately fast access timevolatile, moderately fast access time

also called also called on-line storageon-line storage E.g. flash memory, magnetic disksE.g. flash memory, magnetic disks

tertiary storagetertiary storage:: lowest level in hierarchy, non- lowest level in hierarchy, non-volatile, slow access timevolatile, slow access time

also called also called off-line storageoff-line storage E.g. magnetic tape, optical storageE.g. magnetic tape, optical storage

AOBD 2009/10AOBD 2009/10

Types of Physical Storage MediaTypes of Physical Storage MediaCacheCache: fastest and most costly form of storage; : fastest and most costly form of storage; volatile; managed by the computer system volatile; managed by the computer system hardware.hardware.Main memoryMain memory::

fast accessfast access generally too small (or too expensive) to store the generally too small (or too expensive) to store the

entire databaseentire database• capacities of up to a few Gigabytes widely used currentlycapacities of up to a few Gigabytes widely used currently

VolatileVolatile: contents of main memory are usually lost if a : contents of main memory are usually lost if a power failure or system crash occurs.power failure or system crash occurs.

AOBD 2009/10AOBD 2009/10

Flash MemoryFlash Memory

Data survives power failureData survives power failure Cost per unit of storageCost per unit of storage roughly similar to main memory roughly similar to main memory Reads are roughly as fast as main memory, but Reads are roughly as fast as main memory, but writes are slowwrites are slow

(few microseconds), erase is slower(few microseconds), erase is slower Data can be written at a location only once, but location can be Data can be written at a location only once, but location can be

erased and written to again erased and written to again Can support only a limited number of write/erase cycles.Can support only a limited number of write/erase cycles. Erasing of memory has to be done to an entire bank of memory Erasing of memory has to be done to an entire bank of memory

Widely used in embedded devices such as digital cameras and Widely used in embedded devices such as digital cameras and in USBsin USBs

AOBD 2009/10AOBD 2009/10

Magnetic diskMagnetic disk Data is stored on spinning disk, and read/written magneticallyData is stored on spinning disk, and read/written magnetically Primary medium for the long-term storage of data; typically Primary medium for the long-term storage of data; typically

stores entire database.stores entire database. Data must be moved from disk to main memory for access, Data must be moved from disk to main memory for access,

and written back for storageand written back for storage Much slower access than main memory (more on this later)Much slower access than main memory (more on this later)

Direct-accessDirect-access – possible to read data on disk in any order, – possible to read data on disk in any order, unlike magnetic tapeunlike magnetic tape

Capacities range up to roughly 2TB currentlyCapacities range up to roughly 2TB currently Survives power failures and system crashesSurvives power failures and system crashes

disk failure can destroy data, but is very raredisk failure can destroy data, but is very rare

AOBD 2009/10AOBD 2009/10

Optical storageOptical storage

non-volatile, data is read optically from a spinning non-volatile, data is read optically from a spinning disk using a laser disk using a laser

Reads and writes are slower than with magnetic Reads and writes are slower than with magnetic disk disk

CD-ROM CD-ROM (640 MB) and (640 MB) and DVD DVD (4.7 to 17 GB) most (4.7 to 17 GB) most popular formspopular forms

Write-one, read-many (WORM) optical disks used Write-one, read-many (WORM) optical disks used for archival storage (CD-R and DVD-R)for archival storage (CD-R and DVD-R)

Multiple write versions also available (CD-RW, Multiple write versions also available (CD-RW, DVD-RW)DVD-RW)

AOBD 2009/10AOBD 2009/10

Tape storageTape storage

non-volatile, used primarily for backup (to recover non-volatile, used primarily for backup (to recover from disk failure), and for archival datafrom disk failure), and for archival data

sequential-accesssequential-access – much slower than disk – much slower than disk very high capacity (40 to 300 GB tapes available)very high capacity (40 to 300 GB tapes available) tape can be removed from drive tape can be removed from drive storage costs storage costs

much cheaper than disk, but drives are expensivemuch cheaper than disk, but drives are expensive Tape jukeboxes available for storing massive Tape jukeboxes available for storing massive

amounts of data amounts of data hundreds of terabytes (1 terabyte = 10hundreds of terabytes (1 terabyte = 109 9 bytes) to even a bytes) to even a

petabyte (1 petabyte = 10petabyte (1 petabyte = 101212 bytes) bytes)

Magnetic Disks

AOBD 2009/10AOBD 2009/10

Magnetic Hard Disk MechanismMagnetic Hard Disk Mechanism

NOTE: Diagram is schematic, and simplifies the structure of actual disk drives

AOBD 2009/10AOBD 2009/10

Magnetic DisksMagnetic Disks Read-write headRead-write head

Positioned very close to the platter surface (almost touching it)Positioned very close to the platter surface (almost touching it) Reads or writes magnetically encoded information.Reads or writes magnetically encoded information.

Surface of platter divided into circular Surface of platter divided into circular trackstracks Over 16,000 tracks per platter on typical hard disksOver 16,000 tracks per platter on typical hard disks

Each track is divided into Each track is divided into sectorssectors.. A sector is the smallest unit of data that can be read or written.A sector is the smallest unit of data that can be read or written. Sector size typically 512 bytesSector size typically 512 bytes Typical sectors per track: 200 (on inner tracks) to 400 (on outer tracks)Typical sectors per track: 200 (on inner tracks) to 400 (on outer tracks)

To read/write a sectorTo read/write a sector disk arm swings to position head on right trackdisk arm swings to position head on right track platter spins continually; data is read/written as sector passes under platter spins continually; data is read/written as sector passes under

headhead Head-disk assemblies Head-disk assemblies

multiple disk platters on a single spindle (typically 2 to 15)multiple disk platters on a single spindle (typically 2 to 15) one head per platter, mounted on a common arm.one head per platter, mounted on a common arm.

CylinderCylinder i i consists of consists of iithth track of all the platters track of all the platters

AOBD 2009/10AOBD 2009/10

Magnetic Disks (Cont.)Magnetic Disks (Cont.) Earlier generation disks were susceptible to head-Earlier generation disks were susceptible to head-

crashescrashes Disk controllerDisk controller – interfaces between the computer – interfaces between the computer

system and the disk drive hardware.system and the disk drive hardware. accepts high-level commands to read or write a sector accepts high-level commands to read or write a sector initiates actions such as moving the disk arm to the right initiates actions such as moving the disk arm to the right

track and actually reading or writing the datatrack and actually reading or writing the data Computes and attaches Computes and attaches checksumschecksums to each sector to to each sector to

verify that data is read back correctlyverify that data is read back correctly• If data is corrupted, with very high probability stored checksum If data is corrupted, with very high probability stored checksum

won’t match recomputed checksumwon’t match recomputed checksum Ensures successful writing by reading back sector after Ensures successful writing by reading back sector after

writing itwriting it Performs Performs remapping of bad sectorsremapping of bad sectors

AOBD 2009/10AOBD 2009/10

Disk SubsystemDisk Subsystem

Multiple disks connected to a computer system through a Multiple disks connected to a computer system through a controllercontroller Controllers functionality (checksum, bad sector remapping) often Controllers functionality (checksum, bad sector remapping) often

carried out by individual disks; reduces load on controllercarried out by individual disks; reduces load on controller Disk interface standards familiesDisk interface standards families

ATAATA (AT adaptor) range of standards (AT adaptor) range of standards SCSISCSI (Small Computer System Interconnect) range of standards (Small Computer System Interconnect) range of standards Several variants of each standard (different speeds and capabilities)Several variants of each standard (different speeds and capabilities)

AOBD 2009/10AOBD 2009/10

Performance Measures of DisksPerformance Measures of DisksAccess timeAccess time – the time it takes from when a read or write – the time it takes from when a read or write request is issued to when data transfer begins. Consists of: request is issued to when data transfer begins. Consists of: Seek timeSeek time – time it takes to reposition the arm over the correct track. – time it takes to reposition the arm over the correct track.

• 2 to 15 milliseconds on typical disks2 to 15 milliseconds on typical disksRotational latencyRotational latency – time it takes for the sector to be accessed to appear – time it takes for the sector to be accessed to appear under the head. under the head.

• 4 to 11 milliseconds on typical disks (5400 to 15000 r.p.m.)4 to 11 milliseconds on typical disks (5400 to 15000 r.p.m.)

Data-transfer rateData-transfer rate – the rate at which data can be retrieved – the rate at which data can be retrieved from or stored to the disk.from or stored to the disk.

Up to 70 MB/sUp to 70 MB/s Multiple disks may share a controller, so rate that controller can Multiple disks may share a controller, so rate that controller can

handle is also importanthandle is also important

AOBD 2009/10AOBD 2009/10

Performance Measures (Cont.)Performance Measures (Cont.)

Mean time to failure (MTTF)Mean time to failure (MTTF) – the average time – the average time the disk is expected to run continuously without the disk is expected to run continuously without any failure.any failure.

Typically 3 to 5 yearsTypically 3 to 5 years Probability of failure of new disks is quite low, Probability of failure of new disks is quite low,

corresponding to acorresponding to a“theoretical MTTF” of 30,000 to 1,200,000 hours for a “theoretical MTTF” of 30,000 to 1,200,000 hours for a new disknew disk

• E.g., an MTTF of 1,200,000 hours for a new disk means that E.g., an MTTF of 1,200,000 hours for a new disk means that given 1000 relatively new disks, on an average one will fail given 1000 relatively new disks, on an average one will fail every 1200 hoursevery 1200 hours

MTTF decreases as disk agesMTTF decreases as disk ages

Optimization of Disk Access

AOBD 2009/10AOBD 2009/10

Optimization of Disk-Block AccessOptimization of Disk-Block AccessBlockBlock – a contiguous sequence of sectors from a – a contiguous sequence of sectors from a single track single track

data is transferred between disk and main memory in data is transferred between disk and main memory in blocks blocks

sizes range from 512 bytes to several kilobytessizes range from 512 bytes to several kilobytes• Smaller blocks: more transfers from diskSmaller blocks: more transfers from disk• Larger blocks: more space wasted due to partially filled blocksLarger blocks: more space wasted due to partially filled blocks• Typical block sizes today range from 4 to 16 kilobytesTypical block sizes today range from 4 to 16 kilobytes

Disk-arm-schedulingDisk-arm-scheduling algorithms order pending algorithms order pending accesses to tracks so that disk arm movement is accesses to tracks so that disk arm movement is minimized minimized

• elevator algorithmelevator algorithm : move disk arm in one direction (from : move disk arm in one direction (from outer to inner tracks or vice versa), processing next request in outer to inner tracks or vice versa), processing next request in that direction, till no more requests in that direction, then that direction, till no more requests in that direction, then reverse direction and repeatreverse direction and repeat

AOBD 2009/10AOBD 2009/10

File OrganizationFile Organization

File organizationFile organization – optimize block access time by – optimize block access time by organizing the blocks to correspond to how data organizing the blocks to correspond to how data will be accessedwill be accessed

E.g. Store related information on the same or nearby E.g. Store related information on the same or nearby cylinders.cylinders.

Files may get Files may get fragmentedfragmented over time over time• E.g. if data is inserted to/deleted from the fileE.g. if data is inserted to/deleted from the file• Or free blocks on disk are scattered, and newly created file Or free blocks on disk are scattered, and newly created file

has its blocks scattered over the diskhas its blocks scattered over the disk• Sequential access to a fragmented file results in increased Sequential access to a fragmented file results in increased

disk arm movementdisk arm movement Some systems have utilities to Some systems have utilities to defragmentdefragment the file the file

system, in order to speed up file accesssystem, in order to speed up file access

AOBD 2009/10AOBD 2009/10

Nonvolatile write buffersNonvolatile write buffers speed up disk writes by writing speed up disk writes by writing blocks to a non-volatile RAM buffer immediatelyblocks to a non-volatile RAM buffer immediately

Non-volatile RAM: battery backed up RAM or flash memoryNon-volatile RAM: battery backed up RAM or flash memory• Even if power fails, the data is safe and will be written to disk when Even if power fails, the data is safe and will be written to disk when

power returnspower returns Controller then writes to disk whenever the disk has no other Controller then writes to disk whenever the disk has no other

requests or request has been pending for some timerequests or request has been pending for some time Database operations that require data to be safely stored before Database operations that require data to be safely stored before

continuing can continue without waiting for data to be written to continuing can continue without waiting for data to be written to diskdisk

Writes can be reordered to minimize disk arm movementWrites can be reordered to minimize disk arm movement

Write BuffersWrite Buffers

AOBD 2009/10AOBD 2009/10

Log diskLog disk – a disk devoted to writing a sequential log of block – a disk devoted to writing a sequential log of block updatesupdates

Used exactly like nonvolatile RAMUsed exactly like nonvolatile RAM• Write to log disk is very fast since no seeks are requiredWrite to log disk is very fast since no seeks are required• No need for special hardware (NV-RAM)No need for special hardware (NV-RAM)

File systemsFile systems typically reorder writes to disk to improve typically reorder writes to disk to improve performanceperformance

Journaling file systemsJournaling file systems write data in safe order to log diskwrite data in safe order to log disk

Journaling and Log DisksJournaling and Log Disks

AOBD 2009/10AOBD 2009/10

BufferingBuffering A database file is partitioned into fixed-length A database file is partitioned into fixed-length

storage units called storage units called blocksblocks. Blocks are units of both . Blocks are units of both storage allocation and data transfer.storage allocation and data transfer. Database system seeks to minimize the number of block Database system seeks to minimize the number of block

transfers between the disk and memory. transfers between the disk and memory. The number of disk accesses can be reduced by keeping The number of disk accesses can be reduced by keeping

as many blocks as possible in main memory.as many blocks as possible in main memory.

BufferBuffer – portion of main memory available to store – portion of main memory available to store copies of disk blocks.copies of disk blocks.

Buffer managerBuffer manager – subsystem responsible for – subsystem responsible for allocating buffer space in main memory.allocating buffer space in main memory.

AOBD 2009/10AOBD 2009/10

Buffer ManagerBuffer ManagerPrograms call on the buffer manager when they Programs call on the buffer manager when they need a block from disk.need a block from disk.

• If the block is already in the bufferIf the block is already in the buffer, the requesting , the requesting program is given the address of the block in main program is given the address of the block in main memorymemory

• If the block is not in the bufferIf the block is not in the buffer,,1.1. the buffer manager allocates space in the buffer for the the buffer manager allocates space in the buffer for the

block, replacing (throwing out) some other block, if required, block, replacing (throwing out) some other block, if required, to make space for the new block.to make space for the new block.

2.2. The block that is thrown out is written back to disk only if it The block that is thrown out is written back to disk only if it was modified since the most recent time that it was written to/was modified since the most recent time that it was written to/fetched from the disk.fetched from the disk.

3.3. Once space is allocated in the buffer, the buffer manager Once space is allocated in the buffer, the buffer manager reads the block from the disk to the buffer, and passes the reads the block from the disk to the buffer, and passes the address of the block in main memory to requester. address of the block in main memory to requester.

AOBD 2009/10AOBD 2009/10

Buffer-Replacement PoliciesBuffer-Replacement Policies

Most operating systems replace the block Most operating systems replace the block least least recently used (LRU strategy)recently used (LRU strategy) use past pattern of block references as a predictor of use past pattern of block references as a predictor of

future referencesfuture references

But queries have well-defined access patterns But queries have well-defined access patterns (such as sequential scans), and a database (such as sequential scans), and a database system can use the information in a user’s query system can use the information in a user’s query to predict future referencesto predict future references

AOBD 2009/10AOBD 2009/10

Why LRU can be a bad strategy?Why LRU can be a bad strategy?LRU can be a bad strategy for certain access patterns LRU can be a bad strategy for certain access patterns

involving repeated scans of datainvolving repeated scans of data• e.g. when computing the join of 2 relations r and s by a nested e.g. when computing the join of 2 relations r and s by a nested

loops loops

for each tuple for each tuple trtr of of rr do do for each tuple for each tuple tsts of of ss do do if the tuples if the tuples trtr and and tsts match … match …

Mixed strategy with hints on replacement strategy Mixed strategy with hints on replacement strategy provided by the query optimizer is preferableprovided by the query optimizer is preferable

AOBD 2009/10AOBD 2009/10

Other Buffer-Replacement PoliciesOther Buffer-Replacement PoliciesPinned blockPinned block – memory block that is not allowed to be – memory block that is not allowed to be written back to disk, because it is being updatedwritten back to disk, because it is being updated

Toss-immediate strategyToss-immediate strategy – frees the space occupied by – frees the space occupied by a block as soon as the final tuple of that block has been a block as soon as the final tuple of that block has been processedprocessed

Most recently used (MRU) strategyMost recently used (MRU) strategy – system must pin – system must pin the block currently being processed. After the final the block currently being processed. After the final tuple of that block has been processed, the block is tuple of that block has been processed, the block is unpinned, and it becomes the most recently used unpinned, and it becomes the most recently used block.block.

AOBD 2009/10AOBD 2009/10

Other Buffer-Replacement Policies Other Buffer-Replacement Policies (cont.)(cont.)

Buffer manager can use Buffer manager can use statistical informationstatistical information regarding the probability that a request will regarding the probability that a request will reference a particular relationreference a particular relation

Buffer managers also support Buffer managers also support forced outputforced output of of blocks for the purpose of recoveryblocks for the purpose of recovery

Disk Arrays

AOBD 2009/10AOBD 2009/10

RAIDRAIDRAID: Redundant Arrays of Independent Disks RAID: Redundant Arrays of Independent Disks

disk organization techniques that manage a large numbers of disks, disk organization techniques that manage a large numbers of disks, providing a view of a single disk of providing a view of a single disk of

• high capacityhigh capacity and and high speedhigh speed by using multiple disks in parallel, and by using multiple disks in parallel, and • high reliabilityhigh reliability by storing data redundantly, so that data can be recovered by storing data redundantly, so that data can be recovered

even if a disk fails even if a disk fails

The chance that some disk out of a set of The chance that some disk out of a set of NN disks will fail is disks will fail is much higher than the chance that a specific single disk will fail.much higher than the chance that a specific single disk will fail. E.g., a system with 100 disks, each with MTTF of 100,000 hours E.g., a system with 100 disks, each with MTTF of 100,000 hours

(approx. 11 years), will have a system MTTF of 1000 hours (approx. 41 (approx. 11 years), will have a system MTTF of 1000 hours (approx. 41 days)days)

Techniques for using redundancy to avoid data loss are critical with large Techniques for using redundancy to avoid data loss are critical with large numbers of disksnumbers of disks

Originally a cost-effective alternative to large, expensive disksOriginally a cost-effective alternative to large, expensive disks• I in RAID originally stood for ``inexpensive’’I in RAID originally stood for ``inexpensive’’• Today RAIDs are used for their higher reliability and bandwidth. Today RAIDs are used for their higher reliability and bandwidth.

The “I” is interpreted as independentThe “I” is interpreted as independent

AOBD 2009/10AOBD 2009/10

Improvement of Reliability via Improvement of Reliability via RedundancyRedundancy

RedundancyRedundancy – store extra information that can be – store extra information that can be used to rebuild information lost in a disk failureused to rebuild information lost in a disk failure

E.g., E.g., MirroringMirroring (or(or shadowing shadowing))• Duplicate every disk. Logical disk consists of two physical disks.Duplicate every disk. Logical disk consists of two physical disks.• Every write is carried out on both disks; Reads can take place Every write is carried out on both disks; Reads can take place

from either diskfrom either disk• If one disk in a pair fails, data still available in the otherIf one disk in a pair fails, data still available in the other

Data loss would occur only if a disk fails, and its mirror disk also fails Data loss would occur only if a disk fails, and its mirror disk also fails before the system is repairedbefore the system is repaired

• Probability of combined event is very small, except for Probability of combined event is very small, except for dependent failure modes such as fire or building collapse or dependent failure modes such as fire or building collapse or electrical power surgeselectrical power surges

Mean time to data lossMean time to data loss depends on mean time to depends on mean time to failure, and failure, and mean time to repairmean time to repair

AOBD 2009/10AOBD 2009/10

Improvement in Performance via Improvement in Performance via ParallelismParallelism

Two main goals of parallelism in a disk system: Two main goals of parallelism in a disk system: 1.1. Load balanceLoad balance multiple small accesses to increase multiple small accesses to increase

throughputthroughput2.2. Parallelize large accessesParallelize large accesses to reduce response time. to reduce response time.

Improve transfer rateImprove transfer rate by striping data across by striping data across multiple disks.multiple disks.

AOBD 2009/10AOBD 2009/10

Improvement in Performance via Improvement in Performance via Parallelism (cont.)Parallelism (cont.)

Bit-level stripingBit-level striping – split the bits of each byte across – split the bits of each byte across multiple disksmultiple disks In an array of eight disks, write bit In an array of eight disks, write bit ii of each byte to disk of each byte to disk i.i. Each access can read data at eight times the rate of a Each access can read data at eight times the rate of a

single disk.single disk. But seek/access time worse than for a single diskBut seek/access time worse than for a single disk

• Bit level striping is not used much any moreBit level striping is not used much any more Block-level stripingBlock-level striping – with – with nn disks, block disks, block ii of a file of a file

goes to disk (goes to disk (ii mod mod nn) + 1) + 1 Requests for different blocks can run in parallel if the Requests for different blocks can run in parallel if the

blocks reside on different disksblocks reside on different disks A request for a long sequence of blocks can utilize all A request for a long sequence of blocks can utilize all

disks in paralleldisks in parallel

AOBD 2009/10AOBD 2009/10

RAID LevelsRAID Levels SchemesSchemes to provide redundancy at lower cost by using to provide redundancy at lower cost by using

disk striping combined with parity bitsdisk striping combined with parity bits Different RAID organizations, or RAID levels, have differing Different RAID organizations, or RAID levels, have differing

cost, performance and reliability characteristicscost, performance and reliability characteristics

RAID Level 1: Mirrored disks with block striping Offers best write performance.

RAID Level 0: Block striping; non-redundant. Used in high-performance applications where data lost is not critical.

AOBD 2009/10AOBD 2009/10

RAID Level 2: Memory-Style Error-RAID Level 2: Memory-Style Error-Correcting-CodesCorrecting-Codes

(ECC) with bit striping.(ECC) with bit striping.

AOBD 2009/10AOBD 2009/10

RAID Level 3RAID Level 3: Bit-Interleaved Parity: Bit-Interleaved Parity A single parity bit is enough for error correction, not just A single parity bit is enough for error correction, not just

detection, since we know which disk has faileddetection, since we know which disk has failed• When writing data, corresponding parity bits must also be computed When writing data, corresponding parity bits must also be computed

and written to a parity bit diskand written to a parity bit disk• To recover data in a damaged disk, compute XOR of bits from other To recover data in a damaged disk, compute XOR of bits from other

disks (including parity bit disk) disks (including parity bit disk)

Faster data transfer than with a single disk, but fewer Faster data transfer than with a single disk, but fewer I/Os per second since every disk has to participate in I/Os per second since every disk has to participate in every I/O. every I/O.

Subsumes Level 2 (provides all its benefits, at lower Subsumes Level 2 (provides all its benefits, at lower cost). cost).

AOBD 2009/10AOBD 2009/10

RAID Level 4: RAID Level 4: Block-Interleaved Block-Interleaved ParityParity

Uses block-level striping, and keeps a parity block Uses block-level striping, and keeps a parity block on a separate disk for corresponding blocks from on a separate disk for corresponding blocks from NN other disks. other disks. When writing data block, corresponding block of parity When writing data block, corresponding block of parity

bits must also be computed and written to parity diskbits must also be computed and written to parity disk To find value of a damaged block, compute XOR of bits To find value of a damaged block, compute XOR of bits

from corresponding blocks (including parity block) from from corresponding blocks (including parity block) from other disks.other disks.

AOBD 2009/10AOBD 2009/10

RAID Level 4 (Cont.)RAID Level 4 (Cont.) Provides higher I/O rates for independent block reads Provides higher I/O rates for independent block reads

than Level 3 than Level 3 • block read goes to a single disk, so blocks stored on different block read goes to a single disk, so blocks stored on different

disks can be read in paralleldisks can be read in parallel Provides high transfer rates for reads of multiple Provides high transfer rates for reads of multiple

blocksblocks Before writing a block, parity data must be computed Before writing a block, parity data must be computed

• Can be done by using old parity block, old value of current Can be done by using old parity block, old value of current block and new value of current block (2 block reads + 2 block block and new value of current block (2 block reads + 2 block writes)writes)

• Or by recomputing the parity value using the new values of Or by recomputing the parity value using the new values of blocks corresponding to the parity blockblocks corresponding to the parity block

More efficient for writing large amounts of data sequentiallyMore efficient for writing large amounts of data sequentially Parity block becomes a bottleneck for independent Parity block becomes a bottleneck for independent

block writes since every block write also writes to block writes since every block write also writes to parity diskparity disk

AOBD 2009/10AOBD 2009/10

RAID Level 5: Block-Interleaved Distributed Parity

Partitions data and parity among allPartitions data and parity among all N N + 1 disks, + 1 disks, rather than storing data in rather than storing data in NN disks and parity in 1 disks and parity in 1 disk.disk.

E.g., with 5 disks, parity block for E.g., with 5 disks, parity block for nnth set of blocks is th set of blocks is stored on disk (stored on disk (n modn mod 5) + 1, with the data blocks stored 5) + 1, with the data blocks stored on the other 4 disks.on the other 4 disks.

AOBD 2009/10AOBD 2009/10

RAID Level 5 (Cont.) and Level 6RAID Level 5 (Cont.) and Level 6 Higher I/O rates than Level 4. Higher I/O rates than Level 4.

• Block writes occur in parallel if the blocks and their parity Block writes occur in parallel if the blocks and their parity blocks are on different disks.blocks are on different disks.

Subsumes Level 4: provides same benefits, but Subsumes Level 4: provides same benefits, but avoids bottleneck of parity disk.avoids bottleneck of parity disk.

RAID Level 6RAID Level 6: P+Q Redundancy: P+Q Redundancy scheme; similar scheme; similar to Level 5, but stores extra redundant information to Level 5, but stores extra redundant information to guard against multiple disk failures. to guard against multiple disk failures.

Better reliability than Level 5 at a higher cost; not Better reliability than Level 5 at a higher cost; not used as widely. used as widely.

AOBD 2009/10AOBD 2009/10

Choice of RAID LevelChoice of RAID Level Factors in choosing RAID levelFactors in choosing RAID level

Monetary costMonetary cost PerformancePerformance: Number of I/O operations per second, and : Number of I/O operations per second, and

bandwidth during normal operationbandwidth during normal operation Performance during failurePerformance during failure Performance during rebuildPerformance during rebuild

• Including time taken to rebuild failed diskIncluding time taken to rebuild failed disk RAID 0 is used only when data safety is not important RAID 0 is used only when data safety is not important

E.g. data can be recovered quickly from other sourcesE.g. data can be recovered quickly from other sources Level 2 and 4 never used since they are subsumed by 3 Level 2 and 4 never used since they are subsumed by 3

and 5and 5 Level 3 is not used anymore since bit-striping forces Level 3 is not used anymore since bit-striping forces

single block reads to access all disks, wasting disk arm single block reads to access all disks, wasting disk arm movement, which block striping (level 5) avoidsmovement, which block striping (level 5) avoids

Level 6 is rarely used since levels 1 and 5 offer adequate Level 6 is rarely used since levels 1 and 5 offer adequate safety for safety for almostalmost all applications all applications

So most competition is between 1 and 5So most competition is between 1 and 5

AOBD 2009/10AOBD 2009/10

RAID Level 1 vs Level 5RAID Level 1 vs Level 5 Level 1 provides much better write performance than level 5Level 1 provides much better write performance than level 5

Level 5 requires at least 2 block reads and 2 block writes to write a single Level 5 requires at least 2 block reads and 2 block writes to write a single block, whereas Level 1 only requires 2 block writesblock, whereas Level 1 only requires 2 block writes

Level 1 preferred for high update environments such as log disksLevel 1 preferred for high update environments such as log disks Level 1 Level 1 hadhad higher storage cost than level 5 higher storage cost than level 5

disk drive capacities increasing rapidly (50%/year) whereas disk access disk drive capacities increasing rapidly (50%/year) whereas disk access times have decreased much less (x 3 in 10 years)times have decreased much less (x 3 in 10 years)

I/O requirements have increased greatly, e.g. for Web serversI/O requirements have increased greatly, e.g. for Web servers When enough disks have been bought to satisfy required rate of I/O, When enough disks have been bought to satisfy required rate of I/O,

they often have spare storage capacitythey often have spare storage capacity• so there is often no extra monetary cost for Level 1!so there is often no extra monetary cost for Level 1!

Level 5 is preferred for applications with low update rate,Level 5 is preferred for applications with low update rate,and large amounts of dataand large amounts of data

Level 1 is preferred for all other applicationsLevel 1 is preferred for all other applications

AOBD 2009/10AOBD 2009/10

Hardware IssuesHardware Issues Software RAIDSoftware RAID: RAID implementations done : RAID implementations done

entirely in software, with no special hardware entirely in software, with no special hardware supportsupport

Hardware RAIDHardware RAID: RAID implementations with : RAID implementations with special hardwarespecial hardware Use non-volatile RAM to record writes that are being Use non-volatile RAM to record writes that are being

executedexecuted

AOBD 2009/10AOBD 2009/10

Hardware Issues (Cont.)Hardware Issues (Cont.) Hot swappingHot swapping: replacement of disk while system is : replacement of disk while system is

running, without power downrunning, without power down Supported by some hardware RAID systems, Supported by some hardware RAID systems, reduces time to recovery, and improves availability greatlyreduces time to recovery, and improves availability greatly

Many systems maintain Many systems maintain spare disksspare disks which are kept which are kept online, and used as replacements for failed disks online, and used as replacements for failed disks immediately on detection of failureimmediately on detection of failure

Many hardware RAID systems ensure that a single Many hardware RAID systems ensure that a single point of failure will not stop the functioning of the point of failure will not stop the functioning of the system by using system by using Redundant power supplies with battery backupRedundant power supplies with battery backup Multiple controllers and multiple interconnections to guard Multiple controllers and multiple interconnections to guard

against controller/interconnection failuresagainst controller/interconnection failures

File Organization

AOBD 2009/10AOBD 2009/10

File OrganizationFile Organization The database is stored as a collection of The database is stored as a collection of filesfiles. .

Each file is a sequence of Each file is a sequence of recordsrecords. . A record is a sequence of fields.A record is a sequence of fields.

One approach:One approach: assume record size is fixedassume record size is fixed each file has records of one particular type only each file has records of one particular type only different files are used for different relationsdifferent files are used for different relations

This case is easiest to implementThis case is easiest to implement

AOBD 2009/10AOBD 2009/10

Fixed-Length RecordsFixed-Length Records Simple approach:Simple approach:

Store record Store record ii starting from byte starting from byte n n i i, where , where n n is the is the size of each record.size of each record.

Record access is Record access is simplesimple but records may cross blocks but records may cross blocks• Modification: do not allow records to cross block boundariesModification: do not allow records to cross block boundaries

Deletion of record iDeletion of record i (alternatives)(alternatives) move records move records ii + 1, . . ., + 1, . . ., nn

to to i, . . . , n – i, . . . , n – 11 move record move record n n to to ii do not move records, but do not move records, but

link all free records on a link all free records on a free listfree list

AOBD 2009/10AOBD 2009/10

Free ListsFree Lists Store the address of the first deleted record in the Store the address of the first deleted record in the file file

headerheader.. Use this first record to store the address of the second Use this first record to store the address of the second

deleted record, and so ondeleted record, and so on Can think of these stored addresses as Can think of these stored addresses as pointerspointers since since

they “point” to the location of a record.they “point” to the location of a record. More space efficient representation: reuse space for More space efficient representation: reuse space for

normal attributes of freenormal attributes of free records to store pointers. records to store pointers. (No pointers stored in (No pointers stored in in-use records.)in-use records.)

AOBD 2009/10AOBD 2009/10

Variable-Length RecordsVariable-Length Records Variable-length records arise in database Variable-length records arise in database

systems in several ways:systems in several ways: Storage of multiple record types in a file.Storage of multiple record types in a file. Record types that allow variable lengths for one or Record types that allow variable lengths for one or

more fields.more fields. Record types that allow repeating fields (used in Record types that allow repeating fields (used in

some older data models).some older data models).

Byte string representationByte string representation Attach an Attach an end-of-recordend-of-record ( () control character to the ) control character to the

end of each recordend of each record Difficulty with deletionDifficulty with deletion Difficulty with growthDifficulty with growth

AOBD 2009/10AOBD 2009/10

Variable-Length Records: Slotted Variable-Length Records: Slotted Page StructurePage Structure

Slotted pageSlotted page header contains: header contains: number of record entriesnumber of record entries end of free space in the blockend of free space in the block location and size of each recordlocation and size of each record

Records can be moved around within a page to keep them Records can be moved around within a page to keep them contiguous with no empty space between them; entry in the contiguous with no empty space between them; entry in the header must be updated.header must be updated.

Pointers should not point directly to record, instead they Pointers should not point directly to record, instead they should point to the entry for the record in header.should point to the entry for the record in header.

AOBD 2009/10AOBD 2009/10

Variable-Length Records (Cont.)Variable-Length Records (Cont.) Fixed-length representation: Fixed-length representation:

reserved spacereserved space pointerspointers

Reserved spaceReserved space – can use fixed-length records of – can use fixed-length records of a known maximum length; unused space in a known maximum length; unused space in shorter records filled with a null or end-of-record shorter records filled with a null or end-of-record symbol.symbol.

AOBD 2009/10AOBD 2009/10

Pointer MethodPointer Method

Pointer method Pointer method A variable-length record is represented by a list of A variable-length record is represented by a list of

fixed-length records, chained together via pointers.fixed-length records, chained together via pointers. Can be used even if the maximum record length is Can be used even if the maximum record length is

not knownnot known

AOBD 2009/10AOBD 2009/10

Pointer Method (Cont.)Pointer Method (Cont.) Disadvantage to pointer structure; space is wasted Disadvantage to pointer structure; space is wasted

in all records except the first in a a chain.in all records except the first in a a chain. Solution is to allow two kinds of block in file:Solution is to allow two kinds of block in file:

Anchor blockAnchor block – contains the first records of chain – contains the first records of chain Overflow blockOverflow block – contains records other than those that – contains records other than those that

are the first records of chairs.are the first records of chairs.

AOBD 2009/10AOBD 2009/10

Organization of Records in FilesOrganization of Records in FilesHeapHeap – a record can be placed anywhere in the file – a record can be placed anywhere in the file

where there is spacewhere there is spaceSequentialSequential – store records in sequential order, based on – store records in sequential order, based on

the value of the search key of each recordthe value of the search key of each recordHashingHashing – a hash function computed on some attribute – a hash function computed on some attribute

of each record; the result specifies in which block of of each record; the result specifies in which block of the file the record should be placedthe file the record should be placed

Records of each relation may be stored in a separate Records of each relation may be stored in a separate file. In a (multitable) file. In a (multitable) clustering file organizationclustering file organization records of several different relations can be stored in records of several different relations can be stored in the same filethe same file Motivation:Motivation: store related records on the same block to store related records on the same block to

minimize I/Ominimize I/O

AOBD 2009/10AOBD 2009/10

Sequential File OrganizationSequential File Organization Suitable for applications that require Suitable for applications that require

sequential processing of the entire file sequential processing of the entire file The records in the file are ordered by a The records in the file are ordered by a

search-keysearch-key

AOBD 2009/10AOBD 2009/10

Sequential File Organization (Cont.)Sequential File Organization (Cont.) DeletionDeletion – use pointer chains – use pointer chains InsertionInsertion – locate the position where the record is to be – locate the position where the record is to be

insertedinserted if there is free space insert there if there is free space insert there if no free space, insert the record in an if no free space, insert the record in an overflow blockoverflow block In either case, pointer chain must be updatedIn either case, pointer chain must be updated

Need to reorganize the fileNeed to reorganize the file from time to time to restore from time to time to restore sequential order sequential order

AOBD 2009/10AOBD 2009/10

Clustering File OrganizationClustering File Organization Simple file structure stores each relation in a Simple file structure stores each relation in a

separate file separate file Can instead store several relations in one file Can instead store several relations in one file

using a multitable using a multitable clusteringclustering file organizationfile organization E.g., clustering organization of E.g., clustering organization of customer customer and and

depositor:depositor:

good for queries involving depositor |X| customer, and for queries involving one single customer and his accounts

bad for queries involving only customer results in variable size records

AOBD 2009/10AOBD 2009/10

Data Dictionary StorageData Dictionary Storage

Information about relationsInformation about relations names of relationsnames of relations names and types of attributes of each relationnames and types of attributes of each relation names and definitions of viewsnames and definitions of views integrity constraintsintegrity constraints

User and accounting information, including passwordsUser and accounting information, including passwords Statistical and descriptive dataStatistical and descriptive data

number of tuples in each relationnumber of tuples in each relation Physical file organization informationPhysical file organization information

How relation is stored (sequential/hash/…)How relation is stored (sequential/hash/…) Physical location of relation Physical location of relation

• operating system file name or operating system file name or • disk addresses of blocks containing records of the relation disk addresses of blocks containing records of the relation

Information about indicesInformation about indices

Data dictionary (also called system catalog) stores metadata, that is, data about data, such as:

AOBD 2009/10AOBD 2009/10

Data Dictionary Storage (Cont.)Data Dictionary Storage (Cont.) Catalog structure: can use eitherCatalog structure: can use either

specialized data structures designed for efficient access specialized data structures designed for efficient access a set of relations, with existing system features used to a set of relations, with existing system features used to

ensure efficient accessensure efficient access

The latter alternative is usually preferredThe latter alternative is usually preferred A possible catalog representation:A possible catalog representation:

Relation-metadata = (relation-name, number-of-attributes, storage-organization, location)Attribute-metadata = (attribute-name, relation-name, domain-type, position, length)User-metadata = (user-name, encrypted-password, group)Index-metadata = (index-name, relation-name, index-type, index-attributes)View-metadata = (view-name, definition)

End of ChapterEnd of Chapter

AOBD 2009/10AOBD 2009/10