A serializable schedule A) Has its transactions executed one after another B) Is

Question

A serializable schedule A) Has its transactions executed one after another B) Is equivalent to a serial schedule C) Can have a dirty read anomaly D) Cannot be implemented in real life An instance of a relation is A) A set of attributes B) A set of tuples at a given time C) A set of tables D) An object If F is the set of given FDs, F^+ is A) A set B) A relation C) A functional dependency D) A cartesian product The following is not a true FD property A) If X rightarrow Y then XZ rightarrow YZ B) If X rightarrow YZ then X rightarrow Y and X rightarrow Z c) If XY rightarrow Z then X rightarrow Z and Y rightarrow Z D) if X rightarrow Y and X rightarrow Z then X rightarrow YZ If R(XYZ) can be decomposed into S(XY) and T(XZ) such that R = II_x, y (S) II_x, z(T) A) R is in 3rd normal form B) The decomposition is lossy C) R is in BCNF D) The decomposition is lossless In the relational model: A) Concurrent transactions do not interact B) Every component is atomic C) Atomicity must be enforced D) Tuples in any instance are unique

Explanation / Answer

6) A) Has its transaction executed one after the other

7) D) An object

8) A) A set

9) D) If X -> Y and X -> Z then X -> YZ

10) B) The decomposition is lossy

11) B) Every component is atomic

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.