Relational operators

Recall that relations are sets of tuples wherein every tuple has the same attribute names.

@> /set planet = {    |name,      year,   symbol|    ("Mercury", 87.97,  "☿"   ),    ("Venus",   224.70, "♀"   ),    ("Earth",   365.26, "♁"   ),}

A number of operators is defined specifically to work with relations.

Join

If R is a relation with attributes x and y, and S is a relation with attributes y and z:

@> /set R = {|x,y| (1, 2), (1, 4), (4, 3)}@> /set S = {|y,z| (4, 5), (4, 1), (3, 3)}@> R <&> S

Formally, R <&> S is defined as the set of all (:x, :y, :z) such that (:x, :y) <: R and (:y, :z) <: S (<: means "is a member of").

Join variants

The join operator, <&> is the basis for a family of related operators. Each operator performs the same underlying operation of finding pairs of tuples whose matching attributes are equal. They differ only in which attributes appear in the output relation.

Assuming A is a relation with attributes x and y, and B is a relation with attributes y and z:

operator	returns	description
A <&> B	x, y, z	Join
A <-> B	x, z	Compose
A -&- B	y	Intersection of common attributes
A --- B	—	true iff join isn't empty
A -&> B	y, z	All tuples from B with matching tuples in A
A <&- B	x, y	All tuples from A with matching tuples in B
A --> B	z	All tuples from B with matching tuples in A, excluding common attributes.
A <-- B	x	All tuples from A with matching tuples in B, excluding common attributes.

Notes on mathematical intepretation:

1. Formally, these other operators are simply projections of A <&> B over different subsets of the attribute set |x, y, z|.
2. The <-> operator is a symmetric counterpart to function composition: (A ∘ B)(x) = B(A(x)).
3. The last two operators can be thought of as the domain and codomain of A <-> B. Because relational composition is symmetric, it is an arbitrary choice as to which operator represents the domain and which one the codomain.
4. The -&- operator returns the intersection of A's codomain and B's domain (or vice versa, given the symmetry of composition). It can be thought of as the inner domain of A <-> B.

The syntax follows a consistent pattern. The base operator is <&>, which returns all attributes. Each variant excludes attributes from the result based on which characters from the base operator have been replaced with -:

• If < is replaced, all attributes unique to the left argument are omitted.
• If & is replaced, all attributes common to both arguments are omitted.
• If > is replaced, all attributes unique to the right argument are omitted.

@> /set R = {|x,y| (1, 2), (1, 4), (4, 3)}@> /set S = {|y,z| (4, 5), (4, 1), (3, 3)}@> R <-> S@> R -&- S@> R --- S@> R -&> S@> R <&- S@> R --> S@> R <-- S

The join family don't just operate on ternary relations. The attributes x, y and z in the above discussion actually exemplify sets of attributes, as follows:

1. x represents the attributes unique to the left hand side argument.
2. y represents the attributes in common between both arguments.
3. z represents the attributes unique to the right hand side argument.

@> /set A = {|a,b,j,k| (1, 2, 3, 4), (7, 8, 9, 10)}@> /set B = {|j,k,s,t| (9, 10, 20, 21), (15, 16, 23, 24)}@> A <&> B@> A <-> B

It's also important to understand that, as representives of attribute sets, any one or more of x, y and z may be empty. That is there might be no attributes unique to A, or none common to both, or none unique to B, or any combination of these states.

@> {|a| (2)} <&> {|a,b| (1, 1), (2, 4), (3, 8)}  # No attributes unique to A@> {|a| (1), (2), (3)} <&> {|a| (2), (3), (4)}   # No attributes unique to either@> {|a| (1), (2)} <&> {|b| (4), (5)}             # No attributes common to A and B

The definition of <&> given earlier holds true regardless of what x, y and z represent.

Rank

The rank operator computes the position of each tuple in a relation by a ranking value and adds its position as a new attribute. This is similar to orderby, except that, instead of returning an array in the order given, the rank operator returns the ordering information as an attribute in the result.

@> planet rank (r: .name)@> planet rank (r: .year)

You can even compute and hold multiple ranks in one go, which is one significant advantage of ranking over ordering.

@> planet rank (alphabetical: .name, speed: 1/.year)

If several tuples have the same ranking value, they will have the same rank.

@> {|x,y| (1, 0), (1, 1), (2, 1), (3, 1)} rank (r: .x)

Note that the rank skips from 0 to 2. This is because the rank of a tuple is defined as the number of tuples that have a lower ranking value than the given tuple.