Draw an ERD that satisfies the following business rules (note composite entities, weak entities, strong and weak relationships, and cardinalities). An INVOICE is written by a SALESREP. Each sales representative can write many invoices, but each invoice is written by a single sales representative. a. b. The INVOICE is written for a single CUSTOMER. However, each customer can have many invoices. c. An INVOICE may include many detail lines (LINE) which describe the PRODUCTS bought by the customer. d. An invoice LINE references one PRODUCT, and a PRODUCT may be referenced in one or more invoice LINES.

Draw an ERD that satisfies the following business rules (note composite entities, weak entities, strong and weak relationships, and cardinalities). An INVOICE is written by a SALESREP. Each sales representative can write many invoices, but each invoice is written by a single sales representative. a. b. The INVOICE is written for a single CUSTOMER. However, each customer can have many invoices. c. An INVOICE may include many detail lines (LINE) which describe the PRODUCTS bought by the customer. d. An invoice LINE references one PRODUCT, and a PRODUCT may be referenced in one or more invoice LINES.

Database Systems: Design, Implementation, & Management

12th Edition

ISBN:9781305627482

Author:Carlos Coronel, Steven Morris

Publisher:Carlos Coronel, Steven Morris

Chapter4: Entity Relationship (er) Modeling

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

What's the difference between weak and strong entity sets?
Is there a need for creating an associative entity? If so, draw one, if not, then suggest why?
can anybody tell me what the meaning and (((draw )))) partial key of the weak entity type? if you dont know please dont answer
Write a relation algebra based on the following algebra: Book (BookID, Price, Year, Author, Subject) BorrowLog (BID, BookID, CustomerID, DateTime) Customer (CustomerID, CustomerName, Address, City) 1. List all tuples from books which their subjects are database 2. List all tuples from books published after 2010 which their subjects are database and the prices are at least 450 3. List information about author and subject from the relation, Book
Functional Dependencies and Normalization Exercise 1: Consider the following relation: Stock(#prod, #dep, pname, quantity) Determine the functional dependencies on Stock. For each of them, explain what they mean in plain English. Is Stock 3NF? Is Stock BCNF? Exercise 2: Consider the following relation: Plane(#plane, type, constructor, capacity, owner) Determine the functional dependencies on Plane. For each of them, explain what they mean in plain English. Is Plane 3NF? Is Plane BCNF? Exercise 3: Compute the attribute closure of XZA with respect to the following set of dependencies: F = {XZ => ZYB, YA -> GC, C -> W, B -> G, XZ -> G} Is the dependency XZA -> YB implied by F? Hint: Use the Armstrong axioms. Exercise 4: What are the properties of the BCNF decomposition algorithm? Explain lossless and dependency preservation with your own words. Apply the decomposition algorithm on Stock.
b) Define the following: i. Entity. ii. Parameter. iii. Weak dimensions and weak constraints. iv. Strong dimensions and strong constraints.
The distinction between a weak and a strong entity set is best explained here.
Draw the relationships and entities model for each of the following: * in the traditional way* for example: see the pic??. In the database of the library, the author can author more than one book, and the book can be subscribed toWritten by more than one author
In the following, assume that A = {a,b,c,d} and that R : A ↔ A. Determine whether each relation is reflexive, symmetric and/or transitive (more than one property can apply to a relation). Are any total or onto? 1) R = {(a,b),(b,b),(b,c),(c,c)} 2) R=A×A 3) R = {(c,d),(d,c),(c,c))}
1. Consider a relation schema R1(A, B, C, D) that satisfies the set of functional dependencies F1 ={A→B, B→C, C→A}.a) Calculate A + and (AC)+b) Can AB→ C? Justify your answer.c) Find all the candidate keys of R1 using F1 and show your steps to find them. 2. Consider a relation schema R2(A, B, C, D) that satisfies the set of functional dependencies F2 = {A→B, C→D, D→AC}.a) Is (AD) is candidate key of R2? Justify your answer.b) Is R2 in BCNF? Explain the reason to your answer.c) If R2 is not in BCNF, give a lossless-join BCNF decomposition of R2. Is this decomposition dependency preserving? 3. Consider a relation schema R3(A, B, C, D, E) that satisfies the set of functional dependencies F3 = {A → BC, AC → BD}.a) Calculate (AC)+ and (AE)+b) Is AB → C in F3 +? Justify your answer.c) Find the canonical cover Fc of F3.d) Is R3 in 3NF? Explain the reason to your answer. If R3 is not in 3NF, give a lossless-join, dependency preserving 3NF decomposition of R3.
Which one of the following is defined as" the requirement that actions of an entity may be traced uniquely to that entity"?
B. Draw the digraph of the relation on {a, b, c, d} 1. {(a, b), (b, b), (b, c), (c, d), (d, a)} 2. {(a, b), (b, c), (c, d), (c, a), (d, a), (d, b)}