Fundamentals of Database Systems¶
Elmasri, R., & Navathe, S. B. (2015). Fundamentals of Database Systems. Pearson.
Cited by¶
2 citations across 2 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¶
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:b184a0a85f37 · see in the full table