Databases Flashcards

1
Q

Relational Database

A

A database which recognises the difference between entities by creating different tables for each entity

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

Entity

A

An item of interest of which information is stored

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

Attributes

A

Link tables together and are the charcteristics of the entity

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

Flat File

A

A database structure which has a single file and its attributes.

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

Primary Key

A

A unique identifier for each record in the table

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

Foreign Key

A

A attribute which links two tables together

foreign key will exist in one table as the primary key and act as the foreign key in another

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

Secondary Key

A

Allows databases to be searched quickly

{Order and Search}

(Index)

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

ERM (Entity Relationship Modelling)

A

Relationships between tables are shown in abstracted view

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

Relationships

A

defined by how many records they associate with in each table.

One-to-One
One-to-Many
Many-to-Many

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

Normalisation

A

The process of coming up with the best possible layout for a relational database

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

Normalisation Rules:

A
  1. no redundancy (unnecessary duplicates)
  2. Consistent data throughout linked tables.
  3. Records can be added and removed without issues.
  4. Complex queries (requests) can be carried out.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

First normal Form

A

There must be no attribute that has more than 1 value

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

Second normal Form

A

A database which doesn’t have any partial dependencies and is in First Normal Form.

 This means that no attributes can depend on part of a
composite key (multiple keys in one used to identify rows).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Third normal Form

A

Database is in Second Normal form and contains no non-key dependencies it is in Third Normal Form.

Non-key dependency - the attribute only depends on the value of the primary key and nothing else.

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

Indexing

A

method used to store the position of each record ordered by a certain attribute.
Used to look up and access data quickly.
The primary key is automatically indexed

(but primary key is almost never queried as its forgotten. so secondary keys are used. Secondary keys are indexed to make the table easier and faster to search through on those particular attributes.)

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

Capturing Data

A

data needs to be inputted. there’s lots of ways of doing this and the way you choose to input data depends on the context.

surveys - data is manually entered
checks scanned using - Magnetic Ink Character Recognition (MICR).
multiple choice questions - Optical Mark Recognition (OMR)

17
Q

Selecting and Managing Data

A

selecting correct data is important part of data pre-processing

only selecting data that fits a certain criteria using SQL to sort and manage the data

18
Q

Exchanging Data

A

is the process of transferring collected data

EDI (Electronic Data Interchange) transfers data without human interaction from node to node

19
Q

Referential Integrity

A

process of ensuring consistency.

ensures data isnt removed if it is required elsewhere in a linked table

20
Q

Transaction Processing

A

a single operation executed on data.

21
Q

ACID

A

Atomicity
Consistency
Isolation
Durability

22
Q

Atomicity

A

A transaction must be processed in its entirety or not at all

23
Q

Consistency

A

transaction must maintain the referential integrity rules between linked tables

24
Q

Isolation

A

Simultaneous execution of transactions must lead to the same result as if they were executed one after the other.

25
Q

Durability

A

Once a transaction has been executed it will remain so

even if the power if cut off

26
Q

Record Locking

A

process of preventing simultaneous access of records in a database used to prevent inconsistencies or a loss of updates. can cause deadlocks

DEADLOCK - two or more transactions are waiting for one another to give up locks

(if one person is accessing the data it locks the record so no one else can access the same record )

27
Q

Redundancy

A

process of having one or more copies of the data in physically different locations

so if its lost it can be recovered

28
Q

Composite Key

A

a key that consists of two or more attributes