Midterm 2 Flashcards

1
Q

Define:

conceptual database design

A

Conceptual database design involves modelling the collected information at a high-level of abstraction without using a particular data model of DBMS.

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

Define:

entity-relationship modelling

A

Entity-relationship modelling (ER modelling) is a top-down approach t o database design that models the data as entities, attributes, and relationships.

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

What is the relationship between conceptual database design and ER modelling?

A

The ER model is a type of conceptual database design.

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

What are the three stages of database design?

A

Conceptual
Logical
Physical

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

What happens at the conceptual level of database design?

A

Conceptual database design involves modelling the collected information at a high-level of abstraction without using a particular data model of DBMS.

e.g. UML or ER-modelling

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

What happens at the physical level of database design?

A

Physical database design is the process of selecting a DBMS.

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

What are some factors to consider when selecting a DBMS?

A

Features
Compatibility
Performance
Price

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

What are some factors to consider when selecting a DBMS?

A

Features
Compatibility
Performance
Price

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

What is the degree of a relationship type?

A

The number of entity types participating in the relationship.

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

Define:

entity type

A

An entity type is a group of objects with the same properties which are identified as having an independent existence.

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

Define:

relationship type

A

A relationship type is a set of associations among entity types. Each relationship type has a name that describes its function.

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

Entity names are usually ______ and relationship names are usually ______.

A

Entity names are usually nouns and relationship names are usually verbs.

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

Define:

recursive relationship

A

A recursive relationship is a relationship type where the same entity type participates more than once in different roles.

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

True or False:

It is not possible to have a relationship of degree one.

A

True. The minimum number is two.

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

Define:

attribute

A

An attribute is a property of an entity or a relationship type.

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

Define:

simple attribute

A

An attribute is simple if it contains a single component with an independent existence.
e.g. Social Insurance Number

17
Q

Define:

composite attribute

A

An attribute is called composite if it consists of multiple components, each with an independent existence.
e.g. address can be broken into street, city, etc.

18
Q

Define:

single-valued attribute

A

An attribute is a single-valued attribute if it consists of a single value for each entity instance.
e.g. salary

19
Q

Define:

multi-valued attribute

A

An attribute is multi-valued if it may have multiple values for a single entity instance
e.g. people may have many different phone numbers

20
Q

Define:

derived attributes

A

A derived attribute is one whose value is calculated from other attributes but is not physically stored.

21
Q

Define:

candidate key

A

A candidate key is a minimal set of attributes that can uniquely identify each instance of an entity type.

22
Q

Define:

primary key

A

A primary key is a candidate key that has been selected to identify each instance of an entity type.

23
Q

Define:

composite key

A

A composite key is a key that consists of two or more attributes.

24
Q

What is multiplicity?

A

The multiplicity is the number of possible occurrences of an entity type that may relate to a single occurrence of an associated entity type through a particular relationship.

25
Q

For binary relationships, what are the three common types of multiplicities?

A

one-to-one (1:1)
one-to-many (1:* or 1:N)
many-to-many (: or N:M)

26
Q

For relationships, what are the two participation constraints?

A

Cardinality, which is the maximum number of relationship instances for an entity participating in a relationship type.

Participation, which is the minimum number of relationship instances for an entity participating in a relationship type.

27
Q

What is the difference between strong and weak entity types?

A

A strong entity type is an entity type whose existence is not dependent on another entity type, whereas a weak entity type is dependent upon another entity type.

28
Q

What are the two possible choices for constraints on superclasses and subclasses?

A

Participation constraint

Disjoint constraint

29
Q

What are the two possible choices for the participation constraints, and what do they mean?

A

Mandatory: a superclass member must be a member of one of its subclasses

Optional: a superclass member need not be a member of one of its subclasse.

30
Q

What are the two possible choices for the disjoint constraints, and what do they mean?

A

And: a superclass member may be in more than one of its subclasse

Or: a superclass member may be in only one of its subclasses

31
Q

What are the 8 steps when converting from ER to relational mapping?

A
  1. Strong entities
  2. Weak entities
  3. Relationships - 1:1
  4. Relationships - 1:*
  5. Relationships - :
  6. Multi-valued attributes
  7. N-ary relationship
  8. Subclasses
32
Q

The ER model was proposed by ______ in ______

A

The ER model was proposed by Peter Chen in 1976

33
Q

What happens at the logical level of database design?

A

Logical database design is the process of constructing a model of the information using a particular data model.