What is a schedule Database Management Systems 10CS54 VTU notes JUNJULY 2013Jan 2016

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
Call for internship with your eduladder last date is 25/Mar/2019 apply today Here

Database-Management-Systems---10CS54-VTU-notes-->View question

What is a schedule? . Database Management Systems - 10CS54 VTU notes (JUN/JULY 2013/Jan 2016)

Explain with example serial, non serial and conflict serializable schedules?

Asked by:anonymousguy7799

Taged users:

Be first to like this question

Be first to dislike this question
Talk about this  Delete  Like  Dislike

A schedule (or history) S of n transactions T1, T2, ..., Tn is an ordering of the operations of the transactions subject to the constraint that, for each transaction Ti that participates in S, the operations of Ti in S must appear in the same order in which they occur in Ti. Note, however, that operations from other transactions Tj can be interleaved with the operations of Ti in S. For now, consider the order of operations in S to be a total ordering, although it is possible theoretically to deal with schedules whose operations form partial orders.  

Two operations in a schedule are said to conflict if they satisfy all three of the following conditions: 
1. they belong to different transactions;
 2. they access the same item X; and
 3. at least one of the operations is a write_item(X). For example, in schedule , the operations 
operations w1(X) and w2(X). However, the operations r1(X) and r2(X) do not conflict, since they are both read operations; the operations w2(X) and w1(Y) do not conflict, because they operate on distinct data items X and Y; and the operations r1(X) and w1(X) do not conflict, because they belong to the same transaction. • A schedule S is serial if, for every transaction T all the operations of T are executed consecutively in the schedule. • A schedule S of n transactions is serializable if it is equivalent to some serial VTUlive.com 67 schedule of the same n transactions

Answerd By:Nikhil-bharadwaj

Be first to like this answer

Be first to dislike this answer
Talk about this  Delete  Like  Dislike

Can you help us to add better answer here? Please see this

You may also like our videos

Below are some of the videos from our collection. We saw that students not only needed content but also videos. So, we decided to build a video platform for you also an algorithm which shows best videos suites to you related to the content you are browsing check out some videos which suit best for you.

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.
Career: Work or do your internship with us.
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.
Donate: Ad revenue alone is not able to take care of our server cost consider donating at least a dollar Click here to donate.

If you want the help of doing any of these never hesitate to drop an email to me arunwebber[at]gmail[dot]com, Or you can ping us on WhatsApp ph: 8147433408

Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Want to exlplore yourself?