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.
Assume that you are responsible for selecting a new DBMS product for Sohar Hospital
What is a primary key? Primary key is chosen by the database designer as the principal means of identifying an entity in the entity set.
examples of fields in a database
What are the two types of indices? The two types of indices are:- A) Dense index B) Sparse index
Types of data independence Data independence can be classified into the following two types: Physical Data Independence: This means that for any change made in the physi
notes about update opreation
Explain the rules for creating a labelled precedence graph for testing view serializability. Ans: A schedule S is view serializable if it is view equivalent to a ser
What is hashing file organization? In the hashing file organization, a hash function is computed on some attribute of every record. The result of the hash function specify in
How does the system cope up with a record crash when recovery is going on after the first crash? Ans: In a system the undo and redo operations are needed to be idempotent to c
discuss the array implementation of a stack.
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