Download DATA BASDE MANAGEMENT SYSTEM A data model The Flat

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Open Database Connectivity wikipedia , lookup

Concurrency control wikipedia , lookup

Microsoft Jet Database Engine wikipedia , lookup

Entity–attribute–value model wikipedia , lookup

Extensible Storage Engine wikipedia , lookup

Database wikipedia , lookup

Clusterpoint wikipedia , lookup

Relational model wikipedia , lookup

Database model wikipedia , lookup

Transcript
DATA BASDE MANAGEMENT SYSTEM
A data model
•
Data Structure: defines how data are organized: (hierarchical, network, relational, objectoriented).

The Flat Model Database
In a flat model database, there is a two dimensional (flat structure)
array of data. For instance, there is one column of information and
within this column it is assumed that each data item is related to
the other. For instance, a flat model database includes only zip
codes. Within the database, there is only one column and each new
row within that one column will be a new zip code.

The Hierarchical Model Database
The hierarchical model database resembles a tree like structure,
such as how Microsoft Windows organizes folders and files. In a
hierarchical model database, each upward link is nested in order to
keep data organized in a particular order on a same level list. For
instance, a hierarchical database of sales may list each day’s sales
as a separate file. Within this nested file are all of the sales (same
types of data) for the day.

The Network Model
In a network model, the defining feature is that a record is stored
with a link to other records – in effect networked. These networks
(or sometimes referred to as pointers) can be any type of
information such as node numbers or even a disk address.

The Relational Model
The relational model is the most popular type of database and an
extremely powerful tool, not only to store information, but to
access it as well. Relational databases are organized as tables. The
beauty of a table is that the information can be accessed or added
without reorganizing the tables. A table can have many records and
each record can have many fields.
Tables are sometimes called a relation. For instance, a company
can have a database called customer orders. Within this database
are several different tables or relations all relating to customer
orders. Tables can include customer information (name, address,
contact, info, customer number, etc.) and other tables (relations)
such as orders that the customer previously bought (this can
include item number, item description, payment amount, payment
method, etc.). It should be noted that every record (group of fields)
in a relational database has its own primary key. A primary key is a
unique field that makes it easy to identify a record.
•
•
•
Data Integrity: provides a language or implicit rules for maintaining data integrity in the data
model instance.
Data Manipulation: provides a language to create, update and delete data.
Data Querying: provides a language to query data.
In relational databases everything is stored in relations. There are two integrity rules entity
integrity and referential integrity. Data manipulation and querying is achieved through a set of
relational algebra operators. Every relational database conforms to the same rules.
In object-oriented databases there are no hard and set rules for the structures that may be used. In
fact it is generally expected that an OODBMS will be able to make any arbitrary complex data
structure persist in permanent storage.
Since there are no rules as to the structures that can be created the data model is not able to
specify rules which govern the validity of the structures.
OO databases generally specify a programming language which may be used to manipulate
them. However, these programming languages are usually much more complex than relational
languages. (Relational languages are relationally complete but not computationally complete).
There are at least two consequences to the fact that is not possible to specify a model for OO
data. Firstly, it is not possible to specify a universal query language. The language OQL which is
the nearest equivalent to SQL in the OO database world relies on users limiting themselves to
structures which can be described by ODL. This is only capable of describing a subset of the
structures which can be created in an ODBMS. The second consequence is that it makes it
difficult for ODBMS products to interoperate as they have no common interpretation of the
underlying data.