INDEX

INTRODUCTIONO ............................................................................................................................................ 2
GENERAL OBJECTIVE.................................................................................................................................. 3
Specific ObjectivesS ..................................................................................................................... 3
1. BASE OF DATA............................................................................................................................... 4
1.1. ADVANTAGES DATABASE............................................................................................ 4
2. SYSTEM ON DATABASE MANAGEMENT............................................................. 6
2.1. DATA............................................................................................................................................. 6
2.2. ARCHITECTURE DATABASE SYSTEMS......................................................... 6
3. O ENTITY-RELATIONSHIP MODEL.............................................................................. 7
3.1. ENTITIES AND ENTITY SETS ............................................................................. 7
3.2. ATTRIBUTES AND CONTROL OF VALUES.................................................................................... 8
3.3. RELATIONSHIP................................................................................................................... 9
3.4. O EXTENDED ENTITY-RELATIONSHIP MODEL (EER)..................................... 10
3.5. O RELAIONAL MODELL ......................................................................................................... 11
3.6. O STRUCTURAL ASPECTL ........................................................................................................ 11
3.7. The ASPECT OF INTEGRITY................................................................................................. 12
4. O SQL STANDARD............................................................................................................................... 15
4.1. LANGUAGE DEFINITION OF DATA............................................................................... 15
4.2. LANGUAGE ON DATA MANIPULATION....................................................................... 15
4.3. TABLES....................................................................................................................................... 16
4.4. CONSULTATIONS ................................................................................................................................. 16

5. CONCLUSION .................................................................................................................................... 17
6. REFERENCES.................................................................................................................................. 18
INTRODUCTION
Databases are increasingly present in our daily lives, given that most of the
The activities we carry out involve, directly or indirectly, the use of a database. In light of
thus, we will present in the following sections an introduction to the fundamental concepts of base of
data. Considering that the database is mostly still relational, this
work will highlight them. Thus, the first chapter defines a database and also discusses the
advantages arising from this approach. The second chapter defines database system, thus
briefly discusses each element that composes it. The third chapter addresses the
Entity-Relationship model, as well as the corresponding diagramming technique, which is
used to model database. The fourth chapter contains a report on the SQL standard,
language used to structure and manipulate relational databases.

2
GENERAL OBJECTIVE
Analyze the functionalities and importance of the database

SPECIFIC OBJECTIVES
Analyze the types of databases
Analyze the data modeling
Advantages of the database
Analyze the database management systems
Analyze the database objects

3
 DATABASE
According to DATE (2004, p. 10), 'A database is a collection of persistent data, used
through the application systems of a certain company." In other words, a database
it is a place where data needed for the maintenance of the activities of a certain
organization, with this repository being the data source for current applications and those that will come
to exist.

1.1. ADVANTAGES OF DATABASES

Centralized data control: the data is concentrated in a single location and this
provides greater control. In the file processing approach, the data
they are scattered, as each application maintains its own data files.
Redundancy control, storage space reduction, and sharing of
data: in conventional file processing there is a waste of space
storage, since the same information usually appears in many files
different. In a database approach, the data is stored only once and can be
shared (either concurrently or not) by various users.
Elimination of inconsistencies and assurance of integrity: in the traditional method, based
in files, given the repetition of stored information, it may happen that the same
data may present divergent values. This occurs, for example, when a data that is
present in two files is updated in only one location. It is said that the files are
inconsistent, as they present different entries for the same data. And if it is lacking
consistency, there is no integrity (the file contains incorrect information). In the database
Data allows for maintaining consistency and integrity of the data.
Establishment of standards and ease of access to data: in the banking approach
data, due to the centralization of data, it becomes more conducive to establish standards of
nomenclature and documentation. Due to this standardization, the retrieval of information
is more efficient. In the conventional form of storage, data is scattered in
files of various formats and the applications that access this data were written in
different programming languages.
Data independence: in the file system, the definition of the structure of
storage and the method of access to the data is included in the application code.
These are called data dependencies, as it is impossible to alter the structure of the

4
data files without modifying the respective application program. Databases,
however, they allow for data independence, as they enable data abstraction (which
It will be discussed later.

5
 2. DATABASE MANAGEMENT SYSTEM
According to DATE (2004, p. 6), a database management system is 'a system
computerized whose general purpose is to store information and allow users
search and update this information when requested." For the author, a bank system of
data consists of data, hardware, software, and users.

[Link]
SETZER and CORRÊA DA SILVA (2005, p. 2) define data as a symbolic representation.
(that is, made through symbols), quantified or quantifiable.” Complementing, ELMASRI
According to NAVATHE (2011, p. 3), they state that data are 'known facts that can be recorded and'
has implicit meaning." In this way, an employee's registration number is a piece of data,
because for the company it is a known fact, it contains semantics, it is represented by symbols
(digits from 0 to 9 - base 10 number system, therefore it is quantified) being, therefore, liable
of registration

[Link] SYSTEM ARCHITECTURE

In addition to the characteristics already mentioned, the database approach also
allows what we call data abstraction. According to ELMASRI and NAVATHE (2011, p. 19),
data abstraction "refers to the suppression of details regarding the organization and storage of data,
highlighting essential resources for a better understanding of this data." In other words,
It is possible to describe the database without focusing on hardware and software specifics. For
describe the database without getting bogged down in the details of how it will be implemented
we use data models. In the definition by ELMASRI and NAVATHE (2011, p. 19), a model
data is "a collection of concepts that can be used to describe the structure of a
database." According to the authors, depending on the type of concept used in this
description, data models can be classified into:

High-level or conceptual data model: it is the closest to the end user. Entities,
attributes and relationships are some of the concepts used. An example of this model
It is the Entity-Relationship Model that will be discussed later.

6
 Representative or implementation data models: Relational Data Models,
Hierarchical and Network are examples of this model. Here the data is shown using
record structure.
Low-level or physical data model: describes the data of the previous model for
storage on the computer. It deals, for example, with the format of records and the
ways to access this data.

3. THE ENTITY-RELATIONSHIP MODEL

The Entity-Relationship approach is based on the Entity-Relationship Model that was
introduced by Peter Pin-Shan Chen in 1976. It is an enhancement of the originally model
proposed, being one of the most well-known semantic modeling techniques and possibly a
of the most used. DATE (2004, p. 355). One of the main advantages – perhaps it is the reason
greater for its popularity - is that besides concepts the model still has a technique of
layout. This allows for the simplified recording and communication of the main aspects of
database project DATE (2004, p. 358). "The ER model describes data as entities,
relationships and attributes" (ELMASRI; NAVATHE, 2011, p. 132).

3.1. ENTITIES AND SET OF ENTITIES

An entity is a 'thing' or an 'object' in the real world that can be identified in a way
unique in relation to all other objects" (SILBERSCHATZ; KORTH; SUDARSHAN, 1999,
p. 21). For example, each server of a public educational institution is an entity. Each
teaching unit (campus) of this entity as well. The entities are classified as: entities
regular or strong entities and weak entities. According to DATE (2004, p. 355), a weak entity is 'a
entity whose existence depends on some other entity, in the sense that it cannot exist
if this other entity does not exist either.” The dependents of a server are classic examples
of weak entities, because they will exist if and only if the server entity exists. Now a entity
regular or strong, can be defined as a non-weak entity. For example, a server is a
strong entity.

7
According to SETZER and CORRÊA DA SILVA (2005, p. 22), a set of entities is 'a collection
of entities that have similar characteristics, that is, of beings in the same category.
the set of entities Servers represents the collection of all servers that work
in that institution. And the set of entities Campi refers to the set of all units.
of teaching that body. A set of entities is represented in the E-R model by a
rectangle.

3.2. ATTRIBUTES AND VALUE DOMAIN

An entity is represented by a set of attributes. Attributes are descriptive properties.
of each member of a set of entities" (SILBERSCHATZ; KORTH; SUDARSHAN,
1999, p. 22). In other words, attributes are the data that one wishes to store about each entity.
(SETZER; CORRÊA DA SILVA, 2005, p. 23). Thus, the name, the record, and the date of
Naming are possible attributes for each entity of the set of entities Servers.
Address and acronym would make up the attributes of each entity in the set of entities Campi.
attributes can be classified as:

Simple or Composite According to ELMASRI and NAVATHE (2011, p. 153), 'attributes

non-divisible are called simple or atomic attributes. On the other hand, attributes
compounds do not have elemental value and can be decomposed into other attributes
simple and/or compound (SETZER; CORRÊA DA SILVA, 2005, p. 24).
For example, the address of each server is a compound attribute, as it can be divided.
in some simple attributes, such as: Street, Number, Complement, Neighborhood, City and
State.
Monovalued or Multivalued A monovalued attribute is one that takes on a
unique value for a given entity. Meanwhile, a multivalued attribute can have n
values considering the same entity (SETZER; CORRÊA DA SILVA, 2005, p. 27).
For example, the Gender attribute of the set of entity Servers is an attribute
univocal, as it assumes a single value – male or female – for each entity.
On the contrary, the Phone attribute is considered multi-valued, since a server can
to have several contact phones and, consequently, this attribute will take on n values.

8
 Stored or Derived Regarding the derived attribute SILBERSCHATZ, KORTH and
SUDARSHAN (1999, p. 24) defines that 'the value of this type of attribute can be derived
of other attributes or entities related to it." The attribute Data_Exercicio that
The date of commencement of effective exercise of each server is an example of an attribute.
stored. The attribute Contribution_Time represents the total length of service
provided to the institution is a derived attribute, because it can be obtained from the value of
Exercise data and by the current date.
Nulls 'A null attribute is used when an entity does not have a value for a certain
attribute" (SILBERSCHATZ; KORTH; SUDARSHAN, 1999, p. 24). The attribute
The Reservist Number of the group of entities Servers is a null attribute, as it does not
applies to all entities (servers do not have Military Service Card).
Keys or Determinants SETZER and CORRÊA DA SILVA (2005, p. 31) define that
Given a set of entities, there are no two entities in that set with the same value.
for that attribute. In other words, given a value for that attribute, that value
determine to which entity it is associated.

3.3. RELATIONSHIPS
A relationship is an association between one or several entities.
KORTH; SUDARSHAN, 1999, p. 24). Illustrating, when we refer to the place where each
the server performs its activities - its assignment - this data does not refer only to Servers
and not solely to Campi, but to both. This element is dependent on one and the other entity
it is represented in the ERD by what is called a relationship. So, in our example, we say
the entities in Servers are associated with the entities in Campuses through the relationship
Grouping. "A set of relationships is a set of relationships of the same type."
(SILBERSCHATZ; KORTH; SUDARSHAN, 1999, p. 25). In the E-R model, sets of
relationships are represented by diamonds.

9
Fig.1 graphical representation of relationship

We should read the previous diagram as follows: Servers are stationed at Campuses,
left to right; and Campié occupancy of Servers, from right to left. "The entities
Those involved in a certain relationship are said to be participants in that relationship.
The number of participants in a certain relationship is called the degree of that relationship.
(DATE, 2004, p. 357). Thus, in the previous example there is a relationship of degree two.
(also known as binary relationship), as there are two sets of entities
participants: Servers and Campuses. Relationships, similarly to entities, can have
descriptive attributes (SILBERSCHATZ; KORTH; SUDARSHAN, 1999, p. 25). For example,
let us suppose that the servers may, at the interest of public administration, be removed from a
work pole to another and that it is necessary to store in a database the history of the
removals made. So, to the relationship Allocation, which associates Servers and Campuses, adds
the attribute Start_Date which will represent the employee's admission date in a given campus.
In this way, we will record the server's movement in each of the campuses in which it
come to work.

Fig. 2 Relationship with descriptive attribute

3.4. THE EXTENDED ENTITY-RELATIONSHIP MODEL (EER)

The basic concepts of the Entity-Relationship (E-R) Model are sufficient to build
the schema of a large part of the databases. However, some situations are modeled as
the more correct way using additional resources called extensions of the E-R. These tools
understand the concepts of super/subclass, inheritance of attributes, specialization and
generalization. All of them, together with the E-R concepts discussed so far, make up the
called Extended Entity-Relationship Model (EER).

10
 3.5.O RELATIONAL MODEL
The Relational Model (RM) is a representative (or implementation) data model that was
proposed by Ted Codd, in 1970. The model is based on concepts from mathematics–theory
two sets and predicate logic. The first commercial systems based on MR were
made available in 1980 and since then it has been implemented in many systems, such
like Access, Oracle, MySql, among others (ELMASRI; NAVATHE, 2011, p. 38). For DATE
(2004, p. 67), the relational model refers to 'three main aspects of data: the structure of
data, data integrity, and data manipulation.

3.6. THE STRUCTURAL ASPECT

In the Relational Model, the database is represented as a set of relations.
Considering that a relationship is, in a way, similar to a table of values and applying to
in MR terminology, the rows are called tuples; the columns, attributes; and the table in
yes, relationship (ELMASRI; NAVATHE, 2011, p. 39).

Fig. 3 Attributes and tuples of a relation

The set of values that each attribute can take is called a domain (SILBERSCHATZ;
KORTH; SUDARSHAN, 1999, p. 62). Let Dn, where D is the domain of a certain attribute and n
the position of the attribute in the relation and considering the relation Positions (figure 3), it is known that D1 is

domain of the attribute Code, as it represents the set of all possible job codes.
D2 is the domain of Denomination, as it denotes the set of all job titles.
D3 is the domain of Class, as it represents the set of all job classes, and so on.
in front of. According to SILBERSCHATZ, KORTH, and SUDARSHAN (1999, p. 62), a relation is

