Database Systems: ER Model, Design, Backup, and Distributed Databases

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

1/48

flashcard set

Earn XP

Description and Tags

Comprehensive practice flashcards covering Entity Relationship modeling, database design principles like normalization and anomalies, backup/recovery strategies, and distributed database concepts including fragmentation and replication.

Last updated 11:03 AM on 6/2/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

49 Terms

1
New cards

Entity Relationship Model (ER Model)

A model for identifying entities to be represented in the database and a representation of how those entities are related, specifying the overall logical structure graphically.

2
New cards

Entity

An object, person, place, event, or concept in the real world that can be uniquely identified and stored in a database.

3
New cards

Entity Set

A collection of similar entities that share the same attributes but have different values for those attributes.

4
New cards

Strong Entity

An entity type that has a key attribute and does not depend on another entity in the schema; it is represented by a rectangle.

5
New cards

Weak Entity

An entity type for which key attributes cannot be defined; it is represented by a double rectangle.

6
New cards

Attributes

Properties or characteristics that describe an entity, represented as ovals (ellipses) connected to the entity.

7
New cards

Key Attribute

An attribute which uniquely identifies each entity in the entity set, represented by an oval with underlying lines.

8
New cards

Composite Attribute

An attribute composed of many other attributes, represented by an oval comprising other ovals.

9
New cards

Multivalued Attribute

An attribute consisting of more than one value for a given entity, represented by a double oval (double ellipse).

10
New cards

Derived Attribute

An attribute whose value is calculated or computed from other attributes rather than stored directly; represented by a dashed oval.

11
New cards

Rectangles (ER Notation)

The symbol used to represent Entities in an ER Diagram.

12
New cards

Diamond (ER Notation)

The symbol used to represent Relationships in an ER Diagram.

13
New cards

Enhanced Entity-Relationship (EER) Model

A high-level model that includes all concepts of the ER model plus additional concepts like subclasses, superclasses, categories, and inheritance.

14
New cards

Superclass

A high-level entity (also called a Parent class) that can be further segmented into subclasses or subsets.

15
New cards

Subclass

A low-level entity (also called a child or derived class) that inherits attributes and relationships from its superclass.

16
New cards

Category (Union Type)

A special type of entity formed by combining two or more entity sets that share common characteristics, used when an entity belongs to one or more entity sets.

17
New cards

Attribute and Relationship Inheritance

The mechanism where a subclass automatically acquires the attributes and relationships of its superclass without redefining them.

18
New cards

Minimization of ER Diagram

The process of reducing the quantity of tables in an ER Diagram to increase readability and understandability.

19
New cards

Cardinality

The number of relationships between two entity sets in a relationship model, such as One-to-One, One-to-Many, Many-to-One, or Many-to-Many.

20
New cards

One-to-Many (1:N1:N)

A relationship where one instance in entity set A is associated with multiple instances in entity set B, but each instance in B relates to only one in A.

21
New cards

Database Design

A set of procedures or tasks involving steps taken to implement a database while maintaining data consistency, integrity, and low redundancy.

22
New cards

Redundancy

The duplicity of data within a database; design aims to minimize this to prevent inconsistencies.

23
New cards

Schema

A logical container consisting of rows and columns that defines the structure and manages the organization of stored data.

24
New cards

Indexing

A data structure technique used to promote the efficient retrieval of data stored in a database.

25
New cards

Transaction

A single logical unit of work that signifies changes made to the database and must satisfy ACID or BASE properties.

26
New cards

Normalization

A process in database design that identifies anomalies and redundancy to improve efficiency, consistency, and accuracy.

27
New cards

Insertion Anomalies

Occur when data cannot be inserted into a database because required fields are missing or data is incomplete.

28
New cards

Deletion Anomalies

Occur when deleting a record results in the unintentional loss of other data stored in the database.

29
New cards

Updation (Update) Anomalies

Occur when modifying data results in inconsistencies or errors because related records are not simultaneously updated.

30
New cards

First Normal Form (1NF1NF)

Ensures that each column contains only atomic values that cannot be divided and each record is unique.

31
New cards

Second Normal Form (2NF2NF)

Includes 1NF1NF and removes partial dependencies where a non-key attribute depends on only part of a composite primary key.

32
New cards

Third Normal Form (3NF3NF)

Includes further normalization by removing transitive dependencies, where non-key attributes depend on other non-key attributes.

33
New cards

Database Backup

A copy of data stored in a database at a specific point in time used to restore the database in case of corruption or failure.

34
New cards

Full Backup

A backup type that copies the entire database including all data, schema, and logs.

35
New cards

Incremental Backup

A backup type that saves only the data that has changed since the last backup (full or incremental).

36
New cards

Differential Backup

A backup type that saves data that has changed since the last full backup.

37
New cards

Mirror Backup

Creates an exact copy of the database in real-time.

38
New cards

Database Recovery

The process of restoring a database to a correct state after data corruption, hardware failure, or accidental deletion.

39
New cards

Point-in-Time Recovery (PITR)

A recovery method that restores the database to a specific moment using transaction logs.

40
New cards

Rolling Backward (Undo)

A recovery process that undoes uncommitted or unwanted changes from the database.

41
New cards

Distributed Database System

A database spread over different sites or multiple computers over a network that appears to users as one single database.

42
New cards

Homogeneous Database

A distributed system where all sites use the same operating system, DBMS, and data structures identically.

43
New cards

Heterogeneous Database

A distributed system where different sites may use different schemas, data models, or DBMS software, often requiring middleware for communication.

44
New cards

Replication

A distributed data storage method where the same data is copied and stored on multiple servers to ensure availability.

45
New cards

Fragmentation

A distributed data storage method where data is split into pieces and stored in different locations.

46
New cards

Horizontal Fragmentation

Splitting a relation by rows so that each tuple is assigned to at least one fragment.

47
New cards

Vertical Fragmentation

Splitting a relation schema by columns, ensuring each fragment contains a common candidate key for lossless joins.

48
New cards

COMMIT

A SQL command used to permanently save the changes made during the current transaction.

49
New cards

ROLLBACK

A SQL command used to undo changes made during a transaction if an error occurs, returning data to its previous state.