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 defined on the set z by aRb if a < b. What property/properties are violated? A. Symmetric & transitive B. Reflexive & Symmetric C. Reflexive & Transitive D. All three properties
Let A1, A2, and A3 be attributes in a relation R. If both of these functional dependencies hold: A1 → A2 and A2 → A3, then A1 → A3 holds, because of the_? rule.
4. Write the relation matrix for the relation R on the set (a,b.c.d.e.f) which is defined as follows: R={a,a), (a,b), (a,c), (b,a). (b,c). (c,a), (c,b), (d,d), (f.f).
Consider the following set F of functional dependencies on the relation schema (А, В, С, D, E, G): А— ВCD ВС — DE В — D D → A
Consider the relation schema R (A, B, C, D) with all possible functional dependencies. For each of the following situations, identify the highest normal form for this relation R. A, C -> B, D C -> D A, C -> B, D B -> D A, C -> B, D
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
Identify the set of functional dependencies in the relation instance CAR shown next. Does this constitute the minimal cover for the set of functional dependencies present in CAR? If it is not a minimal cover, define a minimal cover.
HouseSale (houseID, agentID, dateSold, commissionRate, interestRate) Where: dateSold interestRate agentID → commission Rate houseID →dateSold What is the highest normal form that the above relation satisfies? Decomposition into BCNF:
Consider the Relation R4 = (A,C,B,D,E,F), with Functional Dependencies: A -> B, C -> D, E -> D. What is the Candidate Key for R4?
Please written by computer source The following relation is an extract from a restaurant point-of-sale (POS) system. The system assigns a globally unique id (GUID) to every transaction processed. CheckID comes from the pre-printed check number on the ticket used by the server for the order; these pre-printed tickets are guaranteed to be unique within the restaurant. RegisterID is which register was used for checkout and the date and time of the checkout – to the minute – are recorded in CheckoutDT; assume no two checkouts can occur at the same register in the same minute. PayType and PayTotal are, respectively, how the check was paid and what the total payment was; assume there is no splitting of a check among multiple payments. When answering the questions below use the format [attribute, attribute, …, attribute] to identify keys. 1. How many keys in general (including the empty or null key) are there in this relation? 2. Identity two multi-keys for this relation. 3. Identify two…
Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E, F, G) BC -> DG CD -> F FG -> A 1. compute the closure of {ACD}+ 2. compute the closure of {F}+ 3. what are the keys of R?
it says relation room doesnt exist.