Skip to main content

Computer Science & Life

Search This Blog

Dwell of Love

Get link
Facebook
X
Pinterest
Email
Other Apps

Dwell of Love

At the spike of adolescence and adult,
I pour my heart to be one.
Captivated by her imperfections,
I fell for the unendurable resistance of her.
.
.
.

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Post a Comment

Popular Posts

IEEE 784 : Floating Point Representation

Floating Point Representation: A floating point number is typically represented in binary as: Sign bit Biased-Exponent Mantissa Where, · Sign bit tells whether the number is positive or negative For positive, sign bit=0 For negative, sign bit=1 · Biased Exponent is a special integer which is added or subtracted from the exponent as described further. · Mantissa contains fraction part. Typically in a computer, the size of each of these components are fixed. Now, let us have a formal description of such numbers. Let us consider a computer architecture which supports · Sign bit of 1 bit · ...

Computing Minimal Cover of a given Functional Dependency

Computing Minimal Cover of a given Functional Dependency Introduction A canonical cover Fc for F is a set of dependencies such that F logically implies all dependencies in Fc, and Fc logically implies all dependencies in F. Furthermore, Fc must have the following properties: No functional dependency in Fc contains an extraneous attribute. Each left side of a functional dependency in Fc is unique. That is, there are no two dependencies A1->B A2->C such that A1=A2 NOTE An attribute of a functional dependency is said to be extraneous if we can remove it without changing the closure of the set of functional dependencies. The ALGORITHM Consider a set of functional dependencies F={A->BC, B->C, A->B, AB->C} STEP 1: Use rule of union to reduce the dependencies of F. UNION RULE: Dependencies, like W->Q1, W->Q2 etc. can be merged as W->Q1Q2 . Applying step 1 to our problem, F will reduce into, F1={A->BC, B...

An algorithm to find all possible candidate keys of relation.

The utmost headache for a database designer is to find the all possible key(s) or candidate key(s) of a relation. Here is the solution of that headache. I am going to give you a very efficient algorithm to find all possible key(s) of a relation. The algorithm is as follows- For a given set of functional dependencies (F) on a relation, the algorithm can be described as- Find the minimal cover of F and say it Fc. Use Fc to divide the attributes of relation R into 3 groups, namely essential attributes(L), useless attributes(R) and common attributes(M). Essential attributes are the attributes which are essentially the part of all key(s) of the relation. Useless attributes are the attributes which are not the part of the key. Common attributes are the attributes which may or may not be the part of the key. After grouping so, find all possible combination of the attributes to find the key(s). I guess your agenda is still not solved. So, in order to completely make this algori...

Powered by Blogger