Register
Dark Mode

transactions

in Databases edited by
294 views
0 votes
0 votes
can anyone explain this question based on no of recoverable schedules?

consider the following transactions:

T1:W(A);W(B);R(C);C;

T2:W(B);R(B);C;

the number of schedules of T1 and T2 recoverable are?
in Databases edited by
by
294 views

2 Comments

by
1
1
by
thank u
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
3
aditi19 asked in Databases May 9, 2019
462 views
Any good resource for developing concepts on transactions in SQL?
aditi19 asked in Databases May 9, 2019
by aditi19
462 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!