Unit-Iv: Database Management System
Unit-Iv: Database Management System
Unit-Iv: Database Management System
B.Com(Computers) II Year
DATABASE MANAGEMENT SYSTEM
UNIT-IV
1) Access motion Time: - The time required to move the read/write heads of the disk drive over
the desired cylinder. Sometimes termed seek time, is the time required to move the read/write heads
from their current position to a new cylinder address. Obviously, a move to an adjacent cylinder will
not take the same amount of time as a move across the entire disk surface (inner most track to outer
most track, or vice versa). As a compromise in calculation, the average access motion time may be
used-roughly the time required to move across one-half of the cylinders, although more
sophisticated methods may be used. A standard assumption is that the likelihood of access for every
record is the same giving a uniform probability distribution. The average for a uniform distribution is
halfway between the extreme values. For access motion time, the extreme would be (1) Stay
positioned over the current cylinder, or (2) Move from the inner most cylinders to the outer most or
(vice versa). Given the uniform distribution assumption, the average will be the time to move across
one-half of the cylinders. 12-20 million seconds are typical average access motion time, varying with
the make and model of the disk drive.
2) Head Activation Time: - The time required to activate a read /write head. It is the time
required to electronically activate the head i.e., over the surface the data transfer is to take place
relatively other performance factors, this time generally regarded as being negligible. Consequently,
head activation time is seldom used in performance calculations.
3) Rotational Delay: - The time required for the disk to rotate the sought-for record under the
read/write head. Rotational delay, or latency, is the third timing factor. It denotes the amount of
time required for the desired block to rotate to the head, so that the data transfer may commence.
Rotational delay depends upon two factors: How fast the disk is rotating and the location of the
block being sought in relationship to the read/write head at time of its activation physically, this time
reach from zero to the time required to complete one complete revolution of the disk(R). As an
analogy, suppose you wanted to write on the purple horse on the merry-go-round assuming there is
just one such horse). If you bought a ticket and ran to get on the merry-go-round, the likelihood that
the purple house would be just where you step on would be the same as that of any of the other
horses. If you where a fanatic and attempted this large number of times, you might eventually step
on a at precisely and point where the purple horse was located. You might also find that on
occasion you just missed it and had to wait for a complete revolution of the merry-go-round. Over
time, you would find that you were waiting about one-half revolution on average to get the purple
horse. The implication of the story is that the performance computations usually assume an average
rotational delay of R/2.
4) Data Transfer Rate: - The rate at which data can be read from the disk from the main,
memory, or equivalently, the rate at which data are written from main memory to disk. Data
Transfer Rate refers to the amount of time required to transfer data from the disk to primary
memory. It is a function of rotational speed and the density recorded data. Data Transfer Time is
usually expressed in thousands of bytes per second.
5) Data Transfer Time: - The expected time (T) to access a disk address and transfer a block
of data is estimated as
T = A+R/2+L/2
Where A is the Access motion time, R is the Rotational delay, L is the length of the block in
bytes, and D is the Data Transfer Rate.
Of the set of read/write heads can be described by the cylinder location. Thus, all tracks in a given
cylinder can be written to, or read from, without further movement of the read/write heads.
Sequential File Organization: - Sequential file organizational means that records are stored
adjacent to one another according to a key such as employee number, account number, and so forth.
A conventional implementation arranges the records in acesending order of key values. This is efficient
method of organizing records when an application. Such as a payroll program, will be updating a
significant number of the stored records.
If a sequential file is maintained on magnetic tape, its records can only be accessed in a
sequential manner. That is, if access to the tenth record in sequence is desired generally the preceding
nine records must be read. Direct access of a particular record is impossible. Consequently magnetic
tapes are not well suited for database operations and are usually relegated log files and recording
archival information.
Indexed- Sequential File Organization: - When files are sequentially organized on a disk pack,
however, direct access of records is possible. Indexed-sequential file organization provides facilities
for accessing records both sequentially and directly. Records are stored in the usual physical sequence
by primary key. In addition an index of record locations is stored on the disk. This allows records to
be accessed sequentially for applications requiring the updating of large numbers of records, as well as
providing the ability to access records directly in response to user queries.
Direct File Organization: - We have studied two forms of file organization: Sequential and indexed
sequential. We have concurrently outlined the two associated methods of file access: sequential access
and direct access. Records in a simple sequential file organization can be accessed directly, as well as
sequentially. We now turn to a discussion of a third type of file organization called direct or hashed.
Only direct access methods are applicable to this type of file organization.
4) What are the functions of DBA? What are the Establishing and Procedures?
A) DBA functions may generally fall into the areas of communicating with database users;
planning, designing, and implementing database systems; and establishing standards and procedures.
The planning, designing, and implementing of database systems.
Communicating with Users: - Database systems often have three components: a central, widely
used database containing much of the firm’s data; several functional database (e.g., for accounting)
used by a more limited set of programs; and perhaps a few dedicated database, used for a single
application (e.g., a bill-of-materials database). The important organizational issue here is that the
general impact of implementing a database system is the centralization of a significant portion of the
firm’s data.
Centralizing data through a database system tends to eliminate local ownership of data and to
reduce redundancy. Ownership and control are transferred to the central data dictionary, which
maintains a record of the ownership and use of each data element. Such a shifting of control over data
may generate resistance from some users. This resistance can be mitigated by actively educating users
as to the advantages of learning database technology: how it can make them more effective and efficient
at their jobs. The DBA, in cooperation with top management, should provide this education
Establishing standards and procedures: - organizations having few standards and procedures may
encounter difficulty in converting to the database environment, since the record shows that the integrated
data management facilitated by database systems requires good, comprehensive standards and
procedures. An organization that is beginning to implement a database system may find it useful to
examine the standards in use at other organizations that are already using database systems. For
example, the following functions form the nucleus of standards and procedures at Zeus Corporation.
1. Analysis and routing of trouble reports: - At Zeus, a formal trouble-reporting system was
established in order to report all errors to the DBA. Trouble reports are analyzed to determine
the likely cause of each reported problem. The reports are then routed to the appropriate
manager or user group for disposition. Each trouble report contains a complete log and
descriptive information. Each report requires a formal response to the report’s initiator
specifying how the problem has been resolved.
2. Monitoring of hardware and software: The status of all hardware and software is regularly
monitored, and reports of failures and consequent action are made to appropriate mangers and
user groups. Periodic analysis of hardware and software requirements is made, forming the
basis for decisions on replacement and upgrading, including needs for additional database
storage media.
4. Security: In consultation with Zeus management, security classifications are implemented that
identify which user groups are authorized to access specific data elements sin the database and
what actions may be performed thereon. Computer operations area frequently monitored to
assure that these access controls are functioning in the intended way.
5. Backup and recovery: Backup and recovery procedures are tested regularly to assure their
effectiveness in restoring the database after any disruption of service/ a disaster plan has been
drawn up and is tested periodically to make sure it works.
6. Performance evaluation: Priorities have assigned to activities that compete for database
resources, such as processing transactions, generating reports, and processing queries, system
performance is monitored by collecting statistics on transaction volume, response time, error
rates, and hardware utilization. Input is elicited from system users to monitor their satisfaction
with the system’s performance. Database size and growth is also tracked. File expansion
programs are run and database reorganizations are performed as necessary. Activity logs and
abnormal termination logs are reviewed and summaries prepared for management evaluation.
7. Integrity checking: Schedules have been developed at Zeus for testing the integrity of the date
stored in the database.
1. Integrity is concerned with making certain that operations performed by users are correct and
maintain database consistency.
2. Security is concerned with limiting users to performing only those operations that are allowed.
The possibility of hardware or software failure requires that database recovery procedures be
implemented as well. That is, means must be provided to restore databases that have been corrupted by
system malfunctions to a consistent state.
1. Theft of information
2. Unauthorized modification of data
3. Unauthorized destruction of data
Thus, database security methods focus on preventing unauthorized users from accessing the
database. Because DBMS features that make the database easy to access and manipulate also open
doors to intruders, most DBMS include security features that allow only authorized persons or
processing that can be accompanied once access is made.
Authentication: - Database access usually requires user authentication and authorization. For user
authentication, the first level of security establishes that the person seeking system the user knows, such
as log-on number and password, (2) something the user possesses, such as plastic ID card, or (3) a
physical representation of the user, such as fingerprint or voiceprint.
Authorization and views: - A view is a means of providing a user with a personalized model of the
database. It is also a useful way of limiting a user’s access to various positions of the database: Data a
user does not need to se are simply hidden from view. This simplifies system usage while promoting
security. Executing selects, projections, and joins on existing relations can represent views. The user
might also be restricted from seeing any part of the existing relation or from executing joins on certain
relations.
Types of Views: - Different types of access authorization may be allowed for a particular view, such as
the following:
1. Read authorization: allows reading, but not modification of data.
2. Insert authorization: allows insertion of new data, but no modification of existing data.
3. Update authorization: allows modification of data, but not deletion.
4. Delete authorization: allows deletion of data.
Encryption: - The various authentication and authorization measures that are standard for
protection access to database may not be adequate for highly sensitive data. In such instances, it
may be desirable to encrypt the data. Encrypted data cannot be read by an intruder unless that
party knows the method of encryption. Considerable research has been devoted to developing
encryption methods.
but database recovery procedures can restore the database to the state that existed shortly before
the failure and identify the status of transaction processing at the time of the failure. With this
capability, unprocessed transactions can be processed against the restored database to bring it back
to a fully current status.
Sources of Failure:
A useful classification of failure types includes the following:
1. System errors: the system has entered an undesirable state, such as deadlock, which prevents
the program from continuing with normal processing. This type of failure may or may not result
in corruption of data files.
2. Hardware failures: Two of the most common types of hardware failure and loss of
transmission capability over a transmission link. In the former case, the cause usually results
from the disk read/write head coming in physical contact with the disk surface.
3. Logical errors: Bad data or missing data are common conditions that may preclude a
program’s continuing with normal execution.
Recovery Procedures: -
To maintain data integrity, a transaction must be in one of the two following states:
1. Aborted: A transaction may not always complete its process successfully. To be sure the
incomplete transaction will not affect the consistent state of the database, such transactions
must be aborted, and resorting the database to the state it was in before the transaction in
question began execution. Such restoration is achieved by rollback.
2. Committed: A transaction that successfully completes its processing is said to be committed.
A committed transaction always leaves the database in a new consistent state.