Explain different types of keys and relational model., Database Management System

Assignment Help:

Relational Model: The relational model uses a collection of tables to represent both data and the relationships among those data. Each table has multiple columns and each column has a unique name. Figure presents a sample relational database comprising three tables: One shows details of bank customer, the second shows accounts belong to which customers. The relational is an example of a record based model. Record based models are so named because the database is structured in fixed format records of several types. Each table contains of a particular types. Each types defines a fixed number of fields or attributes. The relational data model is the most widely used data model, and a vast majority of current database systems are based on the relational model. The relational model is at a lower level of abstractions than the E-R model.

Other Data Models: The object- oriented data model is another data model that has seen increasing attention. The object- oriented model can be seen as extending the E-R model with notions of encapsulation, methods, and object identity. Historically, two other data models, the network data model and the hierarchical data model, preceded the relation of data model. These models were tied closely to the underlying implementation, and complicated the task of modeling data. Semi structured data models permit the specification of data where indivisible data items of the same type may have different sets of attributes. This is in contrast with the data models mentioned earlier, where every data item of a particular type must have the same set of attributes. The extensible markup language (XML) is widely used to represent semi- structured data.

Keys:

Superkey: It is a set of one or more attributes that taken collectively; allow us to identify an entity set. Candidate key: Superkeys from which no proper subset is a superkey. Such minimal superkeys are called candedate keys.

Primary key: Allows us to distinguish between different entities of set. It must be chosen s.t. its attributes are never or rarely changed.

Foreign Key: When relation schema say r1may include among its attributes the primary key of another relation schema say r2. This attribute is called foreign key from r1, referencing r2, we sometimes define a primary key and sometimes not but there also candidate key will exist. Two attributes taken together can make a key called as composite primary key.


Related Discussions:- Explain different types of keys and relational model.

What is functional dependency, What is Functional Dependency? A Functi...

What is Functional Dependency? A Functional dependency is shown by X Y among two sets of attributes X and Y that are subsets of R specifies a constraint on the possible tuple

Functional dependency, Functional Dependency Consider a relation R that...

Functional Dependency Consider a relation R that has 2 attributes A and B. The attribute B of the relation is functionally dependent on the attribute A if and only if for every

Which components of the schema architecture proposed by ansi, What are thre...

What are three components of the schema architecture proposed by ANSI/SPARC? The three component schema architecture proposed by ANSI/SPARC is as given below: External sche

The need for three level architecture, The need for three level architectur...

The need for three level architecture The aim of the three level architecture is to divide each user's view of the database from the way the database is physically shown.

Index and tree structure, Index And Tree Structure Let us talk about th...

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

Characteristics, what are the main characteristics of database

what are the main characteristics of database

Which operations need the participating relations to union, Which operation...

Which operations need the participating relations to be union compatible? A UNION, INTERSECTION and DIFFERENCE operations need the participating relations to be union compatibl

Example of equijoin, Example: Consider the following relations: ...

Example: Consider the following relations: ROLLNO NAME ADDRESS COURSE_ID 100 Ka

Difference between internal tables and extra datasets, What is the differen...

What is the difference between internal tables and extract datasets? The lines of an internal table always have the similar structure. By using extract datasets, you can ha

What is a merge sort, QUESTION (a) Using an appropriate example, explai...

QUESTION (a) Using an appropriate example, explain what is a recursive function? (b) Explain in detail the C++ function given below. void search2(int list[],int n,int ele

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