Define a relation schema, Database Management System

A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples. Let r be the relation which have set tuples (t1, t2, t3, ..., tn). Each tuple is an ordered list of n-values t=(v1,v2, ..., vn).

The purpose of the relational model is to give a declarative function for specifying queries and data: users directly state what information the database have and what information they want from it, and let the database management system software take care of explain data structures for retrieval procedures and storing the data for answering queries.

 

1225_Relational Schema.png

Posted Date: 7/30/2012 1:52:29 AM | Location : United States







Related Discussions:- Define a relation schema, Assignment Help, Ask Question on Define a relation schema, Get Answer, Expert's Help, Define a relation schema Discussions

Write discussion on Define a relation schema
Your posts are moderated
Related Questions
Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

Question 1 What is data mining? Write Data Mining applications Question 2 What is OLAP? Write the benefits of OLAP Question 3 What is Business Intelligence? Explai

How Relational Calculus is different from Relational Algebra? What do understand by TRC queries and DRC queries?  Ans: Relational calculus contain two calculi, the tuple relati

explain in detail about time stamp orderting/

Explain Superkey Ans: A superkey is described in the relational model of database organization like a set of attributes of a relation variable for which it holds that in all re

The Database Approach In order to overcome the limits of a file system, a new approach was needed. Hence a database approach emerged. A database is a persistent collection of

Describe sequential file organization.  Explain the rules for (i)  Inserting a new record. (ii)  Deleting an existing record.          Ans:A sequential f

Given the following set of functional dependencies {cf?bg, g?d, cdg?f, b?de, d?c} defined on R(b,c,d,e,f,g) a.Find a non-redundant cover. b.Find a canonical cover.

Question A What is operational intelligence? Question B What is Business Intelligence? Explain the components of BI architecture Question C Differentiate between databas

define locking in simple language and decribed it