Ordering of tuples, Database Management System

Assignment Help:

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.


Related Discussions:- Ordering of tuples

Dbms built for online transaction processing, Problem: A DBMS built for...

Problem: A DBMS built for Online Transaction Processing (OLTP) is usually regarded as unsuitable for data warehousing. Each system is designed with a different set of requireme

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

Join relation of two tuples, Consider the join of a relation R with relatio...

Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is: If R has m tuples and S has n tuples then maximum siz

A b-tree of order how much children m has maximum, A B-tree of order how mu...

A B-tree of order how much children m has maximum ? m has maximum m mchildren in a B tree.

State in brief about object design, Give the Introduction of OBJECT DESIGN ...

Give the Introduction of OBJECT DESIGN Strategies which are selected during system design are carried out in object-oriented design. In this procedure, objects which are identi

Define two phase commit, Define Two phase commit Two phase commit: To m...

Define Two phase commit Two phase commit: To make sure atomicity, all the sites where a transaction is being executed must agree on the final outcome of the execution. The tran

Define page, Define page. The database is partitioned into some number ...

Define page. The database is partitioned into some number of fixed-length blocks, which are referred to as pages.

Dirty reads-problems of concurrent transactions, Dirty Reads: T10 reads a ...

Dirty Reads: T10 reads a value which is updated by T9. This update has not been committed and T9 aborts. T9 T10 Value of x old value = 200

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd