A query in the tuple relational calculus is expressed as:
Correct Answer
D. All of the mentioned
Explanation
The tuple relational calculus, is a nonprocedural query language. It describes the desired information without giving a specific procedure for obtaining that information. 3. {t | - s µ instructor (t[name] = s[name] "' - u µ department (u[dept name] = s[dept name] "' u[building] = “Watson”))} a) Finds the names of all instructors whose department is in the Watson building b) Finds the names of all department is in the Watson building c) Finds the name of the dapartment whose instructor and building is Watson d) Returns the building name of all the departments This query has two “there exists” clauses in our tuple-relational-calculus expression, connected by and ().