Modern Database Management
Modern Database Management
13th Edition
ISBN: 9780134792293
Author: Hoffer
Publisher: PEARSON
bartleby

Concept explainers

bartleby

Videos

Textbook Question
Book Icon
Chapter 4, Problem 4.1RQ

Define each of the following terms:

  1. determinant
  2. functional dependency
  3. transitive dependency
  4. recursive foreign key
  5. normalization
  6. composite key
  7. candidate key
  8. normal form
  9. partial functional dependency
  10. enterprise key
  11. surrogate primary key

Expert Solution
Check Mark
Program Plan Intro

(a)

Definition of determinant

Explanation of Solution

Determinant is an attribute of the database table that is used todetermines the corresponding values of another column in the same table uniquely. As given in the definition any primary key attribute, candidate key attribute, or any non-prime attribute, non-candidate attribute can be a determinant. Consider the table given below:

Employee_ID Employee_name Employee_salary
101 ram 20000
102 Shyam 10000
103 Rita 30000

In the given table the employee_ID is considered as a determinant and it is also a prime key attribute here. as here, only employee_ID can identify the value of the other columns uniquely, whereas no other can.

Expert Solution
Check Mark
Program Plan Intro

(b)

Definition of functional dependency

Explanation of Solution

It helps in identifying the table attributes which are related and dependent to each other. For example: if there are two columns in the table A and B. Then the functional dependency between them is represented as:

A→B

Here, all the attribute in the column A is functionally dependent on B. Consider the table given below:

Employee_ID Employee_name
101 ram
102 Shyam
103 Rita

Here employee_ID→employee_name

(As if we know the employee ID, then we definitely get the name of the employee), i.e., employee_ID is functionally dependent on employee_name

Expert Solution
Check Mark
Program Plan Intro

(c)

Definition of transitive dependency

Explanation of Solution

A dependency is to be transitive only if it is formed by two functional dependencies indirectly. Consider the relations given below:

A→B

B→C

Here, A is functionally dependent on B, and B is functionally dependent on C. As here, C is formed by the combination of two functional dependencies; hence, we can conclude that C is having transitive dependency. It only occurs when there are three or more attribute in a given relation. It helps us in normalizing the database in 3NF (i.e., 3 rd Normal Form)

Expert Solution
Check Mark
Program Plan Intro

(d)

Definition of recursive foreign key

Explanation of Solution

Foreign key is a key which represents the primary key attributes in the table. Recursive foreign key is a foreign key which refers to the primary key in the same table. Consider a scenario of table having details of employee and managers. Here, managers are also employees. In the column of employee ID the ID of all the employees are present. In the column of the manager ID, only some employees that are managers have their unique identity, and the rest is null. Here employee ID is not null, but the manger ID can be null, in the case of those employees which are not managers.

Expert Solution
Check Mark
Program Plan Intro

(e)

Definition of normalization

Explanation of Solution

Normalization is used to remove the redundancy (i.e., duplication and replication) and dependency of the data.it helps in making searching, sorting, indexing, retrieval of data, etc. easy. It also helps in increasing efficiency, accessibility of data. Type of normalization is given below:

  1. 1 NF
  2. 2 NF
  3. 3 NF
  4. Boycee Codd Normal Form
  5. 6 NF
Expert Solution
Check Mark
Program Plan Intro

(f)

Definition of composite key

Explanation of Solution

It is a combination of two or more columns in the table. It can be used to identify each row in the table uniquely. Here, when the candidate key is combined it must be unique; however, if it is taken individually then this it is not necessary to be unique. It is also known as concatenated key. Consider an example of student ID and class ID, here it is also possible that a student is enrolled in 2 or more subject. And a course ID is also associated with the more than one student ID. In case to identify the proper details of student with course ID, we need to use both values of course ID and the student ID i.e., candidate key.

Expert Solution
Check Mark
Program Plan Intro

(g)

Definition of candidate key

Explanation of Solution

An attribute or a combination of attribute that helps in identifying a row in relation.it value is not null and unique for attributes.it can be simple or composite key. There can be multiple candidate keys in the database, and it is also possibly that among that candidate key one is the primary key.

Expert Solution
Check Mark
Program Plan Intro

(h)

Definition of normal form

Explanation of Solution

