#dbms #serializability

Question

There exist an schedule which serializable but is neither view serializable nor conflict serializable ?

Comments

I apologise if you find my comments rude or hurting.  For this one question I have read korth, Ullman and also try to search on net but didn't find it, its not like I am lazy to search it. My aim was not to hurt anyone

---

its ok bro..i will let u know if i find nay concrete proof regarding this:)

---

AFAIK , A schedule is said to be serializable iff it is both view and conflict serialisable

Answer 1

A transaction schedule is serializable if its outcome (e.g., the resulting database state) is equal to the outcome of its transactions executed serially, i.e., sequentially without overlapping in time.

Two major types of serializability exist: view-serializability, and conflict-serializability. View-serializability matches the general definition of serializability given above. Conflict-serializability is a broad special case, i.e., any schedule that is conflict-serializable is also view-serializable, but not necessarily the opposite. 

In short:->Ur statement is false bcz if serialized schedule then it is definitely view serialzable but may or may not conflict serialzable.

Comments

If anybody still need reference https://en.m.wikipedia.org/wiki/Serializability

---

YES, as nadeshseen pointed out, the set of consistent schedules does mean serializable as it’s definition is: “such a schedule which produces the same result as that of serial schedule” keeping the database consistent as if they were run separately.

So, the best answer put on this thread is INCORRECT, and there do exist serializable schedules, which are not view serializable