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 features relational dbms contribute level of integrity, A well-maintai...

A well-maintained relational DBMS has a high level of data integrity. What features of a relational DBMS contribute towards this level of integrity? Relational DBMS gives high

Define query optimization, Define query optimization. Query optimizatio...

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.

State the design of associations, State the Design of Associations Bef...

State the Design of Associations Before designing associations, it is essential to know the way they are used. For this, analysis of association traversals is required. It is

What is the main advantage of the object model, What is the main advantage ...

What is the main advantage of the object model? What are its different components? The object model focuses on the logical data structures. Each object model comprises of many

Define network dbms, Define Network DBMS The NDBMS is built primarily o...

Define Network DBMS The NDBMS is built primarily on a one-to-many relationship, but where a parent-child representation between the data items cannot be ensured. This may occur

Define 2nf normal form, 2NF Normal Form : A relation schema process R i...

2NF Normal Form : A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2N

Develop a simple database of student records, In this programming assignmen...

In this programming assignment, you will develop a simple database of student records. Here are the requirements: 1) A student record contains a name and a number. We assume tha

Explain the dynamic hashing techniques, Explain the Dynamic Hashing Techniq...

Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica

Dealing with constraints violation, If the deletion violates referential in...

If the deletion violates referential integrity constraint, then three alternatives are available: Default option: - refuse the deletion. It is the job of the DBMS to describ

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