Normal forms are given below:

  1. 1NF(First normal form )
  2. Second normal form
  3. Third normal form
  4. BCNF
  5. Fourth normal form
  • 1 NF: table must follow the given properties for being in the first normal form:
  • 1. Attributes should be single valued.

    2. Columns name must be unique

    3. Here, ordering of data does not matter

  • Second normal form: table must follow the given properties for being in the second normal form:

    1. It should be in 1 NF

    2. There is no partial dependency

  • Third normal form: table must follow the given properties for being in the third normal form
  • 1. it should be in 2 NF

    2. There is no transitive dependency

  • BCNF (Boyce Codd Normal Form): it is a upgraded version of the 3 NF.
  • 1. Here, the given should be in 3 rd normal form

    2. And for each functional dependency (X(Y) there should be a super key. >

  • Fourth normal form: conditions are given below:
  • 1. It sould be in BCNF

    2. And, there is no multivalued attribute.

Expert Solution
Check Mark
Program Plan Intro

(i)

Definition of partial functional dependency

Explanation of Solution

Partial functional dependency means that a non-prime attribute is functionally dependent on a part of a candidate key.

Expert Solution
Check Mark
Program Plan Intro

(j)

Definition of enterprise key

Explanation of Solution

The term enterprise key is given by expert developer to the prime key if it is unique for the whole database, and not only for a relation. And the concept of making the prime key more like as in the object-oriented environment is known as an object identifier.

Expert Solution
Check Mark
Program Plan Intro

(k)

Definition of surrogate primary key

Explanation of Solution

Surrogate primary key is developed to make the key structure easy. This key is developed for the purpose of data analysis. This key is not displayed to users. Surrogate primary key can be available when:

  1. There is a composite primary key.
  2. The natural primary key is inefficient.
  3. The natural primary key is recycled as there it needs to be unique every time.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
create a dependency diagram based on this ERD.  Decompose the relation in the resulting dependency diagram into a set of 3NF relation        this is introduction to databse system question
Define the terms functional dependency and determinant, using an example not from this book
Explain the concept of functional dependency and its role in normalization.

Chapter 4 Solutions

Modern Database Management

Ch. 4 - Prob. 4.11RQCh. 4 - Describe how the following components of an E-R...Ch. 4 - Prob. 4.13RQCh. 4 - Prob. 4.14RQCh. 4 - Briefly describe four typical problems that often...Ch. 4 - Prob. 4.16RQCh. 4 - Explain how each of the following types of...Ch. 4 - Prob. 4.18RQCh. 4 - Prob. 4.19RQCh. 4 - Prob. 4.20RQCh. 4 - Prob. 4.21RQCh. 4 - What is the relationship between the primary key...Ch. 4 - Prob. 4.23RQCh. 4 - Explain what can be done with primary keys to...Ch. 4 - Prob. 4.25RQCh. 4 - Explain three conditions that suggest a surrogate...Ch. 4 - Prob. 4.27RQCh. 4 - For each of the following E-R diagrams from...Ch. 4 - Prob. 4.29PAECh. 4 - Prob. 4.30PAECh. 4 - For your answers to the following Problems and...Ch. 4 - Figure 4-3212 shows a class list for Millennium...Ch. 4 - Prob. 4.33PAECh. 4 - Prob. 4.34PAECh. 4 - Prob. 4.35PAECh. 4 - Prob. 4.36PAECh. 4 - Prob. 4.37PAECh. 4 - Prob. 4.38PAECh. 4 - Prob. 4.39PAECh. 4 - Transform Figure 2-15a, attribute version, to 3NF...Ch. 4 - The Public Safety office at Millennium College...Ch. 4 - Prob. 4.42PAECh. 4 - Prob. 4.43PAECh. 4 - Prob. 4.44PAECh. 4 - For your answers to Problem and Exercise 3-33 from...Ch. 4 - Prob. 4.46PAECh. 4 - Prob. 4.47PAECh. 4 - Figure 4-38 includes an EER diagram for a...Ch. 4 - Prob. 4.49PAECh. 4 - Prob. 4.50PAECh. 4 - Prob. 4.51PAECh. 4 - Prob. 4.52PAECh. 4 - Figure 4-40 shows an EER diagram for a university...Ch. 4 - Explore the data included in Table 4-9. Assume...Ch. 4 - Prob. 4.55PAECh. 4 - Prob. 4.56PAECh. 4 - Prob. 4.57PAECh. 4 - Prob. 4.58PAE
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Enhanced Entity Relationship Model; Author: Data Science Center;https://www.youtube.com/watch?v=ocQUtXPumdQ;License: Standard YouTube License, CC-BY