11
mathematically defined as a subset of the Cartesian product of a list of domains.
In this way, the relation Positions is denoted by D1xD2xD3xD4, that is, Positions is a subset
of the set of all possible combinations of values. A relation scheme (or scheme of
relation) is used to describe a relationship. A schema is indicated by R(A1, A2, c, An), where
R is the name of the relation and An are its attributes (ELMASRI; NAVATHE, 2011, p. 40). For example,
Positions (Code, Denomination, Class, Category) represent the schema of the Positions relation.
The number of attributes in a relational schema is called degree or arity (ELMASRI;
NAVATHE, 2011, p. 40). Positions, for example, is a relationship of degree three. An instance of
A relation (or state of relation) is a set of tuples – their values at a given moment. The state
r of the R schema, denoted by r(R), is a set of tuples r={t1, t2,..., tn}, where each tuple t is
formed by a list of values t=(v1, v2, c, vn), where each value vi is in the domain of
respective attribute Ai (ELMASRI; NAVATHE, 2011, p. 40). For example, the instance of
The diagram of the relationship Positions (figure 13) is composed of five tuples, each tuple is a list of four.

valores (por exemplo, na primeira tupla temos os seguintes valores: 701001, Administrador, E,
Technical-Administrative), with each value being an element of the domain of the corresponding attribute

(701001 is in the domain of the Code attribute, Administrator is in the domain of Denomination, and
is in the domain of Class and Technical Administrative is in the domain of Category.

3.7. THE ASPECT OF INTEGRITY

In this section, we will discuss the concepts of: superkey, key, candidate key, primary key,
unique key (or alternative key), foreign key and referential integrity. “A superkey
it is a set of one or more attributes that, taken collectively, allow us to identify
a unique way an entity in a set of entities" (SILBERSCHATZ; KORTH;
SUDARSHAN, 1999, p. 32). In the relationship Positions (Figure 3), the sets {Code, Category} and
Denomination
what is there for this set of attribute tuples that have the same combinations of values. In
According to DATE (2004, p. 233), a set of attributes is said to be a key if it satisfies the conditions

1.) Uniqueness: this is the property fulfilled by superkeys, as specified.

previously. That is, for a given set of attributes, there are no tuples in the relation with
equal values.

12
 2.) Irreducibility: establishes that there should not be anything in the set of attributes called key
a subset that has the property of uniqueness. In other words, besides following
the first rule, the key must be a minimum set of attributes. For example, the
set {Code, Denomination} is not a key, because although it satisfies the first
the rule ends up breaking the second–{Code} and {Denomination}, taken separately,
uniquely identifies each tuple in the Positions relation. The set {Code} is a
example of a key, as it simultaneously meets the two conditions above. A relationship
can have more than one key, each of which is called a candidate key
(ELMASRI; NAVATHE, 2011, p. 45). {Code} and {Denomination}, for example, are
candidate keys. The candidate key used to identify tuples in a given relation
is called the primary key. The other candidate keys of this relation are called keys.
unique. A primary key is indicated by underlining the attributes in the relation schema
they compose (ELMASRI; NAVATHE, 2011, p. 45). Illustrating, the schema of the relationship

Cargos ficaria assim: Cargos(Codigo, Denominacao, Classe, Categoria).

Based on the information provided by SETZER and CORRÊA DA SILVA (2005, p. 124),

we will discuss the concepts of foreign key and referential integrity through a
example.

Fig. 4 a) Entity-relationship diagram b) cargo and servers relationships

Considering the representation above, we interpret from the Entity-Relationship Diagram (figure
4a) that each entity in the set of entities Servers occupies at least one and at most one position.

