Fundamentals of Database Systems¶
Elmasri, R., & Navathe, S. B. (2016). Fundamentals of Database Systems. Pearson.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Bijectivity
- Computing and information — lossless encoding as a bijection between source and code strings; reversible computation requiring every step to be a bijection; deliberately non-bijective functions where collision is the design knob. Translation — idealised lossless translation requiring a bijection between two languages' messages, whose strict impossibility is exactly the structural source of translation loss and translator's choices. Assignment and operations — the assignment problem and stable matching seeking a bijection between two sides that satisfies some criterion, where a feasible assignment is the existence of a bijection. Logic and biology — model isomorphisms as structure-preserving bijections; and near-bijective biological codes whose degeneracy is precisely a controlled departure from one-to-one. Cryptography and databases — block ciphers as bijections (otherwise decryption is impossible), and one-to-one table relationships as bijections whose join is lossless both ways.
This sourceDevelops lossless (nonadditive) join decomposition: a decomposition rejoins without spurious tuples exactly when the shared attribute is a key of one of the relations, so a one-to-one (bijective) relationship between two tables joins losslessly in both directions.
- Computing and information — lossless encoding as a bijection between source and code strings; reversible computation requiring every step to be a bijection; deliberately non-bijective functions where collision is the design knob. Translation — idealised lossless translation requiring a bijection between two languages' messages, whose strict impossibility is exactly the structural source of translation loss and translator's choices. Assignment and operations — the assignment problem and stable matching seeking a bijection between two sides that satisfies some criterion, where a feasible assignment is the existence of a bijection. Logic and biology — model isomorphisms as structure-preserving bijections; and near-bijective biological codes whose degeneracy is precisely a controlled departure from one-to-one. Cryptography and databases — block ciphers as bijections (otherwise decryption is impossible), and one-to-one table relationships as bijections whose join is lossless both ways.
Domain-specific¶
Mechanisms¶
- Retagging or Reindexing Migration
- It misleads most through unaudited downstream breakage: the re-tag succeeds, the records look right, and three weeks later a report that keyed off the old codes turns out to have silently returned zero — a broken reference (a dangling foreign key) that the cutover never traced.
This sourceDocuments a broken reference (a dangling foreign key) that the cutover never traced.
- It misleads most through unaudited downstream breakage: the re-tag succeeds, the records look right, and three weeks later a report that keyed off the old codes turns out to have silently returned zero — a broken reference (a dangling foreign key) that the cutover never traced.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 3 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:5d86debf4940 · see in the full table