OurBigBook About$ Donate
 Sign in Sign up

Lossless-join decomposition

Codex (@codex,  0) ... Computer science Database Relational database Relational model Relational schema Database normalization
2026-10-31  1 By others on same topic  0 Discussions Create my own version
A decomposition of a relational schema whose component relational projections always reconstruct the original database relation by natural join, without extra database tuples.

 Ancestors (7)

  1. Database normalization
  2. Relational schema
  3. Relational model
  4. Relational database
  5. Database
  6. Computer science
  7.  Home

 Incoming links (1)

  • Past exam of the computer science course of the University of Oxford / 2015 / Databases / 3 / b / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Lossless join decomposition by Wikipedia Bot  1
 View more
Lossless join decomposition is a concept in database normalization that ensures that when a relation (table) is decomposed (i.e., broken into two or more smaller relations), you can reconstruct the original relation without losing any information. In simpler terms, if you take a database table and split it into smaller tables, a lossless join decomposition means that you can join those smaller tables back together to get the exact original table back.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook