Consider the relations Courses1. Courses2.Enrollment and Students.CorustAS ILarvinnKary 114b) Courses1-Courses2Chestion(1) Give the results of the following relationalalgebra expressions:a) (History ORComp (Courses2))c) Courses Courses2d) Courses EnrollmentFaralmentWHHEATHC ASHOBEHC ALTUAe)Enrollment/(Courses!)(2) Write the following query in Relational Algebra.a) Eind the sids of students who bave enrolled.incourse Calculusb) Find the names of students who have enrolled incourse Calculusc) Find the names of students who have enrolled atleast one course,d) Find the names of students who have enrolled inCalculus or Algebra.e) Find the sids of students who have enrolled in allcourses (both Courses1 and Courses2).

step 1 As per the answering guidelines solving the first 3 sub question completely. 1) Here…

Consider the relations Courses1. Courses2. Enrollment and Students B Hary L (1) Give the results of the following relational algebra expressions: a) Tit (- Hay O Computing (Courses2)) b) Coursesl-Courses2 AB HC Ties THE HE AL c) Courses Courses2 d) Courses Enrollment

Consider the relations Courses1. Courses2. Enrollment and Students B Hary L (1) Give the results of the following relational algebra expressions: a) Tit (- Hay O Computing (Courses2)) b) Coursesl-Courses2 AB HC Ties THE HE AL c) Courses Courses2 d) Courses Enrollment

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

