Scribd
Upload
47 views2 pages

Interview Ques Ans

Normalization is a process that organizes data to minimize redundancy and dependency. It involves analyzing relations and their functional dependencies to achieve 1NF, 2NF, 3NF, BCNF, 4NF and 5NF. These normal forms have specific rules for attributes and keys to reduce anomalies on updates, inserts and deletes. Indexing is a technique to improve data retrieval speed using different types like binary search, B-Tree, inverted lists, memory tables and table indexing. A phantom deadlock occurs in distributed systems when deadlock detection algorithms incorrectly identify nonexistent deadlocks due to delays in propagating information across nodes.

Uploaded by

RKKhatri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views2 pages

Interview Ques Ans

Normalization is a process that organizes data to minimize redundancy and dependency. It involves analyzing relations and their functional dependencies to achieve 1NF, 2NF, 3NF, BCNF, 4NF and 5NF. These normal forms have specific rules for attributes and keys to reduce anomalies on updates, inserts and deletes. Indexing is a technique to improve data retrieval speed using different types like binary search, B-Tree, inverted lists, memory tables and table indexing. A phantom deadlock occurs in distributed systems when deadlock detection algorithms incorrectly identify nonexistent deadlocks due to delays in propagating information across nodes.

Uploaded by

RKKhatri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

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
(1).Minimizing redundancy, (2). Minimizing insertion, deletion and update anomalies.
What is 1 NF (Normal Form)?
The domain of attribute must include only atomic (simple, indivisible) values.
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.
What is 3NF?
A relation schema R is in 3NF if it is in 2NF and for every FD X A either of the following is true
1. X is a Super-key of R.
2. A is a prime attribute of R.
3. What is BCNF (Boyce-Codd Normal Form)?
4. 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.
What is 4NF?
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.
1.) X is subset or equal to (or) XY = R.
2.) X is a super key.
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 1.) Ri = R for some i.
2.) The join dependency is implied by the set of FD, over R in which the left side is key of R.
What are partial, alternate,, artificial, compound and natural key?
1. 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.
2. Alternate Key: All Candidate Keys excluding the Primary Key are known as Alternate Keys.
3. 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.
4. 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.
5. 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.
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:
1. Binary search style indexing
2. B-Tree indexing
3. Inverted list indexing
4. Memory resident table
5. Table indexing
What is a Phantom Deadlock?
6. 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.

You might also like