1.3.1 - Databases Flashcards

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

What does compression do?

A

Compression makes file sizes smaller, meaning more files can be stored in a fixed storage amount and files will be quicker to transfer, upload and download.

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

What is a compression technique?

A

It is an algorithm to reduce the number of binary digits in a file.

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

What is a compression ratio?

A

It is a number which gives an indication of the success of a compression method in reducing file size, calculated by dividing the compressed file size by the original file size.

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

What does compression not change?

A

The fundamental properties of the file, e.g resolution or length of music track.

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

What is lossy compression?

A

It is a term to describe compression techniques resulting in a loss of data - data is permanently removed from the file.

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

What happens when a lossy compressed file is decompressed?

A

The data that was removed is re-created from the data in the file.
It almost certainly won’t be the same as the original data, instead an approximation.

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

Give 2 examples of lossy formats.

A

MP3 and JPEG

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

Which types of data are not suitable for lossy compression?

A

Files containing words or numbers, as their contents need to be exactly the same and not approximated.

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

What is lossless compression?

A

Lossless compression refers to techniques where no data is lost in compression. When the file is decompressed, the contents are identical to the original file.

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

When is lossless compression appropriate?

A

When data cannot be approximated - e.g text files.

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

What is dictionary-based compression?

A

It is a lossless technique relying on finding patterns in data. However, it doesn’t look for repeated runs of characters, as the repetitions don’t need to be adjacent. Instead, a shorter code is substituted for patterns which repeat lots.

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

What is run length encoding?

A

It is a lossless technique relying on finding “runs” of repeated binary patterns and replacing them with a single instance of the pattern and a number specifying how many times the pattern is repeated.

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

When is RLE most useful?

A

RLE will only achieve significant reductions in file size if there are long runs of data.
In the extreme case of there being no repeated patterns, the file size could be double that of the original.

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