Given the following relational schema (Hint: the bold text represents a primary key), Department (dept_code, dept_name, emp_num, dept_address, dept_ext)Professor(emp_num, emp_fname, emp_lname, emp_dob, dept_code, prof_ext) Write a relation algebra to find all professor names (firstname and lastname) who are in the department named "Biology"
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.
Please answer the remaining questions 4,5!! Please answer this DBMS ques asap! Suppose that we have three relations R1={A, B, C}, R2={A, B, D} and R3={B, C, D} under the relational data model. The relation R1 has 5 tuples, the relation R2 has 6 tuples and the relation R3 has 7 tuples. There are no NULL values in these relations. For each of the following relational algebra expressions, list the minimum and maximum numbers of tuples in the result that the relational algebra expression may have. (4) R1 ⋈ R2(5) ρX (R2) ⋈X.B≠Y.B ρY (R2) You can use the following format to organise your answers. (4) max=____ , min=____ ;(5) max=____ , min=____ ;
Defined the relational algebra operations as follows: SELECT (p, R) is equivalent to σp(R) referring to a set tuples of relation R that conforms to predicate p. PROJECT(L, R) is equivalent to πL(R) referring to a relation that contains a vertical subset of R, extracting the values of specified attributes L and eliminating duplicates. JOIN (R, p, S) refers to a relation containing a combination of tuples of relations R and S that satisfy the join condition p. FULL_JOIN (R, p, S) refers to a relation containing the result of outer join between relations R and S that satisfy the join condition p LEFT_JOIN (R, p, S) refers to a relation containing the result of left outer join between relations R and S that satisfy the join condition p RIGHT_JOIN (R, p, S) refers to a relation containing the result of right outer join between relations R and S that satisfy the join condition p CROSS (R, S) refers to a relation containing the catesian product of relations R and S. UNION (R, S)…
Defined the relational algebra operations as follows: SELECT (p, R) is equivalent to σp(R) referring to a set tuples of relation R that conforms to predicate p. PROJECT(L, R) is equivalent to πL(R) referring to a relation that contains a vertical subset of R, extracting the values of specified attributes L and eliminating duplicates. JOIN (R, p, S) refers to a relation containing a combination of tuples of relations R and S that satisfy the join condition p. FULL_JOIN (R, p, S) refers to a relation containing the result of outer join between relations R and S that satisfy the join condition p LEFT_JOIN (R, p, S) refers to a relation containing the result of left outer join between relations R and S that satisfy the join condition p RIGHT_JOIN (R, p, S) refers to a relation containing the result of right outer join between relations R and S that satisfy the join condition p CROSS (R, S) refers to a relation containing the catesian product of relations R and S. UNION (R, S)…
Let us consider the following relational database. Students(stuID, lastName, firstName, major, gpa) Faculty(facID, name, deptName, rank) Classes(classNhmber, facID, schedule, room) Enrolls(stuID, classNumber, grade) The primary keys are underlined. The referential integrity constraints are as follows: The column facID of relation Classes that references table Faculty, The column of stuID of relation Enrolls that references table Students, and The column classNumber of relation Enrolls that references table Classes. The following SQL statement is intended to define the table Students. However, this statement does not work correctly. CREAT TABLE Students( lastName VARCHAR(20), firstName VARCHAR(20), major VARCHAR(40) gpa DECIMAL(3,2), PRIMARY KEY(stuID)); However, this statement does not work correctly. Briefly explain why and list the corrected SQL statement.
Consider the following relation for published books:BOOK (Book_title, Authorname, Book_type, Listprice, Author_affil, Publisher)Author_affil refers to the affiliation of the author. Suppose the following dependencies exist:Book_title → Publisher, Book_typeBook_type → ListpriceAuthor_name → Author-affil (a) What normal form is the relation in? Explain your answer.(b) Apply normalization until you cannot decompose the relations further. State the reasons behind eachdecomposition.
Student ID | Student_name | Cource ID | Cource name | Grade 2 Noor 1 HIML B+ 7 C++ A 3 JAVA B 25 Al 2 C+ A 3 JAVA B 27 Sara 1 HIML A 3 JAVA A 28 Abmed 2 C++ B+ 1. What update anomalies may occur in the selation? 2. In which normal form (NF) the above relation? Provide an explanation to support your answer. 3. Decompose the relation so that the resut relations are in the third normal form (3NF).
Consider the following relations: Employee(E_id: integer, E_name: string, Age: integer, Salary: real) Works(E_id: integer, Dep_id: integer, Start_date: date) Department(Dep_id: integer, Dep_name: string, Budget: real, Manager_E_id: integer) What referential integrity constraints exist between these relations? What are the options for enforcing these constraints when a user attempts to delete a Dept tuple?
Q7. Consider a database containing two relations: R(A,B,C) and S(D,E,F). For each of three (your choice) of the 12 rewriting rules for relational algebra expression, give an example pair of relational algebra expressions involving R and S such that the rule rewrites one expression to the other expression, and give another example pair to show the rewriting rule cannot be used since some of the conditions for the rule are not satisfied.
Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. C(A,B,C,D,E,F,G,H) ?????????? ??????????: C,H > G A>BC B > CFH D > A F > EG (i) Find all the minimal super keys of the relational table ?. List the derivations of all minimal keys.(ii) Identify the highest normal form of the relational table ?. Remember that the identification of a normal form requires analysis of the valid functional dependencies.(iii) Decompose the relational table ? into minimal number of normalized relational tables in BCNF. Remember to indicate the primary key and foreign keys (if any).
The following is a relational schema for a database to document sharksightings for a research project. Primary keys are underlined. ForeignKeys are identified by FK, and their name indicates the attribute that theyreference.________________________________________________________________Sharks(shark_id:Integer, name:String, species_name:String,tagged_by_mission_id:Integer (FK))Sightings(shark_id:Integer (FK), sighting_num:Integer,sight_time:Timestamp, lat:Real, lng:Real, ocean:String, mission_id:Integer(FK))Missions(mission_id:Integer, start_date:Date, end_date:Date,vessel_id:Integer (FK))ResearchVessels(vessel_id:Integer, name:String)________________________________________________________________Sharks identified by a unique id, have a name which is not necessarilyunique, and a scientific species name.All Sharks are tagged and are sighted by Research Vessels, which areresearch ships that go on research Missions throughout the year. EachMission has a start and end date. Shark…