Mis Exam 1

Front 1

Analytical database

Back 1

AKA Transactional DB. Used to support operations

Front 2

Composite key

Back 2

multiple attribute key

Front 3

data dictionary

Back 3

DBMS component that stores metadate (data about data)

Front 4

dependent

Back 4

attribute whose value is determined by another attribute

Front 5

determinant

Back 5

attribute in a specific row whose value directly determines other values in that row

Front 6

determination

Back 6

The role of a key. A determines B indicates that knowing the value of A means that the value of B can be looked up

Front 7

entity integrity

Back 7

in a relational table, each entity has a unique value in a primary key and that the key has no null values

Front 8

flags

Back 8

special codes that trigger a response, alert to specific conditions, or encode values. Can be used to prevent nulls

Front 9

foreign key

Back 9

attribute or attributes in one table whose values match the primary key in another table

Front 10

homonym

Back 10

use of the same name to label different attributes. Avoid is possible

Front 11

index

Back 11

ordered key values and row ID values. used to speed up data retrieval

Front 12

inner join

Back 12

join function where only rows that meet a criteria are selected. most common used join

Front 13

key attribute

Back 13

attributes that form a primary key

Front 14

left outer join

Back 14

join that yields all rows in the left table, even ones that do not have matching rows

Front 15

linking table

Back 15

table that implements an M:M relationship

Front 16

natural join

Back 16

links tables by selecting only the rows w/ common values

Front 17

null

Back 17

abscence of an attribute. null is not blank

Front 18

outer join

Back 18

JOIN function that retains all unmatched paris.

Front 19

referential integrity

Back 19

a dependent table's FK must have either a null entry or a matching entry in the related table.

Front 20

right outer join

Back 20

join that yields all of the rows in the right table even if they don't have matching rows in the left table

Front 21

relvar

Back 21

short for relational variable. relvar is a container for holding relational data, not the relation itself

Front 22

secondary key

Back 22

key used only for data retrieval purposes

Front 23

superkey

Back 23

attribute(s) that uniquely identify each entity in a table

Front 24

synonym

Back 24

use of different names to identify the same object. avoid

Front 25

system catalog

Back 25

data dictionary that describes all objects in a DB

Front 26

tuple

Back 26

table row

Front 27

union-compatible

Back 27

two or more tables that have the same column names and have columns with compatible data types

Front 28

cardinality

Back 28

property that assigns a specific value to connectivity and expresses the range fo allowed entity occurrences associated witha single occurence of the related entity

Front 29

composite attribute

Back 29

attribute that can be further subdivided

Front 30

derived attribute

Back 30

does not physically exist. found using formulas

Front 31

existence dependent

Back 31

entity whose existence depends on one or more other entities

Front 32

existence indpendent

Back 32

entity that can exist apart from one or more related entities

Front 33

identifying relationship

Back 33

relationship where related entities are dependent. also called strong relationship

Front 34

non-identifying relationship

Back 34

relationship where the pk of the dependent entity does not contain the pk of the related partent entity

Front 35

relationship degree

Back 35

number of entities or participants associated with a relationship (unary, binary, ternary, or tertiary)

Front 36

simple attribute

Back 36

attribute that cannot be subdivided into meaningful components

Front 37

strong entity

Back 37

entity that is existence-independent

Front 38

weak entity

Back 38

entity that is existent dependent and has the same pk as its parent entity

Front 39

design trap

Back 39

when a relationship is improperly identified and therefore is representated in a way that is not consistent with the real world. most common is a fan trap

Front 40

disjoint/non-overlapping subtype

Back 40

a unique and non-overlapping subtype entity set

Front 41

eer diagram (eerd)

Back 41

relationship diagram, provides semantic content and relationships

Front 42

entity subtype

Back 42

subset of an entity supertype. supertype contains the common characteristics and the subtype contains the unique characteristics

Front 43

entity supertype

Back 43

generic entity type that contains the commong characteristics of entity subtypes

Front 44

extended entity relationship model (EERM)

Back 44

result of adding semantic constructs (entity supertypes, subtypes, clustering) to the original relationship model

Front 45

natural key (natural identifier)

Back 45

identifier for real world objects. familiar to end users and forms part of their day-to-day busines vocab

Front 46

overlapping subtype

Back 46

each entity instance fo the supertype can appear in more than one subtype

Front 47

specialization

Back 47

grouping of unique attributes

Front 48

specialization hierarchy

Back 48

hierarchy based on the top-down process of identifying lower-level. grouping by unique characteristics

Front 49

surrogate key

Back 49

system assigned pk, usually numeric and auto-incremented

Front 50

time-variant data

Back 50

data whose values are a function of time.

Front 51

total completeness

Back 51

in a generalization/specialization hierarchy, condition in which every supertype occurence must be a member of at least one subtype