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
About Attribute inheritance
Describe an data dictionary? A data dictionary is a data structure which keeps meta data about the structure of the database ie. the schema of the database.
What is called as recursive partitioning? The system repeats the splitting of the input unless each partition of the build input fits in the memory. Such partitioning is known
Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.
Consider the relations EMPLOYEE(emp#, name) ASSIGNED_TO(project#, emp#) PROJECT(project#, project_name, chief) Express the subsequent queries in Relational Algebra (i) Ge
What is a primary key? Primary key is chosen by the database designer as the principal means of identifying an entity in the entity set.
Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit
Explain Deadlock detection and recovery Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of a
1. Define and discuss Work Breakdown Structure, Critical Path Analysis, PERT charts and GANTT charts. Describe the role of each in determining scope, budgets, and schedules? What
Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I
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