Everything About ___
Live briefing

Everything about Relation (database)

Set of tuples consisting of values indexed by attributes

In database theory, a relation, as originally defined by E. F. Codd, is a set of tuples (d1,d2,...,dn), where each element dj is a member of Dj, a data domain. Codd's original definition notwithstanding, and contrary to the usual definition in mathematics, there is no ordering to the elements of the tuples of a relation. Instead, each element is termed an attribute value. An attribute is a name paired with a domain. An attribute value is an attribute name paired with an element of that attribute's domain, and a tuple is a set of attribute values in which no two distinct elements have the same name. Thus, in some accounts, a tuple is described as a function, mapping names to values. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Relation (database)A 5-minute orientation
  2. Skim a recent paper: A database approach to examine the relation between function and interventions in the adaptive reuse of industrial heritageInfluential work since 2022
  3. Pick up a classic book: Mémoires d'une jeune fille rangéeThe most-reprinted book on the subject
  4. Read the landmark paper: A database of vertebrate longevity records and their relation to other life‐history traitsCited 543 times
  5. Go sideways: Relational modelA closely related topic
  6. Go sideways: Relational databaseA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Examples
  2. Relation variables

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics