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.
Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.
What is a disjoint less constraint? Ans: It needs that an entity belongs to no much more than one level entity set. Disjoint less constraint needs that an entity belongs to
Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both
What is the need of a log in a DBMS? Briefly describe the various types of records that are normally present in a log. Ans: The system log, which is generally writt
Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as
Define Deadlock recovery measures To recover from deadlock, the cycle in the wait-for-graph should be broken. The common technique of doing this is to rollbac
This language that enable user manipulate to or access data as organized by appropriate data model. Low level or Procedural DML : DML needs a user to specify what data ar
Describe the difference between a one-to-many and a many-to-many relationship. Which logical data structures comprise one-to-many and which comprise many-to-many relationship?
Single-Valued Dependencies A database is a collection of related information and it is therefore inevitable that some items of information in the database would depend on some
What are uncommitted modifications? The immediate-modification technique permits database modifications to be output to the database whereas the transaction is still in the act
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