13
Meanwhile, a position can be occupied by none or many employees. Mapping this situation
for the Relational Model, the following relation schemas are obtained: Positions(Code,
Denomination
Consequently, there will be two relationships according to figure 4b. Note that the relationship
Occupation between the sets of entities Servers and Positions occurs in the Relational Model.
(figure 4b) through the transposition of the Attribute Code of Positions for Servers. This attribute
transposed in Servers (it has as origin the relation Positions and as destination the relation Servers)
it is called a foreign key. A tuple in Servers refers to a tuple in Positions,
since this reference is made through the value contained in the attribute Code. It is called
referential integrity is the rule that the value contained in the foreign key of Servers must
correspond to a primary key value in Positions. In other words, the integrity
referential is the restriction that 'the database cannot contain any key values'
"non-corresponding foreigners" (DATE, 2004, p. 237).

14
 4. THE SQL STANDARD
Structured Query Language (SQL) was created by IBM.
Research, in the early 1970s, for the prototype of a database system called
System R (DATE, 2004, p. 71). Based on the languages of Algebra and Relational Calculus, and
initially named SEQUEL (Structured English QUEry Language), SQL today is the
standard language for Relational Database Management Systems (RDBMS), being
more intelligible than their native languages – considered too technical for the user
SQL is standardized by the American National Standards
Institute (ANSI) and by the International Standards Organization (ISO), jointly. The first
The standard version, called SQL-86 (or SQL1), was released in 1986 and has been since then
updated–SQL-92 (or SQL2), SQL:1999 (or SQL3), SQL:2003, SQL:2006 and, furthermore, another one
the update occurred in 2008 (ELMASRI; NAVATHE, 2011, p. 57). Although known as
a 'query language', SQL also offers features to define the structure of the data,
update–include, exclude and modify–data, specify integrity constraints and other features
but (SILBERSCHATZ; KORTH; SUDARSHAN, 1999, p. 109). According to DATE (2004,
p. 85), SQL has, among others, the following components: Data Definition Language (DDL)
Data Definition Language and Data Manipulation Language (DML) or Language of
Data Manipulation.

[Link] DEFINITION LANGUAGE

DDL is used to specify relationships, domains, integrity rules, among others. The command
create, which according to ELMASRI and NAVATHE (2011, p. 58) is the main instruction for the
Definition of data, it is used to create tables, assertions, domains, triggers, and more. The DDL
also includes the alter and drop instructions.

[Link] MANIPULATION LANGUAGE

Once the database is defined, it is possible to operate on it through operations of
manipulation: select, insert, update, and delete (DATE, 2004, p. 73). Select is used to perform
database queries, while insert, update, and delete are applied to the insertion, updating
and data exclusion, respectively.

15
 [Link]
Tables are elements made up of columns and rows, where each column corresponds to a field,
And each line is a record. "A column is defined by its name, by the type of data it can
receive and put a comment. The comment is optional" (SETZER; CORRÊA DA SILVA, 2005,
A table can be created in several ways, including: in Design Mode, using
graphical interface, as shown in figure 15. Item 1 is the name of the table; 2 is where we specify the name.
in the column; in 3 we define the type of data that will be stored; in 4 we optionally put,
a description of the content that the column will store; 5 is where we define the properties of
field, such as: size, default value, required (whether it accepts null values or not), between
others; and 6 indicates that the field is a primary key.

4.4. CONSULTATIONS
A query, for Access, is merely a stored SQL expression for later use
CARVALHO (2006, p. 455). According to SETZER and CORRÊA DA SILVA (2005, p. 229), Access
enables the creation of two types of queries: selection and action. The first type allows for retrieval
database data. The second type implements commands for updating-inserting,
exclusion and change - in the database. Considering these types, the following can be found in Access.
queries:

Selection: is based on the SQL select instruction and is used to select fields and records.
the tables of the database;
Increment: originates from the insert into instruction and is used to add records to the tables;
Exclusion: built from the delete instruction, it is used to delete records from
database tables;
Update: it is based on the update instruction and allows changing the values of the fields in a
table
Create Table: contains the create table instruction and allows the creation of a table in the database
of data.

16
 5. CONCLUSION
The database approach presents advantages when compared to processing
traditional files, among the benefits are independence, integrity, and consistency of
data, as well as redundancy control. A database schema relates to
database structure. Schemas can be described through data models. From
just like application software, a database is developed through design,
given that this includes several stages. The conceptual project deserves to be highlighted, in which one
uses the Entity-Relationship Model to describe data and its semantics; and the project
logical, which is the mapping of the conceptual model to the data model of the DBMS that will be
adopted. Even today, most databases are relational, therefore, it is used in this
conversion of the Relational Model.

17
 6. REFERENCES
SILBERSCHATZ, Abraham; KORTH, Henry F.; SUDARSHAN, S..BANKING SYSTEM
OF DATA. 3rd ed. São Paulo: Makron Books, 1999.

ELMASRI, Ramez; NAVATHE, Shamkant B..DATABASE SYSTEMS. 6th ed. São

Addison Wesley, 2011.

DATE, C. J.. INTRODUCTION TO DATABASE SYSTEMS. 8th ed. Rio de Janeiro:

Elsevier, 2003.

SETZER, Valdemar W.; SILVA, Flávio Soares Corrêa da. DATABASES: LEARN
WHAT ARE, IMPROVE YOUR KNOWLEDGE, BUILD YOURS. São Paulo:
Edgard Blücher, 2005.

INFORMATICS FOR COMPETITIONS

Elsevier, 2006.

18