Back to the 2024 paper

Module 2: Relational Query Languages & Design

20247m

Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price), Collection (Title, Author, Catalog_no) with in the following functional dependencies:
I. Title Author → Catalog_no
II. Catalog_no → Title, Author, Publisher, Year
III. Publisher Title Year → Price

Analyze and find the highest normal form of the relation Book and Collection.

Similar questions

Database Management SystemConsidering the following schema, create the appropriate tables and insert at least 5 records: AUTHOR (author-id, name, city, country) PUBLISHER (publisher-id, name, city, country) CATALOG (book-id, title, author-id, publisher-id, category-id, year, price) CATEGORY (category-id, description) ORDER-DETAILS (order-no, book-id, quantity) Write each of the following queries in SQL and relational algebra: (a) Obtain the names of authors who have 2 or more books in the catalog. (b) Find the author of the book which has maximum sales. (c) Obtain the names of author who have maximum number of publisher. (d) Obtain the name of the city, author, publisher where publisher and author belong to same city. (e) Obtain the title of books which has maximum sales. (f) Obtain the book-id, description for the author who have exactly 3 books in the catalog. (g) Obtain the author and publisher who have published books in more than or equal to 2 categories.201914mDatabase Management SystemConsider the following schema for institute library: Student (RollNo, Name, Father_Name, Branch) Book (ISBN, Title, Author, Publisher) Issue (RollNo, ISBN, Date-of-Issue) Write the following queries in SQL and relational algebra: (i) List roll number and name of all students of the branch 'CSE'. (ii) Find the name of student who has issued a book published by 'ABC' publisher. (iii) List title of all books and their authors issued to a student 'RAM'. (iv) List title of all books issued on or before December 1, 2020. (v) List all books published by publisher 'ABC'20247mDatabase Management SystemRelation R (ABCDEFGH) contains only atomic values for all of its attributes. F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F is exactly the set of FDs that hold for R. (i) Find all the candidate keys the relation R have? (ii) Find the highest normal form with justification in which R exist?20227mDatabase Management SystemWhich normal form is considered adequate for normal relational database design? (i) 2 NF (ii) 5 NF (iii) 4 NF (iv) 3 NF20222m