Sign inSign in
ConceptSystems & CS

Relational algebra

A procedural query language consisting of fundamental operators used to query and manipulate relations.
as Andy Pavlo defines itCarnegie Mellon UniversityThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Relational model2Set theory2Database schemas1Relation1Tuple1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Andy Pavlo

    Carnegie Mellon University · Undergraduate

    • 2:32Modern SQL — Window Functions, CTEs & Bag Semantics
  • Martin Atzmueller

    European Lisp Symposium · Graduate

    A formal system of relational operators working with relations as sets of tuples.
    • 4:16A Brief Perspective on Deep Learning Using Common Lisp

Lectures that assume it

22

The first 12 are shown.

Connections

33

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.