Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

database > Midterms Database > Flashcards

Midterms Database Flashcards

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

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

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

A

table

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

related entity occurrences

A

entity set

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

In the relational model, a table row.

A

tuple

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

In data modeling, the construct used to organize and describe an attribute’s set of
possible values.

A

attribute domain

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

_______ are sometimes referred to as records, and _______ are sometimes labeled as
fields. Occasionally, tables are _______

A

rows , columns , labeled files

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

. You can use numeric data to perform meaningful arithmetic procedures.

A

Numeric

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

also known as text data or string data, can contain any
character or symbol not intended for mathematical manipulation.

A

Character

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

attributes contain calendar dates stored in a special format known as the
Julian date format.

A

Date

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

can only have true or false (yes or no) values

A

Logical

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

consists of one or more attributes that determine other attributes.

A

key

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

is the state in which knowing the value of one attribute makes it possible
to determine the value of another.

A

Determination

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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,

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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)

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

One or more attributes that determine other attributes.

A

key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

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

An attribute whose value is determined by another attribute.

A

dependent

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

An attribute that is a part of a key

A

key attribute

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
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
24
Q

An attribute or attributes that uniquely identify each entity in a table.

A

superkey

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

A minimal superkey; that is, a key that does not contain a subset of attributes that is
itself a superkey.

A

candidate key

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

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.

A

entity integrity

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

The absence of an attribute value. Note that a null is not a blank.

A

null

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

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

A

foreign key (FK)

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

A condition by which a dependent table’s foreign key must have either a null entry or a
matching entry in the related table.

A

referential integrity

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

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

A

secondary key

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

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

A

flags

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

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.

A

relational algebra

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

Short for relation variable, a variable that holds a relation.

is a container
(variable) for holding relation data, not the relation itself.

A

relvar

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

A property of relational operators that permits the use of relational algebra operators on
existing tables (relations) to produce new relations.

A

closure

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

In relational algebra, an operator used to select a subset of rows. Also known as
RESTRICT.

A

SELECT

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

In relational algebra, an operator used to select a subset of columns.

A

PROJECT

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

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.

A

UNION

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

Two or more tables that have the same number of columns and the corresponding
columns have compatible domains

A

union-compatible

39
Q

In relational algebra, an operator used to yield only the rows that are common to two
union-compatible tables.

A

INTERSECT

40
Q

In relational algebra, an operator used to yield all rows from one table that are not
found in another union-compatible table.

A

DIFFERENCE

41
Q

In relational algebra, an operator used to yield all possible pairs of rows from two tables.
Also known as the Cartesian product

A

PRODUCT

42
Q

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.

A

JOIN ( ⋈ )

43
Q

A relational operation that yields a new table composed of only the rows with common
values in their common attribute(s).

A

natural join

44
Q

Columns that are used in the criteria of join operations. The join columns generally
share similar values.

A

join columns

45
Q

A join operator that links tables based on an equality condition that compares specified
columns of the tables.

A

equijoin

46
Q

A join operator that links tables using an inequality comparison operator (<, >, <=, >=) in
the join condition.

A

theta join

47
Q

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.

A

inner join

48
Q

A join operation that produces a table in which all unmatched pairs are retained;
unmatched values in the related table are left null.

A

outer join

49
Q

A join operation that yields all the rows in the left table, including those that have no
matching values in the other table.

A

left outer join

50
Q

A join operation that yields all of the rows in the right table, including the ones with no
matching values in the other table

A

right outer join

51
Q

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.

A

DIVIDE

52
Q

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.

A

data dictionary

53
Q

A detailed system data dictionary that describes all objects in a database.

A

system catalog

54
Q

The use of the same name to label different attributes.

generally should be
avoided.

A

homonym

55
Q

The use of different names to identify the same object, such as an entity, an attribute, or

should generally be avoided.

A

synonym

56
Q

_________ 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

A

● The 1:M relationship
● The1:1relationship
M:Nrelationships

The 1:M Relationship
The 1:1 Relationship
The M:N Relationship

57
Q

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.

A

composite entity

58
Q

In the relational model, a table that implements an M:M relationship.

A

linking table

59
Q

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.

A

index

60
Q

An index in which the index key can have only one associated pointer value (row)

A

unique index

61
Q

A combination of attributes that uniquely identifies each row in a table.
It may contain redundant attributes

A

.Superkey

62
Q

A minimal superkey, meaning it doesn’t contain any unnecessary attributes.
It is a superkey that cannot be further reduced.

A

Candidate Key

63
Q

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.

A

Primary Key

64
Q

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.

A

Foreign Key

65
Q

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.

A

Secondary Key

66
Q

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.

A

domain

67
Q

In ER modeling, an attribute that does not require a value; therefore, it can be left
empty.

A

optional attribute

68
Q

One or more attributes that uniquely identify each entity instance.

A

identifier

69
Q

The organization of a relational database as described by the database administrator.

A

relational schema

70
Q

In ER modeling, a key composed of more than one attribute.

A

composite identifier

71
Q

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).

A

composite attribute

72
Q

An attribute that cannot be subdivided into meaningful components. Compare to
composite attribute.

A

simple attribute

73
Q

An attribute that can have only one value.

A

single-valued attribute

74
Q

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.

A

multivalued attribute

75
Q

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.

A

derived attribute

76
Q

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.

A

participants

77
Q

The classification of the relationship between entities. Classifications include 1:1, 1:M,
and M:N.

A

connectivity

78
Q

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.

A

cardinality

79
Q

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.

A

existence-dependent

80
Q

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.

A

existence-independent

81
Q

An entity that is existence-independent, that is, it can exist apart from all of its related
entities.

A

strong entity

82
Q

See strong entity

A

regular entity

83
Q

A relationship in which the primary key of the related entity does not contain a primary
key component of the parent entity.

A

weak (nonidentifying) relationship

84
Q

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

A

strong (identifying) relationship

85
Q

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.

A

weak entity

86
Q

In ER modeling, a condition in which one entity occurrence does not require a
corresponding entity occurrence in a particular relationship.

A

optional participation

87
Q

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.)

A

mandatory participation

88
Q

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.

A

relationship degree

89
Q

An ER term used to describe an association within an entity. For example, an
EMPLOYEE might manage another EMPLOYEE.

A

unary relationship

90
Q

An ER term for an association (relationship) between two entities. For example,
PROFESSOR teaches CLASS.

A

binary relationship

91
Q

An ER term used to describe an association (relationship) between three entities. For
example, a DOCTOR prescribes a DRUG for a PATIENT.

A

ternary relationship

92
Q

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.

A

recursive relationship

93
Q

A process based on repetition of steps and procedures.

A

iterative process

94
Q

Acronyms
● DBMS-Database Management System
● RDBMS-relational database management system
● SQL-Structured Query Language
● UML-Unified Modeling Languag

A

database (5 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions