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!
Define- relational algebra.
The relational algebra is a procedural query language. It having of a set of operations that take one or two relation as input and make a new relation as output.
Define According to the levels of abstraction, the schema at the intermediate level is called Ans: As per to the levels of abstraction, the schema at the intermediate level is
The First Normal Form (1NF) Let us first describe 1NF: Definition: A relation (table) is in 1NF if 1. There are no duplicate tuples or rows in the relation. 2.
what are the purposes of dbms in details
what is union compatable?
Explain Superkey Ans: A superkey is described in the relational model of database organization like a set of attributes of a relation variable for which it holds that in all re
Mention the type of constraints we can specify in the CREATE command of DDL. The type of constraints that can be specified are as follows:- PRIMARY KEY, NOT NULL, UNIQUE, FOR
give me a diagram about physical or internal level
what is 3nf
Consider the relations described below: PHYSICIAN (regno, name, telno, city) PATIENT (pname, street, city) VISIT (pname, regno, date_of_visit, fee) Where the regno and pname ide
Question: a) There are three concurrency problems, i.e. three types of potential mistake which could occur if concurrency control is not properly enforced in the database syst
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