Database Management System Chapter-11

 

 

Chapter 11:  Storage and File Structure

 

 

n Overview of Physical Storage Media

n Magnetic Disks

n RAID

n Tertiary Storage

n Storage Access

n File Organization

n Organization of Records in Files

n Data-Dictionary Storage

n Storage Structures for Object-Oriented Databases

 

Classification of Physical Storage Media

 

n Speed with which data can be accessed

n Cost per unit of data

n Reliability

H data loss on power failure or system crash

H physical failure of the storage device

n Can differentiate storage into:

H volatile storage: loses contents when power is switched off

H non-volatile storage:

4  Contents persist even when power is switched off.

4  Includes secondary and tertiary storage, as well as batter-backed up main-memory.

 

Physical Storage Media

 

n Cache – fastest and most costly form of storage; volatile; managed by the computer system hardware.

n Main memory:

H fast access (10s to 100s of nanoseconds; 1 nanosecond = 10^–9 seconds)

H generally too small (or too expensive) to store the entire database

4 capacities of up to a few Gigabytes widely used currently

4 Capacities have gone up and per-byte costs have decreased steadily and rapidly  (roughly factor of 2 every 2 to 3 years)

H Volatile — contents of main memory are usually lost if a power failure or system crash occurs.

 

n Flash memory

H Data survives power failure

H Data can be written at a location only once, but location can be erased and written to again

4 Can support only a limited number of write/erase cycles.

4 Erasing of memory has to be done to an entire  bank of memory

H Reads are roughly as fast as main memory

H But writes are slow (few microseconds), erase is slower

H Cost per unit of storage roughly similar to main memory

H Widely used in embedded devices such as digital cameras

H also known as EEPROM (Electrically Erasable Programmable Read-Only Memory)

n Magnetic-disk

H Data is stored on spinning disk, and read/written magnetically

H Primary medium for the long-term storage of data; typically stores entire database.

H Data must be moved from disk to main memory for access, and written back for storage

4 Much slower access than main memory (more on this later)

H direct-access –  possible to read data on disk in any order, unlike magnetic tape

H Hard disks  vs  floppy disks

H Capacities range up to roughly 100 GB currently

4 Much larger capacity and cost/byte than main memory/flash memory

4 Growing constantly and rapidly with technology improvements (factor of 2 to 3 every 2 years)

H Survives power failures and system crashes

4 disk failure can destroy data, but is very rare

n Optical storage

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

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

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

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

H Reads and writes are slower than with magnetic disk

H Juke-box systems, with large numbers of removable disks, a few drives, and a mechanism for automatic loading/unloading of disks available for storing large volumes of data

 

n Tape storage

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

H sequential-access – much slower than disk

H very high capacity (40 to 300 GB tapes available)

H tape can be removed from drive Þ storage costs much cheaper than disk, but drives are expensive

H Tape jukeboxes available for storing massive amounts of data

⁴  hundreds of terabytes (1 terabyte = 10⁹ bytes) to even a petabyte (1 petabyte = 10¹² bytes)

 

Storage Hierarchy

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n primary storage: Fastest media but volatile (cache, main memory).

n secondary storage: next level in hierarchy, non-volatile, moderately fast access time

H also called on-line storage

H E.g. flash memory, magnetic disks

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

H also called off-line storage

H E.g. magnetic tape, optical storage

 

Magnetic Hard Disk Mechanism

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

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

 

 

Magnetic Disks

 

n  Read-write head

H Positioned very close to the platter surface (almost touching it)

H Reads or writes magnetically encoded information.

n  Surface of platter divided into circular tracks

H Over 16,000 tracks per platter on typical hard disks

n  Each track is divided into sectors. 

H A sector is the smallest unit of data that can be read or written.

H Sector size typically 512 bytes

H Typical sectors per track: 200 (on inner tracks) to 400 (on outer tracks)

n  To read/write a sector

H disk arm swings to position head on right track

H platter spins continually; data is read/written as sector passes under head

n  Head-disk assemblies

H multiple disk platters on a single spindle (typically 2 to 4)

H one head per platter, mounted on a common arm.

n  Cylinder i consists of i^th track of all the platters

 

n Earlier generation disks were susceptible to head-crashes

H Surface of earlier generation disks had metal-oxide coatings which would disintegrate on head crash and damage all data on disk

H Current generation disks are less susceptible to such disastrous failures, although individual sectors may get corrupted

n Disk controller – interfaces between the computer system and the disk drive hardware.

H accepts high-level commands to read or write a sector

H initiates actions such as moving the disk arm to the right track and actually reading or writing the data

H Computes and attaches checksums to each sector to verify that data is read back correctly

4 If data is corrupted, with very high probability stored checksum won't match recomputed checksum

H Ensures successful writing by reading back sector after writing it

H Performs remapping of bad sectors

 

 

 

Disk Subsystem

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n Multiple disks connected to a computer system through a controller

H Controllers functionality (checksum, bad sector remapping) often carried out by individual disks; reduces load on controller

n Disk interface standards families

H ATA (AT adaptor) range of standards

H SCSI (Small Computer System Interconnect) range of standards

H Several variants of each standard (different speeds and capabilities)

 

Performance Measures of Disks

 

n  Access time – the time it takes from when a read or write request is issued to when data transfer begins.  Consists of:

H Seek time – time it takes to reposition the arm over the correct track.

4  Average seek time is 1/2 the worst case seek time.

–  Would be 1/3 if all tracks had the same number of sectors, and we ignore the time to start and stop arm movement

4 4 to 10 milliseconds on typical disks

H Rotational latency – time it takes for the sector to be accessed to appear under the head.

4  Average latency is 1/2 of the worst case latency.

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

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

H 4 to 8 MB per second is typical

H Multiple disks may share a controller, so rate that controller can handle is also important

4 E.g. ATA-5: 66 MB/second,  SCSI-3: 40 MB/s

4 Fiber Channel: 256 MB/s

 

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

H Typically 3 to 5 years

H Probability of failure of new disks is quite low, corresponding to a
"theoretical MTTF" of 30,000 to 1,200,000 hours for a new disk

4 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 every 1200 hours

H MTTF decreases as disk ages

 

 

Optimization of Disk-Block Access

 

n Block – a contiguous sequence of sectors from a single track

H data is transferred between disk and main memory in blocks

H sizes range from 512 bytes to several kilobytes

4 Smaller blocks: more transfers from disk

4 Larger blocks:  more space wasted due to partially filled blocks

4 Typical block sizes today range from 4 to 16 kilobytes

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

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

 

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

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

H Files may get fragmented over time

4 E.g. if data is inserted to/deleted from the file

4 Or free blocks on disk are scattered, and newly created file has its blocks scattered over the disk

4 Sequential access to a fragmented file results in increased disk arm movement

H Some systems have utilities to defragment the file system, in order to speed up file access

 

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

H Non-volatile RAM:  battery backed up RAM or flash memory

4 Even if power fails, the data is safe and will be written to disk when power returns

H Controller then writes to disk whenever the disk has no other requests or request has been pending for some time

H Database operations that require data to be safely stored before continuing can continue without waiting for data to be written to disk

H Writes can be reordered to minimize disk arm movement

n  Log disk – a disk devoted to writing a sequential log of block updates

H  Used exactly like nonvolatile RAM

4 Write to log disk is very fast since no seeks are required

4 No need for special hardware (NV-RAM)

n  File systems typically reorder writes to disk to improve performance

H Journaling file systems write data in safe order to NV-RAM or log disk

H Reordering without journaling: risk of corruption of file system data

 

RAID

 

n  RAID: Redundant Arrays of Independent Disks

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

4 high capacity and high speed  by using multiple disks in parallel, and

4 high reliability by storing data redundantly, so that data can be recovered even if  a disk fails

n  The chance that some disk out of a set of N disks will fail is much higher than the chance that a specific single disk will fail.

H   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 days)

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

n  Originally a cost-effective alternative to large, expensive disks

H I in RAID originally stood for ``inexpensive''

H Today RAIDs are used for their higher reliability and bandwidth. 

4 The "I" is interpreted as independent

 

Improvement of Reliability via Redundancy

 

n Redundancy – store extra information that can be used to rebuild information lost in a disk failure

n E.g., Mirroring (or shadowing)

H Duplicate every disk.  Logical disk consists of two physical disks.

H Every write is carried out on both disks

4 Reads can take place from either disk

H If one disk in a pair fails, data still available in the other

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

–  Probability of combined event is very small

»  Except for dependent failure modes such as fire or building collapse or electrical power surges

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

H E.g. MTTF of 100,000 hours, mean time to repair of 10 hours gives mean time to data loss of 500*10⁶ hours (or 57,000 years) for a mirrored pair of disks (ignoring dependent failure modes)

 

Improvement in Performance via Parallelism

 

n Two main goals of parallelism in a disk system:

1.  Load balance multiple small accesses to increase throughput

2.  Parallelize large accesses to reduce response time.

n Improve transfer rate by striping data across multiple disks.

n Bit-level striping – split the bits of each byte across multiple disks

H In an array of eight disks, write bit i of each byte to disk i.

H Each access can read data at eight times the rate of a single disk.

H But seek/access time worse than for a single disk

4 Bit level striping is not used much any more

n Block-level striping – with n disks, block i of a file goes to disk (i mod n) + 1

H Requests for different blocks can run in parallel if the blocks reside on different disks

H A request for a long sequence of blocks can utilize all disks in parallel

 

RAID Levels

 

n Schemes to provide redundancy at lower cost by using disk striping combined with parity bits

RAID Level 0:  Block striping; non-redundant.

 Used in high-performance applications where data lost is not critical.

 

 

RAID Level 1:  Mirrored disks with block striping

 Offers best write performance. 

 Popular for applications such as storing log files in a database system.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

H Different RAID organizations, or RAID levels, have differing cost, performance and reliability characteristics

 

n RAID Level 2:  Memory-Style Error-Correcting-Codes (ECC) with bit striping.

n RAID Level 3: Bit-Interleaved Parity

H  a single parity bit is enough for error correction, not just detection, since we know which disk has failed

4 When writing data, corresponding parity bits must also be computed and written to a parity bit disk

4 To recover data in a damaged disk, compute XOR of bits from other disks (including parity bit disk)

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n RAID Level 3 (Cont.)

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

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

n RAID Level 4:  Block-Interleaved Parity; uses block-level striping, and keeps a parity block on a separate disk for corresponding blocks from N other disks.

H When writing data block, corresponding block of parity bits must also be computed and written to parity disk

H To find value of a damaged block, compute XOR of bits from corresponding blocks (including parity block) from other disks.

 

 

 

 

 

 

 

 

 

 

 

n RAID Level 4 (Cont.)

H Provides higher I/O rates for independent block reads than Level 3

4 block read goes to a single disk, so blocks stored on different disks can be read in parallel

H Provides high transfer rates for reads of multiple blocks than no-striping

H Before writing a block, parity data must be computed

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

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

–  More efficient for writing large amounts of data sequentially

H Parity block becomes a bottleneck for independent block writes since every block write also writes to parity disk

 

n RAID Level 5:  Block-Interleaved Distributed Parity; partitions data and parity among all N + 1 disks, rather than storing data in N disks and parity in 1 disk.

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n RAID Level 5 (Cont.)

H Higher I/O rates than Level 4. 

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

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

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

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

 

 

 

 

 

 

 

 

 

 

 

Choice of RAID Level

 

n  Factors in choosing RAID level

H Monetary cost

H Performance: Number of I/O operations per second, and bandwidth during normal operation

H Performance during failure

H Performance during rebuild of failed disk

4 Including time taken to rebuild failed disk

n  RAID 0 is used only when data safety is not important

H E.g. data can be recovered quickly from other sources

n  Level 2 and 4 never used since they are subsumed by 3 and 5

n  Level 3 is not used anymore since bit-striping forces single block reads to access all disks, wasting disk arm movement, which block striping (level 5) avoids

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

n  So competition is between 1 and 5 only

 

 

n Level 1 provides much better write performance than level 5

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

H Level 1 preferred for high update environments such as log disks

n Level 1 had higher storage cost than level 5

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

H I/O requirements have increased greatly, e.g. for Web servers

H When enough disks have been bought to satisfy required rate of I/O, they often have spare storage capacity

4  so there is often no extra monetary cost for Level 1!

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

n  Level 1 is preferred for all other applications

 

Hardware Issues

 

n Software RAID:  RAID implementations done entirely in software, with no special hardware support

n Hardware RAID:  RAID implementations with special hardware

H Use non-volatile RAM to record writes that are being executed

H Beware:  power failure during write can result in corrupted disk

4 E.g. failure after writing one block but before writing the second in a mirrored system

4 Such corrupted data must be detected when power is restored

–  Recovery from corruption is similar to recovery from failed disk

–  NV-RAM helps to efficiently detected potentially corrupted blocks

»  Otherwise all blocks of disk must be read and compared with mirror/parity block

 

n Hot swapping: replacement of disk while system is running, without power down

H Supported by some hardware RAID systems,

