H446 Section 4 Exchanging Data

studied byStudied by 4 people
5.0(1)
learn
LearnA personalized and smart learning plan
exam
Practice TestTake a test on your terms and definitions
spaced repetition
Spaced RepetitionScientifically backed study method
heart puzzle
Matching GameHow quick can you match all your cards?
flashcards
FlashcardsStudy terms and definitions

1 / 73

74 Terms

1

Compression

The process of reducing the size of data to save storage space or transmission time, often by removing redundancy.

New cards
2

Lossy

Compression that permanently removes some data, resulting in a loss of quality. File types include jpg and mp3.

New cards
3

Lossless

Compression that reduces file size without losing any data or quality. File types include png and flac.

New cards
4

Run Length Encoding

A lossless data compression method that replaces sequences of the same data value with a single value and a count. It is particularly effective for data with many consecutive repeated values.

New cards
5

Dictionary-based compression

A lossless data compression technique that uses a dictionary of previously seen data sequences to replace repeated occurrences with shorter references, improving efficiency.

New cards
6

Encryption

The process of converting data into a coded format to prevent unauthorized access, ensuring confidentiality and security during transmission or storage.

New cards
7

Plaintext

The original, unencrypted data that is readable and understandable before any encryption is applied.

New cards
8

Ciphertext

The result of encryption, ciphertext is the encoded format of plaintext that appears as a random sequence of characters, making it unreadable without the appropriate decryption key.

New cards
9

Caesar cipher

A substitution cipher where each letter in the plaintext is shifted a fixed number of places down the alphabet, commonly used in classical encryption. Also known as a shift cipher.

New cards
10

Substitution cipher

A method of encryption where each letter in the plaintext is replaced with a letter from a fixed system, creating a coded message. This technique can involve shifting letters or replacing them with entirely different characters.

New cards
11

Vernam cipher

A type of one-time pad encryption that uses a random key that is as long as the message, ensuring perfect secrecy when used correctly. Only cipher proven to be unbreakable.

New cards
12

One-time pad

A type of encryption that uses a random key or pad that is as long as the message itself. Each letter from the plaintext is combined with a letter from the pad to create a ciphertext, ensuring perfect secrecy when used correctly.

New cards
13

bitwise exclusive or XOR

A binary operation used in cryptography and computer science that takes two bits and returns true if the bits are different, and false if they are the same. It is often used in encryption algorithms, including the Vernam cipher.

New cards
14

Cryptanalysis

The study of techniques for defeating cryptographic systems, focusing on finding weaknesses in encryption methods to recover the plaintext from ciphertext without the key.

New cards
15

Perfect Security

A theoretical level of security in which the ciphertext provides no information about the plaintext, making it impossible to decrypt without the key.

New cards
16

Symmetric (private key) Encryption

A method of encryption where the same key is used for both encryption and decryption of data, requiring both parties to keep the key secret.

New cards
17

Asymmetric (public key) encryption

A method of encryption that uses a pair of keys: a public key for encryption and a private key for decryption, allowing secure communication without sharing the secret key.

New cards
18

Hashing

A process of converting input data into a fixed-size string of characters, which is typically a hash code, making it irreversible and ensuring data integrity.

New cards
19

Cryptographic hash function

A mathematical algorithm that transforms input data into a fixed-size hash value, ensuring data integrity and security. It is designed to be one-way, meaning it cannot be reversed to retrieve the original input.

New cards
20

checksum or hash total

A value used to verify the integrity of data by detecting errors in transmission or storage. It is calculated from the data and compared to a previously computed checksum to ensure accuracy. Also known as a digest.

New cards
21

Digital Signature

A cryptographic mechanism that validates the authenticity and integrity of a message or document, ensuring that it has not been altered and confirming the identity of the sender.

New cards
22

Digital Certificate

An electronic document used to prove the ownership of a public key, linking it to an entity. It is issued by a trusted certificate authority and contains information about the key, the identity of its owner, and the digital signature of the authority.

New cards
23

Certificate Authorities

Organizations that issue digital certificates, verifying the identity of entities and ensuring secure communication e.g. Symantec or Verisign.

New cards
24

Public Key Infrastructure

A framework that manages digital certificates and public-key encryption, enabling secure data exchange and authentication over networks.

New cards
25

Entity

A category of object, person, event or thing of interest to an organisation about which data is to be recorded.

New cards
26

Attributes

Characteristics or properties that define an entity, providing specific details about it.

New cards
27

Flat file database

A type of database that stores data in a single table or file, where each record is a separate line and fields are typically separated by delimiters.

New cards
28

Relational database

A type of database that stores data in multiple related tables, allowing for complex queries and data relationships through the use of primary and foreign keys.

New cards
29

Identifier

A unique attribute used to distinguish each entity in a database, ensuring that each record can be accurately referenced and retrieved.

New cards
30

Primary Key

A unique identifier for a record in a relational database table, ensuring that each entry can be distinctly accessed and referenced.

New cards
31

Secondary Key

An attribute in a database that is used for data retrieval but does not uniquely identify a record. It allows for sorting and searching within the data.

New cards
32

One-to-One

A type of relationship in a database where a single record in one table is associated with a single record in another table, ensuring a one-to-one correspondence between the two.

