Database Systems¶
Garcia-Molina, H., Ullman, J. D., & Widom, J. (2008). Database Systems: The Complete Book. Pearson Prentice.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Equivalence-Preserving Rewriting
- A second compression follows: the equivalence relation, once made explicit, is reusable across many cost criteria — the same relational-algebra equivalences serve cost models for spinning disk, SSD, distributed shuffle, and in-memory engines, and the same logical-equivalence laws serve proof shortening, proof clarification, and prover-friendly rewriting.
This sourceStandard database text covering cost-based query optimization, relational-algebra equivalences, set-versus-bag (duplicate-preserving) semantics, and cost models parameterized by storage/access characteristics — supports both the reusability of equivalences across cost models and the set-vs-bag grain hazard.
- A second compression follows: the equivalence relation, once made explicit, is reusable across many cost criteria — the same relational-algebra equivalences serve cost models for spinning disk, SSD, distributed shuffle, and in-memory engines, and the same logical-equivalence laws serve proof shortening, proof clarification, and prover-friendly rewriting.
- Return Path
- It is a distinct designed subsystem, not the forward channel run in reverse.
This sourceTreats transactions, rollback, and recovery (Ch. 17–19) as machinery distinct from the forward commit path.
- It is a distinct designed subsystem, not the forward channel run in reverse.
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.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:90e05cf4a1ff · see in the full table