H reduces time to recovery, and improves availability greatly

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

H Reduces time to recovery greatly

n Many hardware RAID systems ensure that a single point of failure will not stop the functioning of the system by using

H Redundant power supplies with battery backup

H Multiple controllers and multiple interconnections to guard against controller/interconnection failures

 

Optical Disks

 

n Compact disk-read only memory (CD-ROM)

H Disks can be loaded into or removed from a drive

H High storage capacity (640 MB per disk)

H High seek times or about 100 msec (optical read head is heavier and slower)

H Higher latency (3000 RPM) and lower data-transfer rates (3-6 MB/s) compared to magnetic disks

n Digital Video Disk (DVD)

H DVD-5  holds 4.7 GB , and DVD-9 holds 8.5 GB

H DVD-10 and DVD-18 are double sided formats with capacities of 9.4 GB and 17 GB

H Other characteristics similar to CD-ROM

n Record once versions (CD-R and DVD-R) are becoming popular

H data can only be written once, and cannot be erased.

H high capacity and long lifetime; used for archival storage

H Multi-write versions (CD-RW, DVD-RW and DVD-RAM) also available

 

Magnetic Tapes

 

n  Hold large volumes of data and provide high transfer rates

H Few GB for DAT (Digital Audio Tape) format, 10-40 GB with DLT (Digital Linear Tape) format, 100 GB+ with Ultrium format, and 330 GB with Ampex helical scan format

H Transfer rates from few to 10s of MB/s

n  Currently the cheapest storage medium

H Tapes are cheap, but cost of drives is very high

n  Very slow access time in comparison to magnetic disks and optical disks

H  limited to sequential access.

H Some formats (Accelis) provide faster seek (10s of seconds) at cost of lower capacity

n  Used mainly for backup, for storage of infrequently used information, and as an off-line medium for transferring information from one system to another.

n  Tape jukeboxes used for very large capacity storage

