Binary relations, n-ary relations, closures of relations, equivalence relations, partial ordering, application to relational databases.
Sections 9.1-9.6: Relations and their properties, n-ary relations and their applications, representing relations, closures of relations, equivalence relations, partial orderings
Textbook 57 pages
Relations, binary relations and digraphs, classification, operations, applications to relational database theory.
Lecture notes
Functions, representations, closures, equivalence relations and classes, quotient sets.
Order relations, topological sorting
Relational data model, terminology, relational algebra, tuple relational calculus, introduction to SQL
Reflexive, symmetric, antisymmetric, transitive properties (Rosen Section 9.1)
Problems
Solutions
n-ary relations, primary keys, composite keys, selection, projection, join (Rosen Section 9.2)
Matrix representation, directed graphs, digraphs (Rosen Section 9.3)
Reflexive, symmetric, and transitive closures, Warshall’s algorithm (Rosen Section 9.4)
Determining equivalence relations, partitions (Rosen Section 9.5)
Determine partial orderings, posets, lexicographic orderings, Hasse diagrams, lattices (Rosen Section 9.6)