31.
What is DML Compiler?
A Functional dependency is denoted by X Y between two sets of attributes X and Y
that are subsets of R specifies a constraint on the possible tuple that can
form a relation state r of R. The constraint is for any two tuples t1 and t2 in
r if t1[X] = t2[X] then they have t1[Y] = t2[Y]. This means the value of X
component of a tuple uniquely determines the value of component Y.

Multivalued dependency denoted by X
Y specified on relation schema R, where X and Y are both subsets of R,
specifies the following constraint on any relation r of R: if two tuples t1 and
t2 exist in r such that t1[X] = t2[X] then t3 and t4 should also exist in r
with the following properties
It is based on
concept of full functional dependency. A functional dependency X
Y is full functional dependency if removal of any attribute A from X
means that the dependency does not hold any more.
A relation schema R
is in 3NF if it is in 2NF and for every FD X
A either of the following is true
A relation schema R is in BCNF if it
is in 3NF and satisfies an additional constraint that for every FD X A, X must be a candidate key.

A relation schema R
is said to be in 4NF if for every Multivalued dependency X Y that holds over R, one of following
is true
It translates DML
statements in a query language into low-level instruction that the query
evaluation engine can understand.
What is Pl-SQL ?
Procedural Language Structured Query Language
31.
What is Query evaluation engine?
It executes low-level
instruction generated by compiler.
32.
What is DDL Interpreter?
It interprets DDL
statements and record them in tables containing metadata.
34.
What is Record-at-a-time?
The Low level or Procedural
DML can specify and retrieve each record from a set of records. This retrieve
of a record is said to be Record-at-a-time.
35.
What is Set-at-a-time or
Set-oriented?
The High level or
Non-procedural DML can specify and retrieve many records in a single DML
statement. This retrieve of a record is said to be Set-at-a-time or
Set-oriented.
36.
What is Relational Algebra?
It is procedural query
language. It consists of a set of operations that take one or two relations as
input and produce a new relation.
37.
What
is Relational Calculus?
It
is an applied predicate calculus specifically tailored for relational databases
proposed by E.F. Codd. E.g. of languages based on it are DSL ALPHA, QUEL.
34.
How
does Tuple-oriented relational calculus differ from domain-oriented
relational calculus
The
tuple-oriented calculus uses a tuple variables i.e., variable whose only
permitted values are tuples of that relation. E.g. QUEL
The
domain-oriented calculus has domain variables i.e., variables that range over
the underlying domains instead of over relation. E.g. ILL, DEDUCE.
35.
What
is normalization?
It is a process of
analysing the given relation schemas based on their Functional Dependencies
(FDs) and primary key to achieve the properties
Ø Minimizing redundancy
Ø Minimizing insertion,
deletion and update anomalies.
36.
What is Functional
Dependency?
37.
When is a functional
dependency F said to be minimal?
Ø Every dependency in F has a
single attribute for its right hand side.
Ø 
We cannot replace any dependency X A in F with a dependency Y A where Y is a proper subset of X and still
have a set of dependency that is equivalent to F.
Ø We cannot remove any
dependency from F and still have set of dependency that is equivalent to F.
38.
What is Multivalued
dependency?
Ø t3[x] = t4[X] = t1[X] =
t2[X]
Ø t3[Y] =
t1[Y] and t4[Y] = t2[Y]
Ø t3[Z] =
t2[Z] and t4[Z] = t1[Z]
where [Z = (R-(X U Y)) ]
39.
What is Lossless join
property?
It guarantees that the
spurious tuple generation does not occur with respect to relation schemas after
decomposition.
34. What is 1 NF (Normal Form)?
The domain of attribute must include only atomic (simple,
indivisible) values.
35. What is Fully Functional
dependency?
36. What is 2NF?
A relation schema R is in 2NF if it is in 1NF and every non-prime
attribute A in R is fully functionally dependent on primary key.
37. What is 3NF?
Ø X is a Super-key of R.
Ø A is a prime attribute of R.
In other words, if every non prime attribute is non-transitively
dependent on primary key.
38. What is BCNF (Boyce-Codd
Normal Form)?
39. What is 4NF?
Ø X is subset or equal to (or) XY = R.
X is a super key
34. What is 5NF?
A Relation schema R is said to be 5NF if for every join
dependency {R1, R2, ..., Rn} that holds
R, one the following is true
Ø Ri = R for some i.
Ø The join dependency is implied by the set of FD, over R in which the
left side is key of R.
51. What is Domain-Key Normal Form?
A relation is said to be in DKNF if all constraints and dependencies
that should hold on the the constraint can be enforced by simply enforcing the
domain constraint and key constraint on the relation.
52. What are
partial, alternate,, artificial, compound and natural key?
Partial Key:
It is a set of attributes that can uniquely identify weak entities
and that are related to same owner entity. It is sometime called as Discriminator.
Alternate Key:
All
Candidate Keys excluding the Primary Key are known as Alternate Keys.
Artificial Key:
If no obvious key, either stand alone or
compound is available, then the last resort is to simply create a key, by
assigning a unique number to each record or occurrence. Then this is known as
developing an artificial key.
Compound Key:
If no single data element
uniquely identifies occurrences within a construct, then combining multiple
elements to create a unique identifier for the construct is known as creating a
compound key.
Natural Key:
When one of the data elements stored
within a construct is utilized as the primary key, then it is called the
natural key.
53. What is indexing
and what are the different kinds of indexing?
Indexing
is a technique for determining how quickly specific data can be found.
Types:
Ø Binary
search style indexing
Ø B-Tree
indexing
Ø Inverted
list indexing
Ø Memory
resident table
Ø Table
indexing
52. What is system
catalog or catalog relation? How is better known as?
A
RDBMS maintains a description of all the data that it contains, information
about every relation and index that it contains. This information is stored in
a collection of relations maintained by the system called metadata. It is also
called data dictionary.
53. What is meant by
query optimization?
The
phase that identifies an efficient execution plan for evaluating a query that
has the least estimated cost is referred to as query optimization.
54. What is join
dependency and inclusion dependency?
Join Dependency:
A Join dependency is generalization of Multivalued
dependency.A JD {R1, R2, ..., Rn} is said to hold over a relation R if R1, R2,
R3, ..., Rn is a lossless-join decomposition of R . There is no set of sound
and complete inference rules for JD.
Inclusion Dependency:
An Inclusion Dependency
is a statement of the form that some columns of a relation are contained in
other columns. A foreign key constraint is an example of inclusion dependency.
55. What is
durability in DBMS?
Once
the DBMS informs the user that a transaction has successfully completed, its
effects should persist even if the system crashes before all its changes are
reflected on disk. This property is called durability.
56. What do you mean
by atomicity and aggregation?
Atomicity:
Either
all actions are carried out or none are. Users should not have to worry about
the effect of incomplete transactions. DBMS ensures this by undoing the actions
of incomplete transactions.
Aggregation:
A concept which is used to model a
relationship between a collection of entities and relationships. It is used
when we need to express a relationship among relationships.
57. What is a
Phantom Deadlock?
In
distributed deadlock detection, the delay in propagating local information
might cause the deadlock detection algorithms to identify deadlocks that do not
really exist. Such situations are called phantom deadlocks and they lead to
unnecessary aborts.
58. What is a
checkpoint and When does it occur?
A
Checkpoint is like a snapshot of the DBMS state. By taking checkpoints, the
DBMS can reduce the amount of work to be done during restart in the event of subsequent
crashes.
52. What are the
different phases of transaction?
Different
phases are
Ø Analysis
phase
Ø Redo
Phase
Ø Undo
phase
53. What do you mean
by flat file database?
It
is a database in which there are no programs or user access languages. It has
no cross-file capabilities but is user-friendly and provides user-interface
management.
No comments:
Post a Comment