Modern Database Management
13th Edition
ISBN: 9780134773650
Author: Hoffer
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 8, Problem 8.51PAE
Program Plan Intro
The types of indexes recommended for a given
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Consider the following database schema for student game, where each team is led by a
student of the team and each game is between two teams (Host and Guest):
Students
Student Id
Student Name
Address
Teams
Team Id
Team Name
Rank
Team Leader
Membership
Student id
Team Id
Games
Game id
Score
Date
Host Team
Guest Team
Your task is to show all the primary and foreign keys in Schema.
Let the database has two relations P(a, b) and
Q(m, a, n) in which a is the primary key of the
relation P and m is the primary key of the
relation Q. Instance of P has 70 Tuples and
Instance of Q has 42. What is the maximum
number of rows in the new instance produced by
P Q? ( is natural join)
QUESTION 14
Consider the database schema below for cities in countries. A country have many cities, and the same city name can be found in different countries.
Country (ID: integer, Name: String (unique), SN: serialNumber (int)(unique))
City (serialNo: integer (unique, not null), CountryID: Integer, CityName: String, Population: integer)
The same country (ID , name) can be added twice in Country relation with different SN?
No, violates entity Integrity constraint
No, violates referential integrity constraint.
No, violates key constraint.
Yes.
No, violates domain constraints.
Chapter 8 Solutions
Modern Database Management
Ch. 8 - Prob. 8.1RQCh. 8 - Prob. 8.2RQCh. 8 - Prob. 8.3RQCh. 8 - Prob. 8.4RQCh. 8 - Prob. 8.5RQCh. 8 - Prob. 8.6RQCh. 8 - Prob. 8.7RQCh. 8 - Prob. 8.8RQCh. 8 - Explain why you sometimes have to reserve much...Ch. 8 - Why are field values sometimes coded?
Ch. 8 - Prob. 8.11RQCh. 8 - Prob. 8.12RQCh. 8 - Explain why normalized relations may not comprise...Ch. 8 - Prob. 8.14RQCh. 8 - List three common situations that suggest that...Ch. 8 - Explain the reasons why some experts are against...Ch. 8 - Prob. 8.17RQCh. 8 - Prob. 8.18RQCh. 8 - Prob. 8.19RQCh. 8 - Prob. 8.20RQCh. 8 - Prob. 8.21RQCh. 8 - Prob. 8.22RQCh. 8 - One of the strongest recommendations regarding...Ch. 8 - Explain why an index is useful only if there is...Ch. 8 - Indexing can clearly be very beneficial. Why...Ch. 8 - Prob. 8.26RQCh. 8 - Prob. 8.27RQCh. 8 - Describe the role of data dictionary in the...Ch. 8 - Prob. 8.29RQCh. 8 - Prob. 8.30RQCh. 8 - Explain how creating a view may increase data...Ch. 8 - Prob. 8.32RQCh. 8 - Prob. 8.33RQCh. 8 - Prob. 8.34RQCh. 8 - Prob. 8.35RQCh. 8 - Prob. 8.36RQCh. 8 - Prob. 8.37RQCh. 8 - Prob. 8.38RQCh. 8 - Prob. 8.39RQCh. 8 - How can views be used as part of data security?...Ch. 8 - Prob. 8.41RQCh. 8 - Prob. 8.42RQCh. 8 - Consider the following two relations for...Ch. 8 - Prob. 8.44PAECh. 8 - Prob. 8.45PAECh. 8 - Prob. 8.46PAECh. 8 - Prob. 8.47PAECh. 8 - Suppose you are designing a default value for the...Ch. 8 - When a student has not chosen a major at a...Ch. 8 - Prob. 8.50PAECh. 8 - Prob. 8.51PAECh. 8 - Consider the relations in Problem and Exercise...Ch. 8 - Prob. 8.53PAECh. 8 - Prob. 8.54PAECh. 8 - Prob. 8.55PAECh. 8 - Prob. 8.56PAECh. 8 - Prob. 8.57PAECh. 8 - Consider the relations specified in Problem and...Ch. 8 - Prob. 8.59PAECh. 8 - Prob. 8.60PAECh. 8 - Prob. 8.61PAECh. 8 - Prob. 8.62PAECh. 8 - Prob. 8.63PAECh. 8 - Prob. 8.64PAECh. 8 - Problems and Exercises 8-65 through 8-68 refer to...Ch. 8 - Prob. 8.66PAECh. 8 - Problems and Exercises 8-65i5 through 8-68 refer...Ch. 8 - Refer to Figure 4-5 0. For each of the following...Ch. 8 - Prob. 8.69PAECh. 8 - Prob. 8.70PAECh. 8 - Prob. 8.71PAECh. 8 - Prob. 8.72PAECh. 8 - Prob. 8.73PAECh. 8 - Prob. 8.74PAECh. 8 - Prob. 8.75PAECh. 8 - Prob. 8.76PAECh. 8 - Prob. 8.77PAE
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- In a database, there are three different kinds of relationships: identifying, non-identifying, and generic?arrow_forwardBased 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…arrow_forwardBased 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 =…arrow_forward
- 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)…arrow_forwardBased 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…arrow_forwardGiven the following relation R and its functional dependencies: R(workerNumber, repairNumber, workerName, machineNumber, spentTime, repairDate, machineName, workshopNumber, workshopName ) workerNumber à workerName repairNumber à repairDate, machineNumber machineNumber à machineName, workshopNumber workshopNumber à workshopName Explain the types of all the dependencies in the relation R. Create a database whose tables are at least in 3NF, showing the dependency diagrams for each table.arrow_forward
- Consider the following database schema for student game, where each team is led by a student of the team and each game is between two teams (Host and Guest): Students Student_Id Student_Name Address Team_Id Team_Name Rank Team_Leader Teams Student_id Team_Id Game_id Score Date Host_Team Guest_Team Membership Games Show all the primary and foreign keys in Schema.arrow_forwardMotor Vehicle Dealership Database: Consider Aaron's dealership, a multi-brand vehicle dealership whose database consists of four relations as described below. Using this database, answer questions Vehicle(make, model, manfYear, color, vinNum, type, purchaseld) Stock(stockNum, unitPrice, deliveryDate, vehiclesRemaining) Manufacturer(name, manfCode, plantLocation) Purchase(purchaseld, mCode, numVehicles, orderDate, deliveryStatus) • A vehicle can be one of the following types: Car, Truck, SUV • vinNum →Vehicle Identification Number • manfCode/mCode → a 4 character alphanumeric code for the manufacturer • manfYear → year of vehicle manufacture • purchaseld and stockNum refer to the same item • The delivery status is true if the order has been delivered to the dealership and false otherwise • Manufacturer name may not contain the same data as the make of the Vehicle. For example, • name of the manufacturer: Ford Motor Company • make of the vehicle: Ford Q1. Using SQL, list the names of all…arrow_forwardGiven 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’arrow_forward
- 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’arrow_forwardGiven 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.arrow_forwardQUESTION 3 Consider the following database schema for a library. Book (BooklD:int, BookTitle:string(unique), Author:string, publisher:string) Borrowing-Record (BooklD: int, CustomerCPR: int, Date: date, Time: time, Price: double) Customer (CPR:int, name: String) BookID in Borrowing-Record is considered as a foreign key? True Falsearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781285196145Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos CoronelPublisher:Cengage Learning
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