Introduction to DBMS - Integrity Constraints & Keys (Lecture 1)

0.0(0)
studied byStudied by 0 people
full-widthCall with Kai
GameKnowt Play
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/24

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering core DBMS concepts from Lecture 1 on integrity constraints and keys.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

25 Terms

1
New cards

Database

A collection of related data stored and accessed electronically (e.g., student information).

2
New cards

DBMS

Software used to manage, store, and retrieve data efficiently via an abstract interface.

3
New cards

Flat file system

Simple file-based storage without a DBMS; used for small databases but lacks data independence and efficient querying.

4
New cards

Integrity Constraint

Rules that enforce data correctness and consistency in a database.

5
New cards

Relational DBMS (RDBMS)

A DBMS based on the relational model that uses tables (relations) with rows and columns.

6
New cards

CODD Rule

One of Codd's 12 rules; data is stored in tabular form with unique rows; governs the design of relational DBMS.

7
New cards

Attribute

A named column in a table (e.g., SID, Sname, DOB).

8
New cards

Record (Tuple)

A row in a relation representing a single data item across attributes.

9
New cards

Relational Instance

The current set of rows in a relation; also called a snapshot or record set.

10
New cards

Relational Schema

The structure/heading of a table, i.e., its set of attributes (e.g., STUDENT(Sid, Sname, DOB)).

11
New cards

Arity

The number of attributes (columns) in a relation.

12
New cards

Cardinality

The number of records (rows) in a relation.

13
New cards

Candidate Key

A minimal set of attributes that can uniquely identify each row in a relation.

14
New cards

Simple Candidate Key

A candidate key consisting of a single attribute.

15
New cards

Compound (Composite) Candidate Key

A candidate key consisting of two or more attributes.

16
New cards

Prime Attribute

An attribute that is part of any candidate key.

17
New cards

Primary Key

The candidate key chosen to uniquely identify rows; cannot be NULL; only one per relation.

18
New cards

Alternative Keys

All candidate keys of a relation other than the primary key; may allow NULL values.

19
New cards

Super Key

A set of one or more attributes that can uniquely identify a row; includes candidate keys and supersets.

20
New cards

NULL values in keys

Null values indicate missing data; the primary key cannot be NULL, while some alternative keys may allow NULLs.

21
New cards

Unique Constraint

A constraint ensuring all values in a column (or a column combination) are distinct.

22
New cards

Defining a Table schema (CREATE TABLE)

SQL statement to define a table's structure and constraints (e.g., PRIMARY KEY, UNIQUE, NOT NULL).

23
New cards

STUDENTS table (example)

Example relation STUDENTS with attributes Sid, Sname, DOB used to illustrate keys.

24
New cards

ENROLL relation (example)

Relation with SID, CID, Fee where (SID, CID) forms a candidate key; a single SID or CID cannot identify a row.

25
New cards

Candidate Keys vs Primary Key

Primary Key is the chosen candidate key and is NOT NULL; other candidate keys are Alternative Keys; primary key cannot be NULL.

Explore top flashcards