Frequents(kid, store) Sells(store, candy) Likes(kid, candy) Table requents indicates what candy stores a kid likes to visit. Table Sells shows which candy each store sells. Table Likes tells which candy a kid likes. Write a relational algebra that finds the kids who like "Hersheys" or “Mars" candy.

Frequents(kid, store) Sells(store, candy) Likes(kid, candy) Table requents indicates what candy stores a kid likes to visit. Table Sells shows which candy each store sells. Table Likes tells which candy a kid likes. Write a relational algebra that finds the kids who like "Hersheys" or “Mars" candy.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

branch(branchhame, branch+citysassets} customer (HD, Customer name, customer street, customer city) loan loan number branch_name, amounty borrower(ID; loan_number account (account_number, branch name, balance)e depositor (HDs account number)- Figure le Consider the bank database in Figure 1, where the primary keys are underlined. Each branch might have many loans or accounts, associated with borrowers or depositors, respectively. Construct the following SQL queries for this relational database. 1. Find the name of each branch that has at least one customer who has an account in the bank and who lives in the "Harrison" city. Make sure each branch name only appears once. 2. Find the ID of each customer who lives on the same street and in the same city as customer "12345". (1) Please use "tuple variables". e (2) Please use "derived relations" or “with". 3. Find the ID of each customer of the bank who has an account but not a loan. 4. Find the total sum of all loan amounts for each branch…
Quiz 1 العودة 00: all cö Given the following database schema: Customer(cid., cname , rating, salary) Item(iid, iname , type ) Ooder(cid, iid , day , gty ) what is the relational algebra that retrieve the names of customers who have ordered item with id 100 .a .All choices are correct .b 1ramelo iid=100 'iid=100 (OrderCustomer)) .C iid=100 1-100Order)aCustomer) .d (Order) templ<-o temp2<-templdCustomer Ocname(temp2) iid=100
For the following relational model: Student(sid, fname, lname, gpa)Course ( cid, code, name, credithours)Enrolled (sid, cid,grade) Write SQL queries for the following: Print all the computer sciences courses, these courses with code start with ‘CS’ sorted alphabetically. Find all students that have enrolled in database course Find all students that have enrolled in database and network courses Find all the students that have (A or more) at least once
FUNDAMENTAL DATABASE SUBJECT: Case: A car wash owner wants to monitor the inventory of products and sales of the business. Create a database design in preparation for a system development that would: Store and monitor the supply of products; The number of vehicle washed by a car wash boy. Vehicles can be classified according to its type (motorcycle, van, bus, etc.). The list of vehicles washed by a car wash boy can be monitored. Salary per employee and the vehicles washed can be retrieved. Car wash history per vehicle can be check also. We already Identified the possible tables, so your task will be: 1. Add data on the tables (assume that this is not normalized yet) 2. reflect on the table and follow the normalization steps base on the rules. 3. normalize its table 4. add all table in one document (lucidchart/google docs), should have relationships and cardinality. 5. make sure that it is in highest normal form, highest will be BCNF (if needed).
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)…
A database has four transactions. Let min sup = 60% and min conf = 80%.cust ID TID items bought (in the form of brand-item category)01 T100 {King’s-Crab, Sunset-Milk, Dairyland-Cheese, Best-Bread}02 T200 {Best-Cheese, Dairyland-Milk, Goldenfarm-Apple, Tasty-Pie, Wonder-Bread}01 T300 {Westcoast-Apple, Dairyland-Milk, Wonder-Bread, Tasty-Pie}03 T400 {Wonder-Bread, Sunset-Milk, Dairyland-Cheese}(a) At the granularity of item category (e.g., itemi could be “Milk”), for the ruletemplate,∀X ∈ transaction, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3) [s,c],list the frequent k-itemset for the largest k, and all the strong association rules(with their support s and confidence c) containing the frequent k-itemset for thelargest k.(b) At the granularity of brand-item category (e.g., itemi could be “Sunset-Milk”),for the rule template,∀X ∈ customer, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3),list the frequent k-itemset for the largest k (but do not print any rules).
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…
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 =…
Problem 8-10 use the same database. Let a database application have the following entities Sales = (Customers, Salesperson, Retail Order, Items), which contains the information that a salesperson sells multiple items (tables, computers,...) to customers. There are many customers. There are many salesmen. There are many items. For example, John sells to Joe, Smith sells to Jane, The "Salesperson" will sale many times. The "Customer" can come back and buy items many times The "Retail Order" specifies which Salesperson sell to which customer. In each "Retail_Order", many items (tables, computers,...) can be sold Hint: This is very similar to one of your homework What is the relationship between Retail_Order and Items? One-to-many relationship None of the above One-to-one relationship Many-to-many relationship
For the following database scheme Employee(empNo,fName.IName.address.DOB.sex,position.deptNo) Department(deptNo.deptName,mgrEmpNo) Project(projNo.projName,deptNo) WorksOn(empNo.projNo.dateWorked,hoursWorked) Write an SQL statement to find all the details of employees who are female
Consider a database with the following relations: Employee (Employee ID, Name, salary, startDate) Department (Department ID, Name, capacity) Project (Employee ID, Department ID, name, budget, expectedDuration) Develop the following query in SQL: Display projects (by name and budget) done under "Marketing" department and with budget higher 100,000$.