answersLogoWhite

0

A relational model is the means of ordering elements that relates to one another, called a tuple.

Multiple tuples of similar structure can be seen as a table, with rows that describe each tuple, and similar elements ordered in columns.

All operation are described as binary operation as in calculus, e.g. "Insert" is the same as addition, as a new relation is added, where the elements in the relation constitutes a new unique group of values.

Any tuple can have a relation to another tuple - such as "they belong together" or "one comes after the other".

That relations can be represented as tables is used by a number of application building tools, such as MS Access. These refer to the similar elements - the column by assigning them names. They will usually also assume a similar datatype (int, numeric text, float, code, text, etc). The relation model is entirely based on mathematics, relational calculus and relational algebra developed by Chris Data and Ted Codd at Watson Height, IBM Research Center.

The relational model does not relate to any relationship between the tables, and relationships needs to be coded by the application programmer that use codes to make e.g. a parent relates to child. The database system can implement constraints such as that every child has a parent, while not every person has a child.

The model is then used by application developers to create the user interface.

The competing model is the CODASYL network model that was made to satisfy the requirements for application support. This will provide "pointers" that can link a child to a parent, and an order line to a order. However, these does not lend themselves to allow generic tools such MS Access to make the applications, as it does not support the flexibility needed to "just make it".

User Avatar

Wiki User

14y ago

Still curious? Ask our experts.

Chat with our AI personalities

CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach
MaxineMaxine
I respect you enough to keep it real.
Chat with Maxine
TaigaTaiga
Every great hero faces trials, and you—yes, YOU—are no exception!
Chat with Taiga

Add your answer:

Earn +20 pts
Q: What is a relational model?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Math & Arithmetic

Describe three commonly used data models?

Enterprise data model, Relational model and ????


What is the utility of relational algebra relational calculas name some software's based on these concept?

What is the utility of relational algebra relational calculas name some software's based on these concept?"


What is an example of an access relational database?

There is no such thing as an 'Access' Relational Database.A Relational Database Management System is one that has been built to deliver the requirements set out by Edgar Codd in 1970 such that the functions provided by the software conform to relational algebra. This means that the validity actions of the database management system over the data contained in it can be modeled and proved on a mathematical basis.Oracle, DB2, SQL Server, MySQL, etc. all implement most of the requirements of Codd's paper.It is worth noting that the relational model is the ONLYone where the affects of putting data in it can be proven.


Explain the select Operation in Relational Algebra with an example?

Relational Algebra - Example


What are the main differences between relational algebra and relational calculus?

Relation algebra is a procedural language where relation calculus is non-procedural languageRelational algebra, an offshoot of first-orderlogic (and of algebra of sets), deals with a set of finitaryrelations (see also relation (database)) which is closed under certain operators. These operators operate on one or more relations to yield a relation. Relational algebra is a part of computer science.Relational calculus consists of two calculi, the tuplerelational calculus and the domain relational calculus, that are part of the relational model for databases and provide a declarative way to specify database queries. This in contrast to the relational algebra which is also part of the relational model but provides a more procedural way for specifying queries.The relational algebra might suggest these steps to retrieve the phone numbers and names of book stores that supply Some Sample Book:1. Join books and titles over the BookstoreID.2. Restrict the result of that join to tuplesfor the book Some Sample Book.3. Project the result of that restriction over StoreNameand StorePhone.The relational calculus would formulate a descriptive, declarative way:Get StoreNameand StorePhonefor supplies such that there exists a title BK with the same BookstoreIDvalue and with a BookTitlevalue of Some Sample Book.The relational algebra and the relational calculus are essentially logically equivalent: for any algebraic expression, there is an equivalent expression in the calculus, and vice versa.This result is known as Codd'stheorem