I know that graph based protocols require prior knowledge of access of data items. Besides when a transaction locks some data item in graph based protocol it also locks some unnecessary data items which it does not require, so ultimately any new transaction which requires the unnecessary lock obtained by the old transaction might suffer. But does that mean graph based protocol suffers from starvation even if it is deadlock free ?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.