Professional Documents
Culture Documents
ONLINE ASIGNMENT
Ans:
Database Administrator
Database administration involves activities related to database management and
control. Broadly, a database administrator must ensure that the database
is available to users at all times. Database administration includes data
back-up and recovery, performance tuning and analysis and to some
extent may include database design. The exact administration tasks
would depend on the kind of database being administered and prevailing
information technology policies of the organization.
The latest trends in database administration would suggest that most of the
routine tasks of back-up is being accomplished by the software itself.
However disaster recovery and performance tuning, still remains within
the scope of human involvement.
· The DBA will regularly check and analyze the data and make appropriate
suggestions with respect to efficiency and performance of the data
storage.
· When the database design is in its initial stage then DBA can play a
significant role. Because of his participation through out the design phase
of database most of the problems that might take place can be removed.
· Develop and enforce both database and OS-level security policies for data
protection.
· create and improve database administrative programs, which are both written
in perl, and/or UNIX bash shell.
Q3 Explain the distinctions among the terms primary key, foreign key,
candidate key, composite key and super key?
ANS::
Super keys- A superkey is a set of one or more attributes that, taken
collectively, allow us to uniquely identify a tuple in the relation.
E.g.—The customer-id attribute of the relation customer is sufficient to
distinguish one customer tuple from another. Thus customer-id is a superkey.
Also the combination of customer-name and customer-id is a superkey.
Customer name cannot be a superkey since several people may have same
name.
A superkey may consist of extraneous attributes.
Candidate keys- Super keys for which no proper subset is a superkey are
called candidate keys. Several distinct sets of attributes can serve as a
candidate key. Suppose the combination {customer-name, customer-street}
uniquely identifies a relation in a table.
{Customer-id} can also identify a relation uniquely. Then, the combination
{customer-name, customer-id} is not a candidate key because customer-id
itself alone is a candidate key.
Foreign key- A relational schema, say r1, may include among its attributes
the primary key of another relation schema, say r2. This attribute is called a
foreign key from r1, referencing r2. The relation r1 is also called the
referencing relation of the foreign key dependency, and r2 is called the
referenced relation of the foreign key.
Ans: GENERALIZATION:
A generalization hierarchy is a form of abstraction that specifies that
two or more entities that share common attributes can be generalized into a
higher level entity type called a super type or generic type. The lower levels
of entities become the subtype or categories, to the super type. Sub types are
independent entities.
EXAMPLE:
Account is the higher level entity set and savings account and current
account are lower level entity sets.
AGGREGATION:-
It is the process of compiling information on an object , thereby abstracting a
higher level object.
AFTER AGGREGATION