1.3.2 Databases Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

relational database

A

based on linked tables to avoid data duplication, inconsistency, redundancy and improving data integrity and security

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

Flat file database

A

database that consists of a single file

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

cons of flat file databases

A

it can be very inefficient due to data redundancy, it is difficult to query and takes up unnecessary space

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

primary key

A

a unique identifier for each record in the table, each row of the primary key must be different

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

foreign key

A

it is the attribute that links two tables together, it exists in one table as the primary key and acts as a foreign key in another

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

secondary key

A

allows a database to be searched quickly, but typically does not uniquely identify a record with complete accuracy. For if you want to find a student in a database you would probably search for their name so the secondary key/index would be the NAME field

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

ACID

A

Atomicity, Consistency, Isolation and Durability

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

Atomicity

A

A transaction should either be completely transformed or not at all. A half completed change must not be saved back to the database

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

Consistency

A

each transaction must obey the defined validation rules of the database, to maintain referential integrity

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

isolation

A

A transaction must not be interrupted by another transaction. The transaction must occur in isolation so other user or processes cannot access the data concerned

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

Durability

A

once a transaction has begun, it must be completed under all circumstances

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

referential integrity

A

the idea of keeping a database consistent by ensuring that changes made to data with a table are accounted for in all linked tables

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

Normalisation

A

The formal process of optimally designing data tables by reducing redundancy and repetition by converting them into normal forms

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

First normal form (1NF)

A
  1. All fields must be unique/different
  2. values in fields must be the same domain/data type
  3. Values in fields should be atomic ( contains one value )
  4. No two records should be identical
  5. each table needs a primary key
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

composite key

A

Two or more primary keys used in a table that can uniquely identify each record

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

Second normal form (2NF)

A
  1. The data is already in 1NF

2. Any partial dependencies(one or more fields depend on only part of the primary key ) have been removed

17
Q

Third normal form (3NF)

A
  1. The data is in 2NF

2. Remove any non-key dependency

18
Q

Record locking

A

A technique used to prevent simultaneous access to data in a database