Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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))
Explain Recursive relationship type? Recursive relationship type: A recursive relationship is one in that the similar entity participates more than once in the relationship
1. Item based services will be charged fixed prices, and time-based will be charged variably depending on time. Such as per hour. Item-based: Fixed, pedicure, waxing, threading, fa
how draw er diagram
Ask questioYou are the database administrator in a university. You have been tasked to come up with a new database for the University. Using the stages in Database Life Cycle come
it can be possible to create any table without primary key
Submission Requirements All answers must be computer generated (including text and diagrams). The hand-in version must include a header page (or with sufficient space)
What are the DBMS languages? Briefly explain? Data Definition language (DDL):A database schema is specified through a set of definitions expressed through a special language
Super keys of a relation can have extra attributes. Candidate keys are minimal super key, i.e. such a key have no extraneous attribute. An attribute is known as extraneous if even
what are the states of transaction?
If R1 and R2 are two relations or functions, then the result of R3 = R1 × R2 is the combination of tuples that are in R1 and R2. The product is associative and commutative. Degr
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd