Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Starting with the following universal relation: Books ( title , isbn, author, publisherName, publisherAddress, totalCopiedOrdered, copiesInStock, publicationDate, category, sellingPrice, cost ) And making the following
Starting with the following universal relation:
Books title isbn, author, publisherName, publisherAddress, totalCopiedOrdered, copiesInStock, publicationDate, category, sellingPrice, costAnd making the following assumptions about the relation:
The isbn uniquely indentifies a book.
A book may have more than author.
An author may have more than one book.
Each publisher's name is unique.
Each publisher has one unique address the address of their headquarters
Book titles are not necessarily unique.
totalCopiesOrdered is the number of copies of a particular book that the book store has ever ordered, while copiesInStock is the number that remains unsold in their inventory.
Each book has only one publication data. A revision to a book Databases Illuminated, rd edition, for example is given a new ISBN.
Book categories may be biography, science fiction, poetry, etc. The title alone is not sufficient to determine the category.
The selling price the amount the bookstore charges to a customer is always above
the cost which is the bookstore's wholesale purchase price for one copy of the book
Using these assumptions and starting any others you need to make do parts a through d below.
a List of all nontrivial functional dependencies.
b Identify candidate keys and choose one primary key.
c Is the relation in NF If not, find a NF decomposition that is both lossless and preserves dependencies.
d Is the result from part c in BCNF If it is justify your answer. If it is not, perform another decomposition so that the result is
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started