Question 1Figure 1 shows an ER schema for a database that may be used to keep track of part of aHospital Management System. Map this schema into a relational schema, and specify allprimary keys and foreign keys.NameDateTypeAddressDetailsSpecialization(1,3)DOCTORSTreatsPATIENTS|(0,N)(0,N)QualificationLogDiseaseTreatmen|(1,1)DateTESTSTypedescriptionFigure 1: An ER diagram for a part of a Hospital database.

Entity-set schema: DOCTORS(Name, Address, Specialization, Qualification) PATIENTS(Type, Details)…

Figure 1 shows an ER schema for a database that may be used to keep track of part of a Hospital Management System. Map this schema into a relational schema, and specify all primary keys and foreign keys. Name Address Specialization Date Type Details (1,3) DOCTORS Treats PATIENTS |(0,N) (0,N) Qualification Log Disease Treatmen |(1,1) Date TESTS Туре description

Figure 1 shows an ER schema for a database that may be used to keep track of part of a Hospital Management System. Map this schema into a relational schema, and specify all primary keys and foreign keys. Name Address Specialization Date Type Details (1,3) DOCTORS Treats PATIENTS |(0,N) (0,N) Qualification Log Disease Treatmen |(1,1) Date TESTS Туре description

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

Given the following relational schema of a database library (primary keys are underlined and foreign keys are preceded by #): Student(studentNumber, StudentName, studentAddress) Book(bookNumber, bookTitle, #authorNumber, #editorNumber, yearEdition) Author(authorNumber, authorName, authorAddress) Editor(editorNumber, editorName, editorAddress) Borrow(#studentNumber, #bookNumber, borrowDate, returnDate) Write the following queries in Relational Algebra: List the details (bookNumber, bookTitle) of books whose author’s name is ‘Ramakrishnan’
Given the following relational schema of a database library (primary keys are underlined and foreign keys are preceded by #): Student(studentNumber, StudentName, studentAddress) Book(bookNumber, bookTitle, #authorNumber, #editorNumber, yearEdition) Author(authorNumber, authorName, authorAddress) Editor(editorNumber, editorName, editorAddress) Borrow(#studentNumber, #bookNumber, borrowDate, returnDate) Write the following queries in Relational Algebra: Find the details of students who borrowed the book titled ‘Database Management Systems’
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. ВOOK Book id Title Publisher_name BOOK AUTHORS Book id Author_name PUBLISHER Name Address Phone воOK COPIES Book id Branch_id No of_copies BOOK LOANS Book_id Branch_id Card no Date_out Due_date LIBRARY_BRANCH Branch_id Branch_name Address BORROWER Card no Name Figure 6.14 A relational database Address Phone schema for a LIBRARY database.
Part 3 5. Database design often involves decisions about the storage of attributes. For example a Telephone Number can be stored as a one attribute or split into three attributes (one for each of the three hyphen-delineated groups of numbers in a Telephone Number (XXX)-XXX-XXXX, I.e (123)-456-7890). However, Telephone Number is usually stored in one attribute. The decision is usually based on how the database will be used. This exercise asks you to think about specific situations where dividing the Telephone Number is useful. List and describe the different situations, give examples.
Given the following relational schema of a database library (primary keys are underlined and foreign keys are preceded by #): Student(student Number, StudentName, studentAddress) Book(bookNumber, bookTitle, #authorNumber, #editorNumber, yearEdition) Author(authorNumber, authorName, authorAddress) Editor(editorNumber, editorName, editorAddress) Borrow(#studentNumber, #bookNumber, borrowDate, returnDate) 1) List the books (bookNumber) that have never been borrowed.
Create a conceptual schema for the following database domain. To make it completely clear, only one (the final) conceptual schema is expected. A book is described by ISBN and a title. ISBN uniquely identifies each book. A book consists of many chapters. A chapter is described by a chapter number, title and topic. Each chapter has a unique number within a book. A chapter belongs to one book only. A book is written by one or more authors. An author can write one or more books. An author is described by the first name, last name, date of birth, and country the author comes from. A triple of values: (first name, last name and date of birth) uniquely identifies each author. We have three types of books: textbooks, fiction books and biographies. A textbook is additionally described by the titles of course it has been applied to. A textbook can be applied to none or more courses. i need answer with diagram
Based on the following database schemas: Homestay (homestayNo (PK), homestayName, address, telNo, city)Room (roomNo, homestayNo (PK), type, price)Booking (homestayNo, guestNo (PK), dateFrom, dateTo, roomNo) Guest (guestNo (PK), guestName, guestAddress, guestTelNo) Assume the following indexes exist:a) a hash index with no overflow on the roomNo and homestayNo as a composite primary key in Room;b) a clustering index on the foreign key attributes homestayNo in Room;c) a B⁺-tree index on the price attribute in Room;d) a secondary index on the attribute type in Room. nTuples(Room) = 20000 bFactor(Room) = 200nTuples(Homestay) = 100 bFactor(Homestay) = 40nTuples(Booking) = 100000 bFactor(Booking) = 60nDistincthomestayNo(Room) = 50 nDistinctroomNo(Booking) = 150nDistincttype(Room) = 10…
Based on the following database schemas:Homestay (homestayNo (PK), homestayName, address, telNo, city)Room (roomNo, homestayNo (PK), type, price)Booking (homestayNo, guestNo (PK), dateFrom, dateTo, roomNo)Guest (guestNo (PK), guestName, guestAddress, guestTelNo)Assume the following indexes exist:a) a hash index with no overflow on the roomNo and homestayNo as a composite primary key in Room;b) a clustering index on the foreign key attributes homestayNo in Room;c) a B+-tree index on the price attribute in Room;d) a secondary index on the attribute type in Room.nTuples(Room) = 20000 bFactor(Room) = 200nTuples(Homestay) = 100 bFactor(Homestay) = 40nTuples(Booking) = 100000 bFactor(Booking) = 60nDistincthomestayNo(Room) = 50 nDistinctroomNo(Booking) = 150nDistincttype(Room) = 10 nDistincthomestayName(Homestay) = 50nDistinctprice(Room) = 500 maxprice(Room) = 500minprice(Room) = 200 nLevelstype(I) = 2nLevelshomestayNo(I) = 2 nLfBlocksprice(I) = 50nLevelsprice(I) = 2 Log2100 = 6.64Log250 =…
Based on the following database schemas: Homestay (homestayNo (PK), homestayName, address, telNo, city)Room (roomNo, homestayNo (PK), type, price)Booking (homestayNo, guestNo (PK), dateFrom, dateTo, roomNo) Guest (guestNo (PK), guestName, guestAddress, guestTelNo) Assume the following indexes exist:a) a hash index with no overflow on the roomNo and homestayNo as a composite primary key in Room;b) a clustering index on the foreign key attributes homestayNo in Room;c) a B⁺-tree index on the price attribute in Room;d) a secondary index on the attribute type in Room. nTuples(Room) = 20000 bFactor(Room) = 200nTuples(Homestay) = 100 bFactor(Homestay) = 40nTuples(Booking) = 100000 bFactor(Booking) = 60nDistincthomestayNo(Room) = 50 nDistinctroomNo(Booking) = 150nDistincttype(Room) = 10…
Based on the following database schemas: Homestay (homestayNo (PK), homestayName, address, telNo, city)Room (roomNo, homestayNo (PK), type, price)Booking (homestayNo, guestNo (PK), dateFrom, dateTo, roomNo) Guest (guestNo (PK), guestName, guestAddress, guestTelNo) Assume the following indexes exist:a) a hash index with no overflow on the roomNo and homestayNo as a composite primary key in Room;b) a clustering index on the foreign key attributes homestayNo in Room;c) a B⁺-tree index on the price attribute in Room;d) a secondary index on the attribute type in Room. nTuples(Room) = 20000 bFactor(Room) = 200nTuples(Homestay) = 100 bFactor(Homestay) = 40nTuples(Booking) = 100000 bFactor(Booking) = 60nDistincthomestayNo(Room) = 50 nDistinctroomNo(Booking) = 150nDistincttype(Room) = 10 nDistincthomestayName(Homestay) = 50nDistinctprice(Room)…
Design an ER schema for keeping track of information about votes taken in the U.S. House of Representatives during the current two-year congressional session. The database needs to keep track of each U.S. STATE's Name (e.g., 'Texas', 'New York', 'California') and include the Region of the state (whose domain is {'Northeast', 'Midwest', 'Southeast', 'Southwest', 'West'}). Each CONGRESS_PERSON in the House of Representatives is described by his or her Name, plus the District represented, the Start_date when the congressperson was first elected, and the political Party to which he or she belongs (whose domain is {'Republican', 'Democrat', 'Independent', 'Other'}). The database keeps track of each BILL (i.e., proposed law), including the Bill_name, the Date_of_vote on the bill, whether the bill Passed_or_failed (whose domain is {'Yes', 'No'}), and the Sponsor (the congressperson(s) who sponsored that is, proposed the bill). The database also keeps track of how each congressperson voted on…
Design an ER schema for keeping track of information about votes taken in the U.S. House of Representatives during the current two-year congressional session. The database needs to keep track of each U.S. STATE’s Name (e.g., ‘Texas’, ‘New York’, ‘California’) and include the Region of the state (whose domain is {‘Northeast’, ‘Midwest’, ‘Southeast’, ‘Southwest’, ‘West’}). Each CONGRESS_PERSON in the House of Representatives is described by his or her Name, plus the District represented, the Start_date when the congressperson was first elected, and the political Party to which he or she belongs (whose domain is {‘Republican’, ‘Democrat’, ‘Independent’,‘Other’}). The database keeps track of each BILL (i.e., proposed law), including the Bill_name, the Date_of_vote on the bill, whether the bill Passed_or_failed (whose domain is {‘Yes’, ‘No’}), and the Sponsor (the congressperson(s) who sponsored—that is, proposed—the bill). The database also keeps track of how each congressperson voted on…

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