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!
In a relation, tuples are not inserted in any definite order. Ordering of tuples is not defined as a part of a relation definition. Though, records may be structured later according to some attribute value in the storage systems. For instance, records in PERSON table may be structured according to PERSON_ID. Such organisation or data depends on the requirement of the underlying database application. Though, for the purpose of display we may get them displayed in the sorted order of age. The following table is sorted by age. It is also worth states here that relational model does not permit duplicate tuples
PERSON
PERSON_ID NAME AGE ADDRESS
2 Sharad Gupta 33 Pocket 2, Mayur Vihar.
1 Sanjay Prasad 35 b-4,Modi Nagar
3 Vibhu Datt 36 c-2, New Delhi
Super Keys, Candidate Keys and Primary Keys for the Relations
As discussed in the last section ordering of relations does not matter and all tuples in a relation are unique. Though, can we uniquely recognize a tuple in a relation? Let us talk about the concepts of keys that are primarily used for the purpose as above.
what is object-identity
why three level architecture had been developed/
How does a query tree represent a relational algebra expression? Discuss any three rules for query optimisation, giving example as to when should each rule be applied. Ans
wh
what is correlation in nested query
What are the three fundamental operations that are regular to MySQL Programs? a) Establishing a connection to the MySQL server b) Choosing a database. c) Disconnecting fr
Explain data independence ? Data independence is the capacity to modify the schema at one stage of a database system without having to change the schema at the further level.
Suppose R is a relation with attributes A1, A2,..., An. As a function of n, tell how many superkeys R has, if: 1.1 The only key is A1. 1.2 The only key is A1 and A2. 1.3 The o
What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec
A Structure of a dependency diagram
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