H (terabyte (10¹² bytes) to petabye (10¹⁵ bytes)

 

Storage Access

 

n A database file is partitioned into fixed-length storage units called blocks.  Blocks are units of both storage allocation and data transfer.

n Database system seeks to minimize the number of block transfers between the disk and memory.  We can reduce the number of disk accesses by keeping as many blocks as possible in main memory.

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

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

 

Buffer Manager

 

n  Programs call on the buffer manager when they need a block from disk.

H  If the block is already in the buffer, the requesting program is given the address of the block in main memory

H  If the block is not in the buffer,

4  the buffer manager allocates space in the buffer for the block, replacing (throwing out) some other block, if required, to make space for the new block.

4 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/fetched from the disk.

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

 

Buffer-Replacement Policies

 

n Most operating systems replace the block least recently used (LRU strategy)

n Idea behind LRU – use past pattern of block references as a predictor of future references

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

H LRU can be a bad strategy for certain access patterns involving repeated scans of data

4  e.g. when computing the join of 2 relations r and s by a nested loops
  for each tuple tr of r do
     for each tuple ts of s do
       if the tuples tr and ts match …

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

 

n Pinned block – memory block that is not allowed to be written back to disk.

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

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

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

H E.g., the data dictionary is frequently accessed.  Heuristic:  keep data-dictionary blocks in main memory buffer

n Buffer managers also support forced output of blocks for the purpose of recovery (more in Chapter 17)

 

File Organization

 

n The database is stored as a collection of files.  Each file is a sequence of records.  A record is a sequence of fields.

n One approach:

H assume record size is fixed

H each file has records of one particular type only

H different files are used for different relations

This case is easiest to implement; will consider variable length records

later.

 

Fixed-Length Records

 

n Simple approach:

H Store record i starting from byte n * (i – 1), where n is the size of each record.

H Record access is simple but records may cross blocks

4 Modification: do not allow records to cross block boundaries

n Deletion of record I:
alternatives:

H move records i + 1, . . ., n
to i, . . . , n – 1

H move record n  to i

H do not move records, but
link all free records on a
free list

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Free Lists

 

n  Store the address of the first deleted record in the file header.

n  Use this first record to store the address of the second deleted record, and so on

n  Can think of these stored addresses as pointers since they "point" to the location of a record.

n  More space efficient representation:  reuse space for normal attributes of free records to store pointers.  (No pointers stored in in-use records.)

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Variable-Length Records

 

n Variable-length records arise in database systems in several ways:

H Storage of multiple record types in a file.

H Record types that allow variable lengths for one or more fields.

H Record types that allow repeating fields (used in some older data models).

n Byte string representation

H Attach an end-of-record (^) control character to the end of each record

H Difficulty with deletion

H Difficulty with growth

 

 

 

 

 

 

 

Variable-Length Records: Slotted Page Structure

 

 

 

 

 

 

 

 

 

 

 

n Slotted page header contains:

H number of record entries

H end of free space in the block

H location and size of each record

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

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

n Fixed-length representation:

H reserved space

H pointers

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Pointer Method

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n Pointer method

H A variable-length record is represented by a list of fixed-length records, chained together via pointers.

H Can be used even if the maximum record length is not known

 

n Disadvantage to pointer structure; space is wasted in all records except the first in a a chain.

n Solution is to allow two kinds of block in file:

H Anchor block – contains the first records of chain

H Overflow block – contains records other than those that are the first records of chairs.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Organization of Records in Files

 

n Heap – a record can be placed anywhere in the file where there is space

n Sequential – store records in sequential order, based on the value of the search key of each record

n Hashing – a hash function computed on some attribute of each record; the result specifies in which block of the file the record should be placed

n Records of each relation may be stored in a separate file. In a  clustering file organization  records of several different relations can be stored in the same file

H Motivation: store related records on the same block to minimize I/O

 

Sequential File Organization

 

n Suitable for applications that require sequential processing of the entire file

n The records in the file are ordered by a search-key

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n Deletion – use pointer chains

n Insertion –locate the position where the record is to be inserted

H if there is free space insert there

H if no free space, insert the record in an overflow block

H In either case, pointer chain must be updated

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Clustering File Organization

 

n Simple file structure stores each relation in a separate file

n Can instead store several relations in one file using a clustering file organization

n E.g., clustering organization of customer and depositor:

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

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

bad for queries involving only customer

results in variable size records

 

 

 

Data Dictionary Storage

 

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

 

 

n  Information about relations

H names of relations

H names and types of attributes of each relation

H names and definitions of views

H integrity constraints

n  User and accounting information, including passwords

n  Statistical and descriptive data

H number of tuples in each relation

n  Physical file organization information

H How relation is stored (sequential/hash/…)

H Physical location of relation

4 operating system file name or

4 disk addresses of blocks containing records of the relation

n  Information about indices (Chapter 12)

 

n Catalog structure:  can use either

H specialized data structures designed for efficient access

H a set of relations, with existing system features used to ensure efficient access

The latter alternative is usually preferred

n 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)

 

 

 

   

Mapping of Objects to Files

 

n Mapping objects to files is similar to mapping tuples to files in a relational system; object data can be stored using file structures.

n Objects in O-O databases may lack uniformity and may be very large; such objects have to managed differently from records in a relational system.

H Set fields with a small number of elements may be implemented using data structures such as linked lists. 

H Set fields with a larger number of elements may be implemented as separate relations in the database.

H Set fields can also be eliminated at the storage level by normalization.

4 Similar to conversion of multivalued attributes of E-R diagrams to relations

 

n Objects are identified by an object identifier (OID); the storage system needs a mechanism to locate an object given its OID (this action is called dereferencing).

H logical identifiers do not directly specify an object's physical location; must maintain an index that maps an OID to the object's actual location.

H physical identifiers encode the location of the object so the object can be found directly.  Physical OIDs typically have the following parts:

   1.  a volume or file identifier

   2.  a page identifier within the volume or file

3.     an offset within the page

 

Management of Persistent Pointers

 

n Physical OIDs may be a unique identifier.  This identifier is stored in the object also and is used to detect references via dangling pointers.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n Implement persistent pointers using OIDs; persistent pointers are substantially longer than are in-memory pointers

n Pointer swizzling cuts down on cost of locating persistent objects already in-memory.

 

n Software swizzling (swizzling on pointer deference)

H When a persistent pointer is first dereferenced, the pointer is swizzled (replaced by an in-memory pointer) after the object is located in memory.

H Subsequent dereferences of of the same pointer become cheap.

H The physical location of an object in memory must not change if swizzled pointers pont to it; the solution is to pin pages in memory

H When an object is written back to disk, any swizzled pointers it contains need to be unswizzled.

 

Hardware Swizzling

 

n With hardware swizzling, persistent pointers in objects need the same amount of space as in-memory pointers — extra storage external to the object is used to store rest of pointer information.

n Uses virtual memory translation mechanism to efficiently and transparently convert between persistent pointers and in-memory pointers.

n All persistent pointers in a page are swizzled when the page is first read in.

H thus programmers have to work with just one type of pointer, i.e., in-memory pointer.

H some of the swizzled pointers may point to virtual memory addresses that are currently not allocated any real memory (and do not contain valid data)

Hardware Swizzling

 

n Persistent pointer is conceptually split into two parts:  a page identifier, and an offset within the page.

H The page identifier in a pointer is a short indirect pointer: Each page has a translation table that provides a mapping from the short page identifiers to full database page identifiers.

H Translation table for a page is small (at most 1024 pointers in a 4096 byte page with 4 byte pointer)

H Multiple pointers in page to the same page share same entry in the translation table.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n Page image before swizzling (page located on disk)

n  When system loads a page into memory the persistent pointers in the page are swizzled as described below

H  Persistent pointers in each object in the page are located using object type information

_n   For each persistent pointer (p_i, o_i)  find its full page ID P_i

_H   If P_i does not already have a virtual memory page allocated to it, allocate a virtual memory page to P_i and read-protect the page

H  Note: there need not be any physical space (whether in memory or on disk swap-space) allocated for the virtual memory page at this point.  Space can be allocated later if (and when) P_i is accessed.  In this case read-protection is not required.

H  Accessing a memory location in the page in the will result in a segmentation violation, which is handled as described later

_H   Let v_i be the virtual page allocated to P_i (either earlier or above)

H  Replace (p_i, o_i) by (v_i, o_i)

H  Replace each entry (p_i, P_i) in the translation table, by (v_i, P_i)

 

 

n  When an in-memory pointer is dereferenced, if the operating system detects the page it points to has not yet been allocated storage, or is read-protected, a segmentation violation occurs.

n  The mmap() call in Unix is used to specify a function to be invoked on segmentation violation

n  The function does the following when it is invoked

H  Allocate storage (swap-space) for the page containing the referenced address, if storage has not been allocated earlier.  Turn off read-protection

H  Read in the page from disk

H  Perform pointer swizzling for each persistent pointer in the page, as described earlier

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

n Page with short page identifier 2395 was allocated address 5001.  Observe change in pointers and translation table.

n Page with short page identifier 4867 has been allocated address 4867.  No change in pointer and translation table.

 

n After swizzling, all short page identifiers point to virtual memory addresses allocated for the corresponding pages

H functions accessing the objects are not even aware that it has persistent pointers, and do not need to be changed in any way!

H can reuse existing code and libraries that use in-memory pointers

n After this, the pointer dereference that triggered the swizzling can continue

n Optimizations:

H If all pages are allocated the same address as in the short page identifier, no changes required in the page!

H No need for deswizzling — swizzled page can be saved as-is to disk

H A set of pages (segment) can share one translation table. Pages can still be swizzled as and when fetched (old copy of translation table is needed).

n A process should not access more pages than size of virtual memory — reuse of virtual memory addresses for other pages is expensive

 

Disk versus Memory Structure of Objects

 

n The format in which objects are stored in memory may be different from the formal in which they are stored on disk in the database.  Reasons are:

H software swizzling – structure of persistent and in-memory pointers are different

H database accessible from different machines, with different data representations

H Make the physical representation of objects in the database independent of the machine and the compiler.

H Can transparently convert from disk representation to form required on the specific machine, language, and compiler, when the object (or page) is brought into memory.

 

Large Objects

 

n Large objects : binary large objects (blobs) and character large objects (clobs)

H Examples include:

4 text documents

4 graphical data such as images and computer aided designs audio and video data

n Large objects may need to be stored in a contiguous sequence of bytes when brought into memory.

H If an object is bigger than a page, contiguous pages of the buffer pool must be allocated to store it.

H May be preferable to disallow direct access to data, and only allow access through a file-system-like API, to remove need for contiguous storage.

Modifying Large Objects

 

n If the application requires insert/delete of bytes from specified regions of an object:

H B⁺-tree file organization (described later in Chapter 12) can be modified to represent large objects

H Each leaf page of the tree stores between half and 1 page worth of data from the object

n Special-purpose application programs outside the database are used to manipulate large objects:

H Text data treated as a byte string manipulated by editors and formatters.

H Graphical data and audio/video data is typically created and displayed by separate application

H checkout/checkin method for concurrency control and creation of versions

 

 

 

End of Chapter