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!
A relation instance indicates as r is a collection of tuples for a given relational schema at a exact point of time.
A relation state r of the relation schema R (A1,A2,..........AN), also denoted by r(R) is a set of n-tuples
r = {t1,t2,............tm}
Where each n-tuple is an ordered list of n values
t = 1,v2,........, vn>
where every vi belongs to domain (Ai) or includes null values.
The relation schema is also known as 'intension' and relation state is also known as 'Extension'.
Increased parallelism : Since the replicated date has several copies a query can be distributed or can be answered from the smallest loaded site. Also, with more replicas you have
What is known as heap file organization? In the heap file organization, any record can be placed anywhere in the file where there is space for the record. There is no ordering
What are the General Transformation Rules for Relational operations? Ans: The transformation rules transform one relational algebra expression to AN EQUIVALENT ONE 1. E
What is DML (Data Manipulation Language)? This language that enable user to access or manipulate data as organised by appropriate data model. Procedural DML or Low level: DM
Discuss the differences among the candidate keys and the primary key of a relation. Give instance to describe your answer? A candidate key is one that can be used as primary ke
When are two schedules said to be view equivalent? Ans: Two schedules that is denoted as S and S' are said to be view equivalent if the subsequent three conditions are met
What are the parts of SQL language? The SQL language has various parts: data - definitition language Data manipulation language View definition Transaction contr
explain five responsibilities of DBA?
What are the two methods for dealing deadlock problem? The two procedures for dealing deadlock problem is deadlock detection and deadlock recovery.
3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R
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