Database Management Systems (23CSE202) - Practice Flashcards

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/41

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards for Database Management Systems Unit 1, covering introductory concepts, SQL languages, relational models, keys, and E-R modeling.

Last updated 6:29 PM on 7/28/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

42 Terms

1
New cards

Database Management System (DBMS)

Software that enables users to define, create, maintain, and control access to databases efficiently; it is a collection of interrelated data and a set of programs for accessing and managing that data.

2
New cards

Data

Raw facts and figures that have not been processed, such as the value "101" or the name "Ravi".

3
New cards

Information

Processed data that has meaning, such as the statement "Student 101 is Ravi from the CSE department."

4
New cards

Metadata

Information about the database structure itself, also known as "data about data," which includes tables, fields, data types, and relationships.

5
New cards

Data Abstraction

A technique that simplifies interaction with the database by hiding storage details and showing users only the required information through three levels: Physical, Logical, and View.

6
New cards

Physical Data Independence

The ability to change physical storage structures (e.g., changing from a sequential file to an indexed file) without affecting the logical schema or application programs.

7
New cards

Logical Data Independence

The ability to change the logical schema (e.g., adding a new attribute like "DateOfBirth") without affecting the user views or application programs.

8
New cards

Data Redundancy

A problem in traditional file processing systems where the same data is stored multiple times, leading to wasted storage and potential inconsistencies.

9
New cards

Data Consistency

A state where all users see the same accurate information, ensured by a single copy of data in a DBMS.

10
New cards

Data Definition Language (DDL)

A category of database languages used to define database structures (schemas), including commands such as CREATE, ALTER, DROP, and TRUNCATE.

11
New cards

Data Manipulation Language (DML)

A category of database languages used to manipulate data, including commands such as INSERT, UPDATE, DELETE, and MERGE.

12
New cards

Data Query Language (DQL)

A category of database languages used specifically for retrieving data, represented by the SELECT command.

13
New cards

Data Control Language (DCL)

A category of database languages used for security control, including GRANT (to provide permissions) and REVOKE (to remove permissions).

14
New cards

Transaction Control Language (TCL)

A category of database languages used to manage transactions, including COMMIT (to save changes), ROLLBACK (to undo changes), and SAVEPOINT.

15
New cards

TRUNCATE

A DDL command used to delete all records from a table while keeping the table structure intact.

16
New cards

DROP

A DDL command used to completely remove a table and its structure from the database.

17
New cards

MERGE (UPSERT)

An operation used to insert, update, or delete records in a target table based on matching conditions from a source table.

18
New cards

Relation

The relational database term for a table that contains data organized into rows and columns.

19
New cards

Tuple

The relational database term for a single row in a table.

20
New cards

Attribute

The relational database term for a column in a table representing a property of an entity.

21
New cards

Domain

The set of all possible and valid values that an attribute can take, such as integer values from 00 to 120120 for an "Age" attribute.

22
New cards

Degree

The number of columns (attributes) present in a table.

23
New cards

Cardinality

The number of rows (tuples) present in a table.

24
New cards

Super Key

A set of one or more attributes that can uniquely identify a tuple within a relation.

25
New cards

Candidate Key

A minimal super key that contains only the necessary attributes required to uniquely identify a record.

26
New cards

Primary Key

A candidate key selected to uniquely identify records; it must be unique and cannot be NULL.

27
New cards

Foreign Key

An attribute in one table that refers to the primary key of another table to establish a relationship between them.

28
New cards

Composite Key

A primary or candidate key that consists of more than one attribute (e.g., combining "RollNo" and "CourseID").

29
New cards

Database Schema

The structural blueprint of a database that specifies table names, attributes, data types, and constraints; it rarely changes.

30
New cards

Database Instance

The actual data stored in the database at a specific moment in time, which changes frequently as records are managed.

31
New cards

Entity Integrity Constraint

A rule stating that a primary key cannot contain a NULL value.

32
New cards

Referential Integrity Constraint

A rule stating that foreign key values in a table must exist in the primary key column of the referenced table.

33
New cards

Entity-Relationship (E-R) Model

A high-level conceptual data model used for database design, developed by Peter Chen in 1976, that describes entities, attributes, and relationships.

34
New cards

Weak Entity Set

An entity that cannot be uniquely identified by its own attributes and depends on an identifying relationship with another entity; represented by a double rectangle in E-R diagrams.

35
New cards

Specialization

A top-down design process where a higher-level entity set (superclass) is divided into lower-level entity sets (subclasses) based on distinguishing characteristics.

36
New cards

Generalization

A bottom-up design process where multiple lower-level entity sets with common attributes are combined into a higher-level entity set.

37
New cards

Inheritance

A property of the Extended E-R model where subclasses automatically acquire the attributes and relationships of their superclass.

38
New cards

Aggregation

A feature that treats a relationship set as an entity so that it can participate in further relationships with other entities.

39
New cards

Total Participation

A constraint where every entity in a set must participate in a relationship at least once; represented by a double line in E-R diagrams.

40
New cards

Crow's Foot Notation

A popular industry notation for E-R diagrams where cardinality is shown using symbols (I for one, O for zero, and < for many) and attributes are listed inside the entity rectangle.

41
New cards

Query Optimizer

A component of the query processor that evaluates multiple possible execution plans for a SQL query and chooses the most efficient one.

42
New cards

Buffer Manager

A component of the storage manager responsible for managing data in main memory and transfering data between the memory buffer and physical disk storage.