New cards
33

One-to-Many

A type of relationship in a database where a single record in one table can be associated with multiple records in another table, allowing for multiple entries related to one entry.

New cards
34

Many-to-Many

A type of relationship in a database where multiple records in one table can be associated with multiple records in another table, enabling complex associations between the two.

New cards
35

Entity Relationship Diagramm

(ERD) is a visual representation of the relationships between entities in a database, used to model data structures and their connections.

New cards
36

Foreign Key

A field in a table that creates a link between two tables by referencing the primary key of another table, establishing a relationship between them.

New cards
37

Linking table

A table used to connect two or more tables in a many-to-many relationship, containing foreign keys that reference the primary keys of the related tables.

New cards
38

Composite Primary Key

A primary key that consists of two or more columns in a table, used to uniquely identify a record when a single column is insufficient.

New cards
39

Referential Integrity

A database concept that ensures relationships between tables remain consistent, preventing actions that would leave orphaned records.

New cards
40

Normalisation

The process of organizing data in a database to reduce redundancy and improve data integrity by dividing large tables into smaller, related tables.

New cards
41

First Normal Form

A property of a relational database table that ensures each column contains atomic values, and each record is unique, eliminating duplicate rows.

New cards
42

Second Normal Form

A database normalization stage where all non-key attributes are fully functionally dependent on the primary key, eliminating partial dependencies.

New cards
43

Third Normal Form

A database design principle where all the attributes in a table are dependent only on the primary key, eliminating transitive dependency.

New cards
44

Data Redundancy

The unnecessary duplication of data within a database, which can lead to inconsistencies and increased storage costs.

New cards
45

Data Integrity

The accuracy and consistency of data within a database, ensuring that it remains reliable and trustworthy throughout its lifecycle.

New cards
46

SQL

A programming language used for managing and querying relational databases, allowing users to perform operations such as data retrieval, insertion, updating, and deletion.

New cards
47

SELECT

A SQL command used to query and retrieve data from a database.

New cards
48

FROM

A SQL clause used to specify the table from which to retrieve data in a query.

New cards
49

WHERE

A clause used in SQL to specify conditions for filtering records in a query, allowing users to retrieve only those rows that meet certain criteria.

New cards
50

ORDER BY

A SQL clause used to sort the result set of a query by one or more columns in ascending or descending order.

New cards
51

JOIN

A SQL operation used to combine rows from two or more tables based on a related column between them, allowing for the retrieval of related data.

New cards
52

CREATE

A SQL statement used to create a new table or database object, defining its structure and attributes.

New cards
53

ALTER TABLE

A SQL statement used to modify an existing table structure, such as adding, deleting, or modifying columns and constraints.

New cards
54

ADD

A command used in SQL to add a new column or constraint to an existing table.

New cards
55

DROP COLUMN

A command used in SQL to remove a column from an existing table, along with its data.

New cards
56

MODIFY COLUMN

A command in SQL used to change the data type or attributes of an existing column in a table.

New cards
57

INSERT INTO

A SQL command used to add new rows of data into a table.

New cards
58

VALUES

A keyword in SQL used to specify the data that will be inserted into a table when using the INSERT INTO command.

New cards
59

UPDATE

A SQL command used to modify existing records in a table by changing one or more columns' values.

New cards
60

SET

A SQL clause used in the UPDATE command to specify the columns that need to be updated and their new values.

New cards
61

DELETE FROM

A SQL command used to remove one or more records from a table based on a specified condition.

New cards
62

MICR

A technology used to read and encode the numbers on checks, typically found at the bottom of a check, to facilitate electronic processing. It stands for Magnetic Ink Character Recognition.

New cards
63

ACID

A set of properties (Atomicity, Consistency, Isolation, Durability) that guarantee reliable processing of database transactions.

New cards
64

Atomicity

A property of database transactions that ensures all operations within a transaction are completed successfully or none at all, maintaining data integrity.

New cards
65

Consistency

The property that ensures a transaction brings the database from one valid state to another, maintaining all predefined rules and constraints.

New cards
66

Isolation

A property that ensures transactions are executed in isolation from one another, preventing concurrent transactions from interfering with each other.

New cards
67

Durability

The property that guarantees that once a transaction has been committed, it will remain so, even in the event of a system failure, ensuring data is never lost.

New cards
68

Record Lock

A mechanism used to prevent multiple transactions from modifying a record simultaneously, ensuring data integrity and consistency during concurrent access.

New cards
69

Deadlock

A situation in which two or more transactions are unable to proceed because each is waiting for the other to release resources, effectively causing a standstill.

New cards
70

Serialisation

The process of ensuring that transactions are executed in a sequential order, maintaining database consistency by preventing concurrent transactions from interfering with each other.

New cards
71

Timestamp Ordering

A concurrency control method that uses timestamps to determine the order of transaction execution, ensuring that transactions are processed in a way that maintains database consistency.

New cards
72

Commitment Ordering

A concurrency control technique that ensures transactions are committed in a specific sequence to maintain database integrity and prevent conflicts.

New cards
73

Redundancy

The inclusion of extra copies of data in a database to ensure reliability and availability, helping to prevent data loss and maintain consistency in case of failures.

New cards
74
New cards
robot