Infoman Reviewer Flashcards

1
Q

Is used extensively in mathematics to provide a framework, can be verified as either true or false

A

Predicate Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

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

A

Set Theory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

relational model has three (3) components

A
  1. A logical data structure represented by relations
  2. A set of integrity rules to enforce that the data is consistent
    and remains consistent over time
  3. A set of operations that defines how data is manipulated
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

is as a two-dimensional structure composed of
rows and columns

A

table (relation)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

represents data about an entity.

A

e row (tuple

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Each table column represents an a

A

attribute,

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Each
column has a specific range of values known as the attribute
.

A

domain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

is an attribute or group of attributes that determines the
values of other attributes. For example, an invoice number identifies
all of the invoice attributes, such as the invoice date and the
customer name

A

key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

is the state in which knowing the value of an
attribute makes it possible to determine the value of another. It is
based on the relationships among the attributes.

A

Determination

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

means that the value of one or more
attributes determines the value of one or more other attributes.

A

Functional dependence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

The attribute whose value determines another is called the

A

determinant or the key.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

The attribute whose value is determined
by the other attribute is called the

A

dependent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

is a key that is composed of more than one
attribute.

A

composite key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

An attribute or combination of attributes that
uniquely identifies any row in the table

A

Superkey

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

A superkey without any unnecessary attributes

A

Candidate Key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

A candidate key selected to uniquely identify all
other attribute values in any given row; cannot
contain null entries

A

Primary Key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

An attribute or combination of attributes in one table
whose values must either match the primary key in
another table or be null.

A

Foreign Key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

An attribute or combination of attributes used strictly
for data retrieval purposes.

A

Secondary Key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Integrity Rules

A

An entity integrity is the condition in which each row in a table has
its own unique identity.
* A referential integrity is the conditional in which every reference to
an entity instance by another entity instance is valid.
* Integrity rules are followed to maintain a good database design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

To avoid nulls, special codes called ______ are used to indicate the
absence of some value.

21
Q

is a set of mathematical principles that form the
basis for manipulating relational table contents.

A

Relational algebra

22
Q

The use of relational algebra operators on existing relations (tables)
produces new relations is called

23
Q

The condition to be evaluated is also known as

24
Q

Retrieves a subset of rows

A

SELECT σ
Syntax σ CONDITION (TABLE)

25
Retrieves a subset of columns π Syntax π COLUMNS (TABLE
PROJECT π Syntax π COLUMNS (TABLE
26
Merges two union-compatible tables into a new table, dropping the duplicate rows
UNION Syntax TABLE1 ∪ TABLE2
27
Retrieves rows that are common to two union-compatible tables
INTERSECT ∩ Syntax TABLE1 ∩ TABLE2
28
Retrieves rows from one table that are not found in another union-compatible table
DIFFERENCE
29
Retrieves possible pairs of rows from two tables (Cartesian Product)
PRODUCT x Syntax TABLE1 x TABLE2
30
Retrieves rows from two tables based on criteria (Ex. Rows with common values in their common attributes)
JOIN ⨝ Syntax TABLE1 ⨝ TABLE2
31
Retrieves values ÷
DIVIDE ÷ Syntax TABLE1 ÷ TABLE2
32
is a data model that describes relationships among entities at the conceptual level with the help of ER diagrams
Entity Relationship Model (ERM)
33
is a diagram that depicts an entity relationship model’s entities, attributes, and relations.
Entity Relationship Diagram (ERD)
34
Each row in the relational table is known as an
entity instance or entity occurrence
35
A collection of similar entities is known as an
entity set
36
describe associations among data.
Relationships
37
Relationships are represented by a diamond connected to the related entities through a relationship line. The relationship name is written inside the diamond.
Chen notation:
38
Entities are connected by lines, and symbols at either end describe the cardinality of the relationship between the entities
Crow's Foot notation:
39
is raw data in its original state. It might contain redundant data, multivalued data, and/or other data anomalies.
unnormalized data
40
is a process that assigns attributes to entities so that data redundancies are reduced or eliminated
Normalization
41
is an undesirable consequence of a data modification
data anomaly
42
* Objectives of normalization:
o Each table/relation represents a single subject. o Each row/column intersection contains only one value and not a group of values. o No data item will be unnecessarily stored in more than one table. o All nonprime attributes (not part of a key) in a table are dependent on the primary key. o Each table has no insertion, update, or deletion anomalies.
43
Each rule in database normalization is called a
normal form
44
There are no repeating groups and the primary key is identified.
First normal form (1NF)
45
1NF and all the columns depend on the table’s primary key. Third normal form
Second normal form (2NF)
46
2NF and there are no non-key attributes determined by another nonkey attribute.
Third normal form (3NF)
47
Every determinant is a candidate key (special case of 3NF)
Boyce-Codd normal form (BCNF)
48
3NF and no independent multivalued dependencies
Fourth normal form (4NF)
49
considered the highest level necessary for most applications.
3NF