Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Database Management Systems (DBMS) Consider the following BOOKS, AUTHORS and PUBLISHERS relations for this problem. PUBLISHERS Candidate Keys are underlined. There are two FK constraints;
Database Management Systems (DBMS)
Consider the following BOOKS, AUTHORS and PUBLISHERS relations for this problem. PUBLISHERS Candidate Keys are underlined. There are two FK constraints; one from BOOKS.AuthorSSNo to AUTHORS.SSNo, and another from BOOKS.Publisher to PUBLISHERS.Name. For the following query definitions, (a) specify the output of each query. (do not explain how the query will be executed, but specify the output to be obtained when the query is executed). (b) implement the query by writing a Relational Algebra or an SQL SELECT statement. 1. Query Definition: find the Books that are longer than 500 pages. Retrieve their title and publisher. (a) The Output: (b) The Relational Algebra Implementation: 2. Query Definition: retrieve first name, last name and birth year of Authors who had received between 4 and 39 prizes, and whose last names do NOT contain the letters ' m ' and ' t '. (the output should be in "the youngest to the oldest" order) (b) The SQL SELECT ImplementationStep 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