This question concerns the logical design of a relation schema LOAN describing the borrowing of a book at a library. If a tuple is in this relation, it means that a specific copy with identifica- tion number catalogNo has been borrowed by a library member with identification number member No on dateOut (borrowing day) and has been returned on dateReturn (return day). If the book has not yet been returned dateReturn is null. LOAN (catalogNo, dateOut, memberNo, dateReturn) (a) What would the following functional dependency mean? { dateOut, memberNo } → dateReturn (b) Give all full functional dependencies for schema LOAN, assuming that a book can be borrowed just once per day, that members can borrow many books on any given day, and that members can borrow the same book several times.

This question concerns the logical design of a relation schema LOAN describing the borrowing of a book at a library. If a tuple is in this relation, it means that a specific copy with identifica- tion number catalogNo has been borrowed by a library member with identification number member No on dateOut (borrowing day) and has been returned on dateReturn (return day). If the book has not yet been returned dateReturn is null. LOAN (catalogNo, dateOut, memberNo, dateReturn) (a) What would the following functional dependency mean? { dateOut, memberNo } → dateReturn (b) Give all full functional dependencies for schema LOAN, assuming that a book can be borrowed just once per day, that members can borrow many books on any given day, and that members can borrow the same book several times.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Let R be a relation schema with set of attributes {A, B, C, D, E,G}, and F be the follow- ing set of five functional dependencies which hold on R: A → B A →C BD → E ЕС + А E → G Compute the closure of each of the following four sets of attributes with respect to F: C E, A D, BCD and ADE
Consider the relation instance and functional dependencies below. Which of these FDs hold on the instance and which do not? A BC 2 4 АВ — С A → B A → C В > с АС — В ВС — А 3 4 В > А C → A C → B 1 3 5 2 4
Develop a program that takes as input: 1- A relation R with a set of attributes. The number of attributes should be variable. 2- A set of functional dependencies F that holds on R. The number of functional dependencies should be variable. And your program should do the following: 1- Find and print out the list of all possible candidate keys, (not the super keys), of R based on F.
Suppose you are given a relation R = (A,B,C,D,E) with the following functional dependencies: {CE -> D,D -> B,C -> A}. Identify the best normal form that R satisfies (1NF, 2NF, 3NF). Explain Why
What is the highest normal form for the following relation and its functional dependencies? Assume it is in INF. A(x, w. z) • X- w 1NF BCNF 2NF 3NF cannot be determined
Design the relation schemes
Give an algorithm for testing whether a relation scheme is in BCNF. The algorithm should be polynomial in the size of the set of given FDs. (The size is the sum over all FDs of the number of attributes that appear in the FD.) Is there a polynomial algorithm for testing whether a relation scheme is in 3NF?
The distinction between a weak and a strong entity collection has to be clarified.
Consider a relation schema R = (X, Y, Z) on which the following functional dependencies hold: {XYZ, Z-X}. Show that the schema R is not in BCNF (Boyce-Codd Normal Form) but it is in 3NF (Third Normal Form).
LOGICAL DATABASE DESIGN The above EER-Diagram represents a University Library Membership (see Diagram 5). A member can borrow as many books from the library. Derive relations for logical model from the above EER-Diagram. Please identify any primary key or foreign key in the derive relations (if applicable).
Question 2: The UML display the mediator pattern, describe uml and the relations, build the code in java Mediator Colleague Extends Concrete Colleague Extends Concrete Mediator Extends Concrete Colleague A
find the no. of F-D's 2-attributes ? in F-closure (Ft) for a relation with