MOD 2: Understanding and Using the Data

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/61

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:40 PM on 7/12/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

62 Terms

1
New cards

DBMS (Database Management System)

: Software that serves as an interface between the database and its end-users or programs, allowing users to retrieve, update, and manage how information is organized and optimized.

2
New cards

Data Independence

: The property of a DBMS that allows you to change the database schema at one level without forcing a change at other levels.

3
New cards

Logical Data Independence and Physical Data Independence

Data Independence is split into

4
New cards

Logical Data Independence

changing the conceptual schema without altering user views

5
New cards

Physical Data Independence

changing physical storage structures without altering conceptual schemas

6
New cards

Three-Level Schema Architecture

: An ANSI-SPARC standard framework that separates a database into three levels to achieve data independence:

7
New cards
  • External Schema

  • Conceptual Schema

  • Internal Schema

Three-Level Schema Architecture

8
New cards

External Schema (User View)

: What individual end-users see.

9
New cards

Conceptual Schema (Community View)

: The global logical structure of the entire database (tables, relationships, constraints).

10
New cards

Internal Schema (Physical View)

: How the data is physically stored on disks and hardware.

11
New cards

Data Modeling

: The process of creating a visual layout of an enterprise's data requirements, mapping out real-world entities, their attributes, and how they relate to one another.

12
New cards

E-R Diagram (Entity-Relationship Diagram)

: A graphical representation of a database's logical structure using specific shapes: Rectangles for Entities (objects/concepts), Ellipses for Attributes (properties), and Diamonds for Relationships.

13
New cards

Normalization

: A multi-step optimization process used to minimize data redundancy and eliminate update, insertion, and deletion anomalies by systematically decomposing large, messy tables into smaller, well-structured ones.

14
New cards

Normal Forms (1NF, 2NF, 3NF, BCNF)

The progressive stages of normalization:

15
New cards

1NF (First Normal Form)

: All attributes must contain atomic (indivisible) values. No repeating groups.

16
New cards

2NF (Second Normal Form)

: Must be in 1NF, and all non-key attributes must be fully functionally dependent on the primary key (eliminates partial dependencies).

17
New cards

3NF (Third Normal Form)

: Must be in 2NF, and no non-key attribute can be dependent on another non-key attribute (eliminates transitive dependencies).

18
New cards

Integrity Constraints

: Rules enforced by a DBMS to prevent accidental damage to the database and ensure data accuracy. Crucial types include:

19
New cards

Entity Integrity

: The primary key cannot be null and must be completely unique.

20
New cards

Referential Integrity

: A foreign key value must match an existing primary key value in the related table, or be completely null.

21
New cards

ACID Properties

: The four foundational criteria that guarantee database transactions are processed reliably:

22
New cards
  • Atomicity

  • Consistency

  • Isolation

  • Durability

ACID Properties:

23
New cards

Atomicity

: "All or nothing." If any part of a transaction fails, the entire transaction is rolled back.

24
New cards

Consistency

: A transaction must transform the database from one valid, constraint-compliant state to another.

25
New cards

Isolation

: Concurrent execution of transactions must leave the database in the same state as if they were run sequentially.

26
New cards

Durability

: Once a transaction commits, its changes survive even in the event of a total system crash.

27
New cards

Concurrency Control

: A database mechanism used to coordinate simultaneous transaction executions without letting them overwrite or corrupt one another (common techniques include Two-Phase Locking (2PL)).

28
New cards

Index

: A performance-tuning database structure (often shaped as a B-Tree or Hash index) that speeds up data retrieval operations on a table at the cost of additional write time and storage space.

29
New cards

Query Optimizer

: An internal component of a DBMS that analyzes an incoming SQL query and evaluates multiple execution paths to choose the most efficient physical plan (minimizing disk I/O and processing cost).

30
New cards

Data Warehouse (DW)

: A centralized, non-volatile, time-variant repository of integrated data collected from multiple operational systems, specifically optimized for query analysis and business intelligence reporting.

