Intro to Relational Algebra Flashcards
Structured Query Language
SQL: application-level query language, declarative
Relational algebra
used to represent queries internally, intermediate language used within DBMS
RA queries
relations are treated as sets, no dupilcates allowed, result is always a relation
Unary operation
OP [R] => new relation
Binary operation
[R] Op [S] => new relation
Operator precedence
Selection
Projection
Cartesian product
Join
Set operations
Parentheses
Selection (σ)
filter rows based on a condition
Projection (π)
select specific columns, no duplicate attributes
Cartesian product (×)
combine all rows from two relations (E)
Join (⋈)
join relations to form longer tuples (NE). AKA inner join
Theta Join
general condition with any comparison operator
Equijoin
equality condition on one or more specified attributes
Natural Join
equality condition on all common attributes
Outer Join variations
Left outer join [left + middle]
Right outer join [middle + right]
Full outer join [left + middle + right]
Set operations
Union, intersection, difference
SQL temporary tables
allows virtual representation derived from base relations