1/18
Vocabulary flashcards covering the fundamental concepts, core operators, properties, and equivalences of Relational Algebra based on GO Classes lecture notes.
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.
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.
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.
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.
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.
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.
Selection Operator (σ)
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 C.
Projection Operator (π)
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.
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.
Union Compatibility (Type Compatibility)
The condition requiring two relations to have the same degree n and identical corresponding attribute domains (dom(Ai)=dom(Bi) for all 1≤i≤n), which is required to perform union, intersection, and set difference.
Union Operator (∪)
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.
Set Difference Operator (−)
A non-commutative and non-associative binary operator that returns all tuples present in relation R that do not appear in union-compatible relation S.
Set Intersection Operator (∩)
A derived binary set operator for union-compatible relations that returns tuples appearing in both relations, equivalent to R−(R−S).
Cartesian Product Operator (×)
A binary operator (also called cross-product or cross-join) that pairs every tuple in relation R with every tuple in relation S, resulting in a degree of degree(R)+degree(S) and cardinality of ∣R∣×∣S∣.
Rename Operator (ρ)
A unary operator denoted by ρ used to alter the name of a relation, the names of its attributes, or both, often to resolve naming conflicts in binary operations.
Derived Operators
Relational algebra operators—including set intersection (∩), natural join (⋈), condition join (⋈C), and division (÷)—that provide convenient shorthand without adding extra expressive power beyond the core six operators.
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)).
Projection Refinement
The cascading property of projection stating that if attribute list L1 is a subset of attribute list L2 (L1⊆L2), then πL1(πL2(R))=πL1(R).
Commutativity of Selection and Projection
The property stating that πL(σC(R))=σC(πL(R)) is valid if and only if the selection condition C references only attributes that belong to the projection list L.