31
New cards

ETL (Extract, Transform, Load)

: The three-stage data integration process used to pull raw data from various sources, clean and format it to meet business rules, and load it securely into a target Data Warehouse.

32
New cards

NoSQL

: A broad class of database management systems designed to handle unstructured or semi-structured data at a massive scale, trading traditional ACID guarantees for horizontal scalability. Common types include Key-Value stores, Document stores, Column-family stores, and Graph databases.

33
New cards

Big Data (The 3 Vs)

: A term describing datasets so massive and complex that traditional database software cannot process them.

34
New cards
  • Volume

  • Velocity

  • Variety

Big Data (The 3 Vs):

35
New cards

Volume

sheer scale of data

36
New cards

Velocity

the rapid speed at which data is created

37
New cards

Variety

the diverse structural formats of the incoming data.

38
New cards

Relational Algebra Operations

: The underlying mathematical operations behind SQL queries.

  • Selection (σ)

  • Projection (π)

  • Join (⋈)

39
New cards

Selection (σ)

: Extracts specific rows based on a condition.

40
New cards

Projection (π)

: Extracts specific columns.

41
New cards

Join (⋈)

: Combines related tables based on common attributes.

42
New cards

DDL vs. DML vs. DCL:

The categories of SQL statements:

43
New cards

DDL (Data Definition Language)

: Changes database structure (CREATE, ALTER, DROP).

44
New cards

DML (Data Manipulation Language)

: Handles data instances (SELECT, INSERT, UPDATE, DELETE).

45
New cards

DCL (Data Control Language)

: Manages privileges (GRANT, REVOKE).

46
New cards

Stored Procedure

: A collection of pre-compiled SQL statements stored directly inside the database engine that can be executed as a reusable function to reduce network traffic.

47
New cards

Trigger

: A specialized stored procedure that automatically fires or executes in response to a specific event (such as INSERT, UPDATE, or DELETE) on a specific table.

48
New cards

Modification Anomalies

: Redundancy problems that occur in un-normalized databases:

  • Insertion Anomaly

  • Deletion Anomaly

  • Update Anomaly

49
New cards

Insertion Anomaly

: Being unable to add a new record because some unrelated, required data is missing.

50
New cards

Deletion Anomaly

: Accidental loss of critical data when a completely different record is deleted.

51
New cards

Update Anomaly

: Having to update the exact same value in dozens of rows, risking inconsistent data if one row is missed.

52
New cards

Functional Dependency

: A constraint between two attributes where the value of attribute A uniquely and completely determines the value of attribute B (written as A→B).

53
New cards

Database Log File (WAL - Write-Ahead Logging)

: A recovery mechanism where any modification to a database is written to a dedicated, sequential log file on disk before it is applied to the actual database pages.

54
New cards

Checkpoint

: A recovery point created periodically by the DBMS. During system crashes, the system only needs to undo or redo log actions that occurred after the most recent checkpoint, drastically reducing system recovery time.

55
New cards

Distributed Database Transparency

: The degree to which a distributed system hides its physical distribution from users. Important types include Location Transparency (users don't need to know where data is physically hosted) and Replication Transparency (users don't need to know if data has copies on separate servers).

56
New cards

CAP Theorem

: A distributed systems rule stating that a distributed data store can simultaneously provide at most two out of three guarantees:

57
New cards
  • Consistency

  • Availability

  • Partition Tolerance

CAP Theorem meaning?

58
New cards

Consistency

all nodes see the same data

59
New cards

Availability

every request receives a response

60
New cards

Partition Tolerance

(the system operates despite network dropouts

61
New cards

Data Lake

: A massive storage repository that holds vast amounts of raw, unstructured, semi-structured, and structured data in its native, unformatted state until it is needed for analysis.

62
New cards

Data Mart

: A highly focused, smaller segment of a Data Warehouse dedicated to an isolated business unit or department (e.g., a specific Data Mart just for the Finance or Marketing team).