Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Eliminate Redundant Data
In the "Database Relation" above, the primary key is made up of the D-ID and the Emp-ID. The database-name relies only on the D-ID. The similar database-name will appear redundantly every time its associated D-ID appears in the Database Relation. The database relation has redundancy, for example D-ID value 4 is oracle is repetitive twice. In addition, it also experiences insertion anomaly that is we cannot enter Sybase in the relation as no employee has that skill.
The deletion anomaly also exists. For instance, if we remove employee with Emp-ID 3; no employee with FoxPro knowledge lefts and the information that D-ID 3 is the code of FoxPro will be gone.
To avoid these troubles, we require second normal form. To achieve this, we isolate the attributes depending on both parts of the key from those depending only on the D- ID. This result in two relations: "Database" which gives the name for every D-ID,
and "Emp-database" which lists the databases for each employee. The employee relation is already in 2NF as all the EMP-ID determines all different attributes
Employee Relation
Emp-ID
Emp-Name
1
Gurpreet Malhotra
2
Faisal Khan
3
Manisha Kukreja
4
Sameer Singh
Emp-database
Relation
D-ID
Database Relation
Database
Access
DB2
FoxPro
Oracle
What are the problems if one were not to normalize? When do these problems surface? Ans: Database normalization, sometimes considered to as canonical synthesis, is
why are older data models are being replaced by new data models
Consider a research paper submission process. The process starts when an author submits a draft research paper (the paper may have up to 3 authors) to the chair of the organizing c
What is the difference between WHERE and HAVING clauses?. Predicates in the WHERE clause applies to every tuple while the predicate in the HAVING clause applies to groups.
Explain the two types of participation constraint. Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i
Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.
Key to represent relationship amongs tables is called ? A Key that represent the relationship between tables is called Foreign Key.
Increased overheads on update : On the drawbacks side, it will need the system to ensure that all replicas of a relation are consistent. This shows that all the replicas of the rel
Economics: It is now usually accepted that it costs less to make a system of smaller computers with the equivalent power of a one large computer. It is more cost-effective to get s
Explain nested relations? Nested relations The assumption of INF is a natural one in the bank examples we have considered. However, not all applications are best modelled
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd