The situation in which each pair of transactions has read a data written by the other, but there is no data written by the transactions is called as _______(a) Deadlock(b) Read skew(c) Deadlock skew(d) Write skewThe question was asked during an online interview.The query is from Multiversion Schemes, Snapshot Isolation in portion Concurrency Control of RDBMS

The situation in which each pair of transactions has read a data writt

1.	The situation in which each pair of transactions has read a data written by the other, but there is no data written by the transactions is called as _______(a) Deadlock(b) Read skew(c) Deadlock skew(d) Write skewThe question was asked during an online interview.The query is from Multiversion Schemes, Snapshot Isolation in portion Concurrency Control of RDBMS
Answer» The correct choice is (d) WRITE skew The explanation: The situation in which each pair of transactions has read a data written by the other, but there is no data written by the transactions is CALLED as write skew.

Discussion

No Comment Found

Related InterviewSolutions

State true or false: Exclusive locks are held until transaction commit in degree two consistency(a) True(b) FalseI have been asked this question in an international level competition.This interesting question is from Insert, Delete Operations and Predicate Reads in division Concurrency Control of RDBMS
Which of the following does cursor stability ensure(a) The tuple that is currently being processed by the iteration is locked in shared mode(b) The tuple that is currently being processed is not locked in shared mode(c) Any modified tuples are not locked in exclusive mode(d) None of the mentionedThis question was posed to me during an interview for a job.This interesting question is from Insert, Delete Operations and Predicate Reads in portion Concurrency Control of RDBMS
To prevent the phantom phenomenon, _______ is used(a) Key value locking(b) Next key locking(c) Previous key locking(d) None of the mentionedThe question was asked in unit test.My question comes from Insert, Delete Operations and Predicate Reads in chapter Concurrency Control of RDBMS
State true or false: Key value locking provides increased concurrency(a) True(b) FalseThe question was asked in exam.My question comes from Insert, Delete Operations and Predicate Reads in chapter Concurrency Control of RDBMS
Transactions that involve user interactions are called __________(a) Validations(b) Conversations(c) Interfaces(d) None of the mentionedThis question was addressed to me in an interview for job.I'm obligated to ask this question of Insert, Delete Operations and Predicate Reads in chapter Concurrency Control of RDBMS
_________ is a form of two degree consistency designed for programs that iterate over tuples of a relation by using cursors.(a) Cursor stability(b) Serializability(c) Non-serializability(d) Predicate lockingThe question was posed to me in homework.I'm obligated to ask this question of Insert, Delete Operations and Predicate Reads in division Concurrency Control of RDBMS
Which of the following is included in the operational mechanism of the index locking protocol?(a) Every transaction must have at least one index(b) A transaction that performs a lookup must acquire a shared lock on all the index leaf nodes that it accesses(c) The rule of the two phase locking mechanism must be observed(d) All of the mentionedI have been asked this question by my school teacher while I was bunking the class.Origin of the question is Insert, Delete Operations and Predicate Reads in chapter Concurrency Control of RDBMS
Which of the following does not lock the entire index(a) Phantom locking(b) Phantom problem(c) Index locking(d) Index problemI had been asked this question in an online quiz.I need to ask this question from Insert, Delete Operations and Predicate Reads in section Concurrency Control of RDBMS
________ deletes a data item from a database(a) Delete(Q)(b) Insert(Q)(c) Drop(Q)(d) None of the mentionedI had been asked this question by my college professor while I was bunking the class.My doubt stems from Insert, Delete Operations and Predicate Reads in chapter Concurrency Control of RDBMS
Which of the following transactions can multiversion two phase locking protocol not differentiate.(a) Read only transactions(b) Update transactions(c) All of the mentioned(d) Double operator transactionsI had been asked this question in an international level competition.My doubt is from Multiversion Schemes, Snapshot Isolation in division Concurrency Control of RDBMS

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment