Considering the un-normalized relational table BOOK below: BOOK (ISBN, Book Title, Author FName, Author LName, Publisher, Royalty, Edition) The attributes of the relational table BOOK satisfy the following properties: • An ISBN (International Standard Book Number) is unique to each book title, the publisher of the book, and the edition the book. Book title is unique to a publisher. The author is paid a royalty for each book (identified by ISBN) the author wrote. Decompose the relational table BOOK into a minimal number of relational tables in BCNF (Boyce Codd Normal Form).

Considering the un-normalized relational table BOOK below: BOOK (ISBN, Book Title, Author FName, Author LName, Publisher, Royalty, Edition) The attributes of the relational table BOOK satisfy the following properties: • An ISBN (International Standard Book Number) is unique to each book title, the publisher of the book, and the edition the book. Book title is unique to a publisher. The author is paid a royalty for each book (identified by ISBN) the author wrote. Decompose the relational table BOOK into a minimal number of relational tables in BCNF (Boyce Codd Normal Form).

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

SpecificationFunctional DependencyConsider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. For each one of the relational schemas identify its highest normal form. Remember that the identification of a normal form requires analysis of the valid functional dependencies and the minimal keys. TRUCK(registration#, type, owner, driver, date-used)The values of attributes of a relational table TRUCK satisfy the following properties:- a truck has a unique registration number,- a truck has only one owner,- a truck is used only once per day,- an owner owns many trucks and driver uses many trucks.
q8
Problem 1: A database for an online store has the following relational schema to keep track of customers' orders: ItemOrder(cust_id, item_id, color, size, price) Here primary key is underlined and bolded and assume that the following functional dependency holds on the above relational schema: item_ID, size →price Fill in the blanks using attributes from ItemOrder schema: The above functional dependency says that if two rows have the same values for then they have the same values for
Consider the relational schema for a library system as given below: Member (mem_no, name, dob) Books (isbn, title, authors, publisher) Borrowed (mem_no, isbn, date) Write the following queries in relational algebra. i. List the members who have not borrowed any books from the library. ii. Name all the books borrowed by a member named 'Ram'. ii. List the book that has been borrowed the most.
,,,,,,,
Given the relation R(A, B, C, D, E, F), the following functional dependencies exist: B --> C, DD --> F a) What normal form is the relation R in? b) Normalize relation R to 3NF. You only need to show the final relation schemas
Instructions: Create a complete ERD in Crow's Foot notation that can be implemented in the relational model using the descriptions below. The attributes required: Activity's ID, Activity's Title, Activity's description, Child's ID, Child's firstname and lastname, Child's Birthday, Parent's ID, Parent's number, Parent's address. The business rules are: An activity may or may not have a child signed up An activity may have many children signed up A child must have an activity A child may have many activities A child must have a parent A parent must have a child A child may have many parents A parent may have many children To submit: Write your answer in a clean sheet of paper and upload a picture of it to dropbox
Problem 4: Supplementary question 2 Analyze the following relation, a) write the types of functional dependencies;___ c) perform the normalization to 2NF; then b) point out which normal forms it violates, and d) normalization to 3NF. STICK TO the GIVEN dependencies; Do NOT create your own State GynrD GvntName St. Flower City MayorID MaxorName CityHallAddr MayorPhone Functional dependencies - logic GIVEN: (next page) Repeat: STICK TO GIVEN dependencies; Do NOT create your own
subject : database system Member (MemberID, Name, ContactNo, Status, Sex)Borrow (BorrowNo, MemberID, CatalogNo, CheckOut, Return, Fine)Book (CatalogNo, Title, Author, Publisher, Year, Category) Write the appropriate relational algebra to produce the following queries. List member ID for members that borrowed all the ‘database’ books (category).
Q3: Define a relation prereq depth(course id, prereq id, depth) where the attribute depth indicates how many levels of intermediate prerequisites there are between the course and the prerequisite. Direct prerequisites have a depth of 0. Note that a prerequisite course may have multiple depths and thus may appear more than once.
109. The constraint violated when key value in tuple already exists in some other relation's tuple is called a. domain constraint b. attribute constraint c. key constraint d. lock constraint
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…