Midterms Database Flashcards
(94 cards)
1
Q
Used extensively in mathematics to provide a framework in which an assertion
(statement of fact) can be verified as either true or false
A
predicate logic
2
Q
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
3
Q
is perceived as a two-dimensional structure composed of rows and columns.
A
table
4
Q
related entity occurrences
A
entity set
5
Q
In the relational model, a table row.
A
tuple
6
Q
In data modeling, the construct used to organize and describe an attribute’s set of
possible values.
A
attribute domain
7
Q
_______ are sometimes referred to as records, and _______ are sometimes labeled as
fields. Occasionally, tables are _______
A
rows , columns , labeled files
8
Q
. You can use numeric data to perform meaningful arithmetic procedures.
A
Numeric
9
Q
also known as text data or string data, can contain any
character or symbol not intended for mathematical manipulation.
A
Character
10
Q
attributes contain calendar dates stored in a special format known as the
Julian date format.
A
Date
11
Q
can only have true or false (yes or no) values
A
Logical
12
Q
consists of one or more attributes that determine other attributes.
A
key
13
Q
is the state in which knowing the value of one attribute makes it possible
to determine the value of another.
A
Determination
14
Q
The relationship is called________ which means that the value of one or
more attributes determines the value of one or more other attributes.
A
functional dependence,
15
Q
In the relational model, an identifier composed of one or more attributes that uniquely
identifies a row. Also, a candidate key selected as a unique entity identifier.
A
primary key (PK)
16
Q
One or more attributes that determine other attributes.
A
key
17
Q
The role of a key. In the context of a database table, the statement “A determines B”
indicates that knowing the value of attribute A means that the value of attribute B can be
looked up.
A
determination
18
Q
Within a relation R, an attribute B is functionally dependent on an attribute A if and only
if a given value of attribute A determines exactly one value of attribute B. The
relationship “B is dependent on A” is equivalent to “A determines B” and is written as A
S B.
A
functional dependence
19
Q
Any attribute in a specific row whose value directly determines other values in that row.
See also Boyce-Codd normal form (BCNF).ute in a specific row whose value directly determines other values in that row.
See also Boyce-Codd normal form (BCNF).
A
determinant determinant
20
Q
An attribute whose value is determined by another attribute.
A
dependent
21
Q
An attribute that is a part of a key
A
key attribute
22
Q
A condition in which an attribute is functionally dependent on a composite key but not
on any subset of the key.
A
full functional dependence
23
Q
is a key that is composed of more than one attribute
A
composite key
24
Q
An attribute or attributes that uniquely identify each entity in a table.
A
superkey
25
A minimal superkey; that is, a key that does not contain a subset of attributes that is
itself a superkey.
candidate key
26
The property of a relational table that guarantees each entity has a unique value in a
primary key and that the key has no null values.
entity integrity
27
The absence of an attribute value. Note that a null is not a blank.
null
28
An attribute or attributes in one table whose values must match the primary key in
another table or whose values must be null
foreign key (FK)
29
A condition by which a dependent table’s foreign key must have either a null entry or a
matching entry in the related table.
referential integrity
30
A key used strictly for data retrieval purposes. For example, customers are not likely to
know their customer number (primary key), but the combination of last name, first name,
middle initial, and telephone number will probably match the appropriate table row
secondary key
31
Special codes implemented by designers to trigger a required response, alert end users
to specified conditions, or encode values.
may be used to prevent nulls by
bringing attention to the absence of a value in a table
flags
32
A set of mathematical principles that form the basis for manipulating relational table
contents; the eight main functions are SELECT, PROJECT, JOIN, INTERSECT, UNION,
DIFFERENCE, PRODUCT, and DIVIDE.
relational algebra
33
Short for relation variable, a variable that holds a relation.
is a container
(variable) for holding relation data, not the relation itself.
relvar
34
A property of relational operators that permits the use of relational algebra operators on
existing tables (relations) to produce new relations.
closure
35
In relational algebra, an operator used to select a subset of rows. Also known as
RESTRICT.
SELECT
36
In relational algebra, an operator used to select a subset of columns.
PROJECT
37
In relational algebra, an operator used to merge (append) two tables into a new table,
dropping the duplicate rows. The tables must be union-compatible.
UNION
38
Two or more tables that have the same number of columns and the corresponding
columns have compatible domains
union-compatible
39
In relational algebra, an operator used to yield only the rows that are common to two
union-compatible tables.
INTERSECT
40
In relational algebra, an operator used to yield all rows from one table that are not
found in another union-compatible table.
DIFFERENCE
41
In relational algebra, an operator used to yield all possible pairs of rows from two tables.
Also known as the Cartesian product
PRODUCT
42
In relational algebra, a type of operator used to yield rows from two tables based on
criteria. There are many types of joins, such as natural join, theta join, equijoin, and
outer join.
JOIN ( ⋈ )
43
A relational operation that yields a new table composed of only the rows with common
values in their common attribute(s).
natural join
44
Columns that are used in the criteria of join operations. The join columns generally
share similar values.
join columns
45
A join operator that links tables based on an equality condition that compares specified
columns of the tables.
equijoin
46
A join operator that links tables using an inequality comparison operator (<, >, <=, >=) in
the join condition.
theta join
47
A join operation in which only rows that meet a given criterion are selected. The criterion
can be an equality condition (natural join or equijoin) or an inequality condition (theta
join). The most commonly used type of join.
inner join
48
A join operation that produces a table in which all unmatched pairs are retained;
unmatched values in the related table are left null.
outer join
49
A join operation that yields all the rows in the left table, including those that have no
matching values in the other table.
left outer join
50
A join operation that yields all of the rows in the right table, including the ones with no
matching values in the other table
right outer join
51
In relational algebra, an operator that answers queries about one set of data being
associated with all values of data in another set of data.
DIVIDE
52
A DBMS component that stores metadata—data about data. Thus, the data dictionary
contains the data definition as well as their characteristics and relationships.
may also include data that are external to the DBMS. Also known as an
information resource dictionary.
data dictionary
53
A detailed system data dictionary that describes all objects in a database.
system catalog
54
The use of the same name to label different attributes.
generally should be
avoided.
homonym
55
The use of different names to identify the same object, such as an entity, an attribute, or
should generally be avoided.
synonym
56
_________ is the relational modeling ideal. Therefore, this relationship
type should be the norm in any relational database design.
________ should be rare in any relational database design.
●________ cannot be implemented as such in the relational model
is the norm for relational databases.
_________ - one entity in a 1:1 relationship can be related to only one other entity, and vice versa.
___________ is not supported directly in the relational
environment. However, it can be implemented by creating a new entity
in 1:M relationships with the original entity
● The 1:M relationship
● The1:1relationship
M:Nrelationships
The 1:M Relationship
The 1:1 Relationship
The M:N Relationship
57
An entity designed to transform an M:N relationship into two 1:M relationships. The
composite entity’s primary key comprises at least the primary keys of the entities that it
connects.
Also known as a bridge entity or associative entity.
composite entity
58
In the relational model, a table that implements an M:M relationship.
linking table
59
An ordered array of index key values and row ID values (pointers).
are
generally used to speed up and facilitate data retrieval. Also known as an index key.
index
60
An index in which the index key can have only one associated pointer value (row)
unique index
61
A combination of attributes that uniquely identifies each row in a table.
It may contain redundant attributes
.Superkey
62
A minimal superkey, meaning it doesn't contain any unnecessary attributes.
It is a superkey that cannot be further reduced.
Candidate Key
63
A candidate key selected to uniquely identify each row in a table.
It cannot contain null values.
It is typically chosen for its efficiency and ease of use.
Primary Key
64
An attribute or combination of attributes in one table that references the primary key of another table.
It establishes a relationship between two tables.
It ensures data integrity and consistency.
Foreign Key
65
An attribute or combination of attributes used for efficient data retrieval.
It is not unique, but it can be used to index the table for faster searching.
Secondary Key
66
The possible set of values for a given attribute. required attribute In ER modeling, an
attribute that must have a value. In other words, it cannot be left empty.
domain
67
In ER modeling, an attribute that does not require a value; therefore, it can be left
empty.
optional attribute
68
One or more attributes that uniquely identify each entity instance.
identifier
69
The organization of a relational database as described by the database administrator.
relational schema
70
In ER modeling, a key composed of more than one attribute.
composite identifier
71
An attribute that can be further subdivided to yield additional attributes. For example, a
phone number such as 615-898- 2368 may be divided into an area code (615), an
exchange number (898), and a four-digit code (2368).
composite attribute
72
An attribute that cannot be subdivided into meaningful components. Compare to
composite attribute.
simple attribute
73
An attribute that can have only one value.
single-valued attribute
74
An attribute that can have many values for a single entity occurrence. For example, an
EMP_ DEGREE attribute might store the string “BBA, MBA, PHD” to indicate three
different degrees held.
multivalued attribute
75
An attribute that does not physically exist within the entity and is derived via an
algorithm. For example, the Age attribute might be derived by subtracting the birth date
from the current date.
derived attribute
76
An ER term for entities that participate in a relationship. For example, in the relationship
“PROFESSOR teaches CLASS,” the teaches relationship is based on the participants
PROFESSOR and CLASS.
participants
77
The classification of the relationship between entities. Classifications include 1:1, 1:M,
and M:N.
connectivity
78
A property that assigns a specific value to connectivity and expresses the range of
allowed entity occurrences associated with a single occurrence of the related entity.
cardinality
79
A property of an entity whose existence depends on one or more other entities. In such
an environment, the existence-independent table must be created and loaded first
because the existence-dependent key cannot reference a table that does not yet exist.
existence-dependent
80
A property of an entity that can exist apart from one or more related entities. Such a
table must be created first when referencing an existence-dependent table.
existence-independent
81
An entity that is existence-independent, that is, it can exist apart from all of its related
entities.
strong entity
82
See strong entity
regular entity
83
A relationship in which the primary key of the related entity does not contain a primary
key component of the parent entity.
weak (nonidentifying) relationship
84
A relationship that occurs when two entities are existence-dependent; from a database
design perspective, this relationship exists whenever the primary key of the related
entity contains the primary key of the parent entity
strong (identifying) relationship
85
An entity that displays existence dependence and inherits the primary key of its parent
entity. For example, a DEPENDENT requires the existence of an EMPLOYEE.
weak entity
86
In ER modeling, a condition in which one entity occurrence does not require a
corresponding entity occurrence in a particular relationship.
optional participation
87
A relationship in which one entity occurrence must have a corresponding occurrence in
another entity. For example, an EMPLOYEE works in a DIVISION. (A person cannot be
an employee without being assigned to a company’s division.)
mandatory participation
88
The number of entities or participants associated with a relationship. A relationship
degree can be unary, binary, ternary, or higher.
unary relationship
An ER term used to describe an association within an entity. For example, an
EMPLOYEE might manage another EMPLOYEE.
binary relationship
An ER term for an association (relationship) between two entities. For example,
PROFESSOR teaches CLASS.
ternary relationship
An ER term used to describe an association (relationship) between three entities. For
example, a DOCTOR prescribes a DRUG for a PATIENT.
relationship degree
89
An ER term used to describe an association within an entity. For example, an
EMPLOYEE might manage another EMPLOYEE.
unary relationship
90
An ER term for an association (relationship) between two entities. For example,
PROFESSOR teaches CLASS.
binary relationship
91
An ER term used to describe an association (relationship) between three entities. For
example, a DOCTOR prescribes a DRUG for a PATIENT.
ternary relationship
92
A relationship found within a single entity type. For example, an EMPLOYEE is married
to an EMPLOYEE or a PART is a component of another PART.
recursive relationship
93
A process based on repetition of steps and procedures.
iterative process
94
Acronyms
● DBMS-Database Management System
● RDBMS-relational database management system
● SQL-Structured Query Language
● UML-Unified Modeling Languag
