Map the relational schema of Figure 6.14 into an ER schema. This is part of a process knownas reverse engineering, where a conceptual schema is created for an existing implementeddatabase. State any assumptions you make.ВOOKBook id TitlePublisher_nameBOOK AUTHORSBook id Author_namePUBLISHERNameAddressPhoneвоOK COPIESBook id Branch_id No of_copiesBOOK LOANSBook_id Branch_idCard noDate_out Due_dateLIBRARY_BRANCHBranch_id Branch_name AddressBORROWERCard no NameFigure 6.14A relational databaseAddressPhoneschema for a LIBRARYdatabase.

Map the relational schema of Figure 6.14 into an ER schema. This is part of a process known as reverse engineering, where a conceptual schema is created for an existing implemented database. State any assumptions you make.

Map the relational schema of Figure 6.14 into an ER schema. This is part of a process known as reverse engineering, where a conceptual schema is created for an existing implemented database. State any assumptions you make.

Database Systems: Design, Implementation, & Management

11th Edition

ISBN:9781285196145

Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Chapter10: Transaction Management And Concurrency Control

Section: Chapter Questions

Problem 1P

See similar textbooks

Similar questions

Today almost every commercial database is based on O the hierarchical model O the linked-list model O the object-oriented model lists the relational model Given the relations: STUDENT (SID. StudentName, Major, AdvisorID) ADVISOR (AdvisorID, AdvisorName, Office, Phone) such that each student is assigned to one advisor, which of the following is true? O Major is a candidate key. O Phone is a candidate key. AdvisorName is a determinant. O AdvisorID is a foreign key. O SID is both a primary key and a foreign key.
Consider a database schema with a relation Emp whose attributes are as shown below, with types specified for multivalued attributes. Emp = (ename, ChildrenSet multiset(Children), SkillSet multiset(Skills))Children = (name, birthday)Skills = (type, ExamSet setof(Exams))Exams = (year, city) Redesign the database above into first normal form and fourth normal form. List any functional and multivalued dependencies that you assume. Also list all referential-integrity constraints that should be present in the first and fourth normal form schemas.
Store the following fields for a library database: AuthorCode, AuthorName, BookTitle, BorrowerAddress, BorrowerName, BorrowerCardNumber, CopiesOfBook, ISBN (International Standard Book Number), LoanDate, PublisherCode, PublisherName, and PublisherAddress. A one-to-many relationship exists between publishers and books. Many-to-many relationships exist between authors and books and between borrowers and books. Without creating a set of dependency diagrams, write the relational schema that meet 3rd NF requirements.
I need help with the following Consider a STUDENT relation in a UNIVERSITY database with the followingattributes (Name, Ssn, Local_phone, Address, Cell_phone, Age, Gpa). Note thatthe cell phone may be from a different city and state (or province) from thelocal phone. A possible tuple of the relation is shown below:Name Ssn Local_phone Address Cell_phone Age GpaGeorge Shaw 123-45-6789 555-1234 123 Main St., 555-4321 19 3.75William Edwards Anytown, CA 94539a. Identify the critical missing information from the Local_phone andCell_phone attributes. (Hint: How do you call someone who lives in a dif ferent state or province?)b. Would you store this additional information in the Local_phone andCell_phone attributes or add new attributes to the schema for STUDENT?c. Consider the Name attribute. What are the advantages and disadvantagesof splitting this field from one attribute into three attributes (first name,middle name, and last name)?d. What general guideline would you recommend for…
Consider a relational database for an online hotel booking company. The database consisting ofthe following tables (where the primary keys are underlined): Hotel (hId, hName, hAddress, hCity) Guest(gId, gName, gAddress, gCity) Room(hid, roomNo, type, price) Booking(gId, hId, roomNo, fromDate, year, noOfDays)Where hId and gId are identifiers for the hotels and the guests,and the Booking relation indicated that a guest booked a hotel room for a specified number of days(noOfDays) starting from fromDate of a given year. For instance, a tuple < g12345, h5555, 220,Jan05, 2016, 15> in Booking indicates that the guest g12345 booked room 220 of the h5555 hotelfor 8 days starting on Jan 5, 2016. The attribute "gAddress" records the home address of theguests.Write the following queries in relational algebra (1) Return thename of guests who have booked a hotel room in NYC in January 2016 (i.e.,fromDate between 01/01 and 01/31 and year=2016).(2) Return thename of guests who have booked a…
Draw the relationships and entities model for each of the following: * in the traditional way* for example: see the pic??. In the database of the library, the author can author more than one book, and the book can be subscribed toWritten by more than one author
Suppose we have a relational database with five tables. table key Attributes S(sid, A) Sid T(tid, B) Tid U(uid, C) Uid R(sid, tid, D) sid, tid Q(tid, uid, E) tid, uid Here R implements a many-to-many relationship between the entities implemented with tables S and T, and Q implements a many-to-many relationship between the entities implemented with tables T and U. A. Write an SQL query that returns all records of the form sid, uid where sid is the key of an S- record and uid is the key of a U-record and these two records are related through the relations R and Q. Use SELECT and not SELECT DISTINCT in your query. B. Write an SQL query that returns records of the form A, C where the A-value is from an S- record and the C-value is from a U-record and these two records are related through the relations R and Q. Use SELECT and not SELECT DISTINCT in your query. C. Could one of your queries from parts (a) and (b) return more records than the other? If so, which one? Justify your answer. D.…
Suppose we have a relational database with five tables. table key Attributes S(sid, A) Sid T(tid, B) Tid U(uid, C) Uid R(sid, tid, D) sid, tid Q(tid, uid, E) tid, uid Here R implements a many-to-many relationship between the entities implemented with tables S and T, and Q implements a many-to-many relationship between the entities implemented with tables T and U. A. Write an SQL query that returns all records of the form sid, uid where sid is the key of an Srecord and uid is the key of a U-record and these two records are related through the relations R and Q. Use SELECT and not SELECT DISTINCT in your query. B. Write an SQL query that returns records of the form A, C where the A-value is from an Srecord and the C-value is from a U-record and these two records are related through the relations R and Q. Use SELECT and not SELECT DISTINCT in your query. C. Could one of your queries from parts (a) and (b) return…
Take a database, having FDs as: DOB->Age; Age->Eligibility; Name->RollNo; RollNo->Name; CourseNo->CourseName; CourseNo->Teacher; (RollNo, CourseName)->Marks. The relation (RollNo, Name, DOB, Age) is in which Normal Form?
The next best alternate after BCNF is 3NF. We can say that this schema is 3NF but not BCNF. Match the following statements that make this 3NF and not BCNF dept_advisor(s_ID, i_ID, dept_name) § With function dependencies: i_ID → dept_name s_ID, dept_name → i_ID § Two candidate keys = { s_ID , dept_name }, { s_ID , i_ID } - A. B. C. D. i_ID is not a superkey - A. B. C. D. { dept_name} – {i_ID } - A. B. C. D. dept_name is contained in a candidate key - A. B. C. D. s_ID, dept_name A. {dept_name } B. Since each attribute A in β – α is contained in a candidate key for R, dept_advisors is 3NF C. superkey D. dept_advisor is not BCNF
Consider a database that consists of the following relations.SUPpLIER(Sno. Sname)PART(Pno, Pname)PROJECT(Jno, Jname)SUPPLY(Sno, Pno, Jno)The database records information about suppliers, parts, and projectsandincludes a ternary relationship between suppliers, parts, and projects.Thisrelationship is a many-many-many relationships. Specify and execute thefollowingqueries using the relational algebraRetrieve the part numbers that are supplied to exactly two projects.b. Retrieve the names of suppliers who supply more than two parts toproject J11c. Retrieve the part numbers that are supplied by every supplier.d. Retrieve the project names that are supplied by supplier S1' only.e. Retrieve the names of suppliers who supply at least two different partseach to at least two different projects.
Give a relational database schema for the following: EMPLOYEE (Fname, Minit, Lname, SSN, Bdate, Address, Sex, Salary, Super_ssn, Dno) PK= Ssn FK= Super_ssn DEPARTMENT ( Dnamc, Dnumbcr, Mgr_ssn, Mgr_start_datc) PK= Dnumbcr FK= Dno DEPT_LOCATIONS (Dnumber, Dlocation) PK= Dnumber FK= Dnumbcr PROJECT (Pname, Pnumber, Plocation, Dnum) PK= Pnumber FK= Pno WORKS_ON (Essn, Pno, Hours) PK= Pno FK= ssn DEPENDENT (Essn, Dependent_name, Sex, Bdate, Relationship) PK= Essn FK= Ssn

SEE MORE QUESTIONS

Recommended textbooks for you

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning