Write a query to find name from the relational algebra, Database Management System

Assignment Help:

Consider the relations
City (city_name, state)
Hotel (name, address)
City_hotel (hotel_name, city_name, owner)

Answer the following queries in relational algebra
(i) Find out the names and address of hotels in Agra.
(ii) List the names of cities that have no hotel.
(iii) List the names of the hotels owned through ‘Taj Group'.

Ans: (i) Π name, address ( σ city_name= ‘Agra' (Hotelname=city_name City_hotel))
(ii) Π city_name (City) - Π city_name(City_hotel)
(iii) Π hotel_name ( σ owner='Taj Group' (City_hotel))


Related Discussions:- Write a query to find name from the relational algebra

Which is another name for weak entity, Which is another name for weak entit...

Which is another name for weak entity? Child is another name of weak entity.

Consistency-transaction , Consistency: This property makes sure that a com...

Consistency: This property makes sure that a complete transaction implementation takes a database from one consistent state to another consistent state. If the transaction fails e

Deletion operation - update operations, By using the delete operation some ...

By using the delete operation some consisting records can be deleted from a relation. To delete some definite records from the database a condition is also specified based on which

Design and building a distributed information system, prototype of a distri...

prototype of a distributed information system for a national car part retail outlet chain.

Which data type can store unstructured data, Which data type can store unst...

Which data type can store unstructured data? Raw data type can store unstructured data.

Determine the statement- state as location within a program, State as Locat...

State as Location within a Program In this traditional approach, location of control inside a program totally defines the program state. Any finite state machine may be implem

Explain candidate key and super key, Explain Candidate Key and Super Key ...

Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher

Determine the operation that do not participate to be union, 1. Which relat...

1. Which relational algebra operations do not need the participating tables to be union-compatible? Ans: Join is the relational algebra operations that do not need the particip

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd