CS401A's Midterms: Info Management Module 03 Flashcards
For midterms exams.
Fundamentals
introduced by E. F. Codd in 1970,
- The relational model,
Fundamentals
is based on predicate logic and set theory.
- The relational model,
relational model
is used extensively in mathematics to provide a framework in which an assertion can be verified as either true or false.
(statement of fact)
○ Predicate logic
Example: A student with a student ID of 324452 is named Mark Reyes.
relational model
is a part of mathematical science that deals with sets, or groups of things, and is used as the basis for data manipulation in the relational model.
○ Set theory
Example: Set A contains 15, 23, and 52 while Set B contains 41, 52, 70, 12. It can be concluded that the A and B share a common value, 52.
relational model
- The relational model has three (3) components:
- A logical data structure represented by relations
- A set of integrity rules to enforce that the data is consistent and remains consistent over time
- A set of operations that defines how data is manipulated
relational model
is as a two-dimensional structure composed of rows and columns.
- A table (relation)
relational model
represents data about an entity.
- Each table row (tuple)
relational model
- Each table column represents
an attribute,
and each column has a distinct name.
relational model
- Each represents a single data value.
intersection of a row and column
relational model
Each column has a specific range of values known as
the attribute domain.
TRUE || FALSE
The order of the rows and columns is important in a DBMS.
FALSE
is an attribute or group of attributes that determines the values of other attributes.
A key
For example, an invoice number identifies all of the invoice attributes, such as the invoice date and the customer name.
Keys
is the state in which knowing the value of an attribute makes it possible to determine the value of another.
Determination
Keys
It is based on the relationships among the attributes.
- Determination
Keys
means that the value of one or more attributes determines the value of one or more other attributes.
Functional dependence
Keys
The attribute whose value determines another is called
the determinant or the key.
Keys
The attribute whose value is determined by the other attribute is called the
dependent.
- Data can be manipulated to generate useful information.
Relational Algebra
is a set of mathematical principles that form the basis for manipulating relational table contents.
- Relational algebra
- The use of relational algebra operators on existing relations (tables) produces new relations is called
closure.
- The condition to be evaluated is also known as
predicate.
- The eight (8) fundamental relational operators are:
SELECT
PROJECT
UNION
INTERSECT
DIFFERENCE
PRODUCT
JOIN
DIVIDE
Retrieves a subset of rows
SELECT
Symbol
σ
SELECT
Operator
Retrieves a subset of columns
PROJECT
Symbol
π
PROJECT
Merges two union-compatible tables into a new table, dropping the duplicate rows
UNION
Symbol
∪
UNION
Retrieves rows that are common to two union-compatible tables
INTERSECT
Symbol
∩
INTERSECT
Retrieves rows from one table that are not found in another union-compatible table
DIFFERENCE
Symbol
-
DIFFERENCE
Retrieves possible pairs of rows from two tables
PRODUCT
(Cartesian Product)
Symbol
x
PRODUCT
Retrieves rows from two tables based on criteria
(Ex. Rows with common values in their common attributes)
JOIN
Symbol
⋈
JOIN
Retrieves values
DIVIDE
Symbol
÷
DIVIDE