Section 4 Flashcards

1
Q

An entity-relationship model

A

Is a high-level representation of data requirements, ignoring implementation details

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

An entity

A

is a person, place, product, concept, or activity

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

A relationship

A

Is a statement about two entitities

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

An attribute

A

is a descriptive property of an entity

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

A reflexive relationship

A

Relates an entity to itself

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

An entity-relationship diagram

A

Commonly called an ER diagram, is a schematic picture of entities, relationships, and attributes.

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

In entity-relationship modeling, a type is a set:

A

-An entity type is a set of things
-A relationship type is a set of related things
-An attribute type is a set of values

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

an instance is an element of a set

A

-An entity instance is an individual thing
-A relationship instance is a statement about entity instances
-An attribute instance is an individual value

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

Complex databases are developed in three phases:

A

Analysis
Logical Design
Physical Design

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

Analysis

A

Develops an entity-relationship model, capturing data requirements while ignoring implementation details

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

Logical design

A

Converts the entity-relationship model into tables, columns, and keys for a particular database system

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

Physical design

A

Adds indexes and specifies how tables are organized on storage media

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

Analysis steps

A
  1. Discover entities, relationships, and attributes
  2. Determine Cardinality
  3. Distinguish strong and weak entities
  4. Create supertype and subtype entities
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Logical design steps

A
  1. Implement entities
  2. Implement relationships
  3. Implement attributes
  4. Apply normal form
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Cardinality

A

Refers to maxima and minima of relationships and attributes

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

Relationship maximum

A

Is the greatest number of instances of one entity that can relate to a single instance of another entity

17
Q

Relationship minimum

A

Is the least number of instances of one entity that can relate to a single instance of another entity

18
Q

A subtype entity, Supertype entity

A

A —— is a subset of another entity type, called the —–

19
Q

A partition

A

A —- of a supertype entity is a group of mutually exclusive subtype entities

20
Q

Logical design follows analysis

A

Logical design converts an entity-relationship model to tables, columns, and keys for a specific database system.

21
Q

Crow’s foot notation

A

Depicts cardinality as a circle (zero), a short line (one), or three short lines (many).

22
Q

An intangible entity

A

Is documented in the data model, but not tracked with data in the database

23
Q

What should primary keys be?

A

Simple. —– values should be easy to type and store. Small values are easy to specify in a SQL clause and speed up query processing.

24
Q

An artificial key

A

Is a single-column primary key created by the database designer when no suitable single-column or composite primary key exists. Usually, —– values are integers, generated automatically by the database as new rows are inserted to the table.
They are stable, simple, and meaningless.

25
Q

What is the dependence of one column on another called?

A

Functional Dependence

26
Q

Redundancy

A

Is the repetition of related values in a table

27
Q

Natural forms

A

Are rules for designing tables with less redundancy

28
Q

Normalization

A

Eliminates redundancy by decomposing a table into two or more tables

29
Q

What is ideal for tables with frequent inserts, updates and deletes?

A

Boyce-Codd normal form

30
Q

Denormalization

A

Means intentionally introducing redundancy by merging tables