Relational Algebra Complete Summary

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

1/18

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering the fundamental concepts, core operators, properties, and equivalences of Relational Algebra based on GO Classes lecture notes.

19 Terms

1
New cards

Relational Algebra

A theoretical, mathematical, and procedural query language for the relational data model whose operations take relation instances as input and return a new relation instance as output.

2
New cards

Procedural Query Language

A query language where the user specifies the exact step-by-step procedure and specific operators to execute in order to compute the desired result.

3
New cards

Declarative Query Language

A query language (such as SQL) where the user specifies what data is required without specifying the operational steps or how the system should retrieve it.

4
New cards

Relation Schema

The logical description and metadata of data specified at setup time, consisting of the relation name, field names, and the data type or domain of each field.

5
New cards

Relation Instance

The actual data content of a relation at a specific moment in time, formed by a set of distinct tuples that conforms to the schema.

6
New cards

Atomic Value

A non-decomposable attribute value in the relational data model, such as a string, integer, or character, which cannot be a composite structure like a set, list, or array.

7
New cards

Selection Operator (σ\sigma)

A unary relational algebra operator that acts as a horizontal partition of a relation by filtering and returning only the tuples that satisfy a given boolean condition CC.

8
New cards

Projection Operator (π\pi)

A unary relational algebra operator that acts as a vertical partition of a relation by selecting specified columns, discarding the rest, and eliminating duplicate tuples.

9
New cards

Duplicate Elimination

The process inherent to relational algebra projection and union operations where duplicate rows are eliminated from the result because relations are defined strictly as mathematical sets.

10
New cards

Union Compatibility (Type Compatibility)

The condition requiring two relations to have the same degree nn and identical corresponding attribute domains (dom(Ai)=dom(Bi)\text{dom}(A_i) = \text{dom}(B_i) for all 1≤i≤n1 \le i \le n), which is required to perform union, intersection, and set difference.

11
New cards

Union Operator (∪\cup)

A commutative and associative binary set operator that combines all distinct tuples from two union-compatible relations, eliminating duplicates and adopting the schema of the left-hand relation.

12
New cards

Set Difference Operator (−-)

A non-commutative and non-associative binary operator that returns all tuples present in relation RR that do not appear in union-compatible relation SS.

13
New cards

Set Intersection Operator (∩\cap)

A derived binary set operator for union-compatible relations that returns tuples appearing in both relations, equivalent to R−(R−S)R - (R - S).

14
New cards

Cartesian Product Operator (×\times)

A binary operator (also called cross-product or cross-join) that pairs every tuple in relation RR with every tuple in relation SS, resulting in a degree of degree(R)+degree(S)\text{degree}(R) + \text{degree}(S) and cardinality of ∣R∣×∣S∣|R| \times |S|.

15
New cards

Rename Operator (ρ\rho)

A unary operator denoted by ρ\rho used to alter the name of a relation, the names of its attributes, or both, often to resolve naming conflicts in binary operations.

16
New cards

Derived Operators

Relational algebra operators—including set intersection (∩\cap), natural join (⋈\bowtie), condition join (⋈C\bowtie_C), and division (÷\div)—that provide convenient shorthand without adding extra expressive power beyond the core six operators.

17
New cards

Selection Splitting (Cascading of Selection)

The property stating that a conjunction of conditions in a selection can be evaluated as a cascade of individual selections: σC1∧C2(R)=σC1(σC2(R))\sigma_{C_1 \land C_2}(R) = \sigma_{C_1}(\sigma_{C_2}(R)).

18
New cards

Projection Refinement

The cascading property of projection stating that if attribute list L1L_1 is a subset of attribute list L2L_2 (L1⊆L2L_1 \subseteq L_2), then πL1(πL2(R))=πL1(R)\pi_{L_1}(\pi_{L_2}(R)) = \pi_{L_1}(R).

19
New cards

Commutativity of Selection and Projection

The property stating that πL(σC(R))=σC(πL(R))\pi_L(\sigma_C(R)) = \sigma_C(\pi_L(R)) is valid if and only if the selection condition CC references only attributes that belong to the projection list LL.