Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

code following using tuple relational calculus. Q1. Consider the following tables (relations) that contain information (all stored as names) about persons visiting theatres, movies played

code following using tuple relational calculus.

image text in transcribed

Q1. Consider the following tables (relations) that contain information (all stored as names) about persons visiting theatres, movies played by theatres, movies liked by persons, and players who star in movies. A person can like several movies; a movie can be liked by many persons. A person can go to several theatres, and a theatre is visited by many persons. A theatre can play many different movies, and a movie can be played by several theatres. A player may star in several movies and a movie may involve many players, further a player may be a person, that is, some persons are players. Please note that in all the queries some means at least one Goes(person, theatre) Plays(theatre, movie) Likes(person, movie) Stars(movie, player) Code (e, f) in tuple relational calculus: e) Find every person who goes to theatres that play all the movies in which he/she stared? f) Find every theatre which plays movies liked by at least one player

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Modern Database Management

Authors: Heikki Topi, Jeffrey A Hoffer, Ramesh Venkataraman

13th Edition

0134773659, 978-0134773650

More Books

Students also viewed these Databases questions

Question

Why do HCMSs exist? Do they change over time?

Answered: 1 week ago