Module 3: The Relational Database Model 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/36

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering key terms, relational algebra operations, integrity rules, and database structural concepts from Chapter 3 of Database Systems (14th Edition).

Last updated 5:28 PM on 9/9/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

37 Terms

1
New cards

Relation

A two-dimensional logical structure composed of rows and columns, also known as a table, whose contents can be permanently saved for future use.

2
New cards

Tuple

A single row in a relational table representing a single entity occurrence within an entity set.

3
New cards

Attribute Domain

The specific range of allowable values for a given column or attribute in a table.

4
New cards

Primary Key (PK)

An attribute or combination of attributes that uniquely identifies any given row in a table.

5
New cards

Functional Dependence

A relationship where the value of one or more attributes uniquely determines the value of one or more other attributes.

6
New cards

Determinant

The attribute or group of attributes whose value determines the value of another attribute in a functional dependence relationship.

7
New cards

Dependent

The attribute whose value is determined by another attribute or group of attributes in a functional dependence relationship.

8
New cards

Full Functional Dependence

A functional dependence in which the entire collection of attributes in the determinant is necessary to determine the dependent attribute.

9
New cards

Composite Key

A key that is composed of more than one attribute.

10
New cards

Superkey

Any key consisting of an attribute or set of attributes that can uniquely identify any row in a table.

11
New cards

Candidate Key

A minimal superkey that contains no subset of attributes that is itself a superkey.

12
New cards

Entity Integrity

The integrity rule requiring that all primary key entries be unique and no part of a primary key be null, ensuring each row has a known, unique identity.

13
New cards

Null

The absence of a data value in a field, which can represent an unknown attribute value, a missing value, or a not-applicable condition.

14
New cards

Foreign Key (FK)

A primary key of one table that has been placed into another table to establish a logical link between them.

15
New cards

Referential Integrity

The condition requiring that a non-null foreign key entry must match an existing primary key value in the related table.

16
New cards

Secondary Key

A key used strictly for data retrieval purposes that does not require a functional dependency.

17
New cards

Relvar

Short for relation variable; a structure holding relation data that consists of a heading (attribute names) and a body (the relation).

18
New cards

SELECT (RESTRICT)

A relational algebra operator used to select a subset of rows from a table based on specified criteria.

19
New cards

PROJECT

A relational algebra operator used to select a subset of columns from a table.

20
New cards

UNION

A relational algebra operator that combines all rows from two union-compatible tables into a single table, dropping duplicate rows.

21
New cards

INTERSECT

A relational algebra operator that yields only the rows common to two union-compatible tables.

22
New cards

DIFFERENCE

A relational algebra operator that yields all rows in one table that are not found in another union-compatible table.

23
New cards

PRODUCT

A relational algebra operator that yields all possible pairs of rows from two tables, also known as the Cartesian product.

24
New cards

Natural JOIN

A relational algebra operator that links tables by selecting only rows with common values in their shared attributes.

25
New cards

Equijoin

A JOIN operation that links tables on the basis of an equality condition comparing specified columns of each table.

26
New cards

Theta Join

A JOIN operation that links tables using an inequality comparison operator.

27
New cards

Inner Join

A JOIN operation that returns only matched records from the tables being joined.

28
New cards

Outer Join

A JOIN operation in which matched pairs are retained and unmatched values from either table are left null.

29
New cards

DIVIDE

A relational algebra operator used to answer questions about one set of data being associated with all values of data in another set of data.

30
New cards

Data Dictionary

A detailed description of all tables in the database created by the user and designer, recording design decisions about table structures.

31
New cards

System Catalog

A detailed system data dictionary that describes all objects within the database.

32
New cards

Homonym

A database design error where the same name is used to label different attributes.

33
New cards

Synonym

A database design error where different names are used to describe the same attribute.

34
New cards

Composite Entity

A table created to resolve a many-to-many (M:N) relationship into two one-to-many (1:M) relationships, containing foreign keys referencing the linked tables.

35
New cards

Index

An orderly arrangement used to logically access rows in a table.

36
New cards

Index Key

The reference point in an index that leads directly to the data location identified by the key.

37
New cards
<p>Components of an Index</p>

Components of an Index

An index structure composed of index keys (such as PAINTER_NUM) and pointers referencing specific rows in a target table.