normalisation Flashcards

1
Q

relational database

A

consists of many tables w many records w many fields where field stores single data item
relation/entity- table
row/entity instance - record
attribute/column/property - field
primary key underlined

managed by database management systems (dbms)

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

primary key fiels

A

uniquely identifies each record on table
no data value in primary key field is repeated
can be made by adding extra auto-numbered field so each record is made unique
naming convention- tablenameID

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

super keys

A

combination of fields in table which uniquely identify each row

more than 1 field

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

candidate keys

A

minimal super keys w no attributes included which do not contribute to uniqueness of rows

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

composite/compound/concatenated keys

A

combo of 2 or more fields to form primary key

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

normalisation

A

the process of organizing data in a database by creating tables and establishing relationships between those tables according to a defined set of rules designed both to protect the data and to make the database more flexible by eliminating redundancy and inconsistent dependency.
avoids repeating groups, data redundancy, anomalies (update,insertion,deletion)
complex queries

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

repeating group

A

field that can have multiple values
when repeating groups are removed, data redundancy is produced
in normalised database - all fields should have single value

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

anomalies

A

update anomaly- same data needs to be updated in more than one place
deletion anomaly- deletion causes unnecessary data loss
insertion anomaly- records are added that do not satisfy primary key requirements

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

dependancies

A

1 field related to another
A ➔ B
B is determined by A

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

partial dependancy

A

field’s value is dependent on part of a composite key

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

transitive dependency

A

field’s value is dependent on non-key field

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

derived data

A

use a field to calculate another
not stored

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

duplicate data

A

record has same value for a field as another record
not wrong; not redundant

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

atomic data

A

only storing single data item in single field

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

referential integrity

A

you cannot have data that refers to other data that does not exits

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

relationships

A

one to one (1:1): only 1 field matches 1 field, simple,both fields put in same table
1-1

one to many (1:n) 1 has many (1 class has many students)
1- ♾️

many to many (m:n)
♾️-♾️