person ID пате address employee student salary tot_credits instructor secretary rank hours_per_week Figure 8.9 Specialization and generalization.

This doesn't answer the question I asked. This is for a different section. I got a solution for this question but it answered a different section. Could I please have a My SQL eer diagram that sets up the following queries. All books that are checked out are due back in two weeks, with no exceptions. The late fee is 50 cents per day. The librarian would like to have a query that generates an overdue book list each day so she can telephone the miscreants. The library would like a query to search for a book by its title and see if it is currently checked out. Sometimes members can’t remember the full name of the book so the query needs to be able to search by a part of the title. The library would like a query that can show them the Top 10 most popular books checked out over a particular date range. The library would like to know the most popular day of the week for library members to visit the library and check out books. The library would like to know which book categories are the most…

Consider the relations R(A, B, C) and S(B, C, D) and the following SQL queries.1. Select distinct * from R, S;II. Select distinct * from R, S where R.C = S.C;IIl. Select distinct from R, S where R.C = S.C and R. B = S.B;IV. Select distinct * from R, S where R.C! = S.C;Match the following Table where the first column refers to the four given SQL queries

Consider the following relations. • Student (zno, sname, age) • Enroll (zno, cno) • Course (cno, cname, semester) Given the following SQL, which one is the best index to improve the query performance. SELECT S.zno, S.sname, count(cno) FROM Student S, Enroll E WHERE S.zno = E.zno GROUP BY S.zno HAVING count(cno) >10; O None of the above O Hash Index for Course (cno) O Hash Index for Student (zno) B+ index for Enroll (cno,zno) O B+ index for Enroll (zno,cno)