0% found this document useful (0 votes)
36 views

Assignment Dbms

This document discusses various database concepts including: 1) Candidate keys and partial dependencies between attributes in a relation. 2) Determining if a schedule is serializable or if it contains conflicts. 3) Drawing precedence graphs and transitively closed graphs to analyze transaction schedules. 4) Ensuring schedules are recoverable by committing transactions in the proper order so reads don't occur before writes.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
36 views

Assignment Dbms

This document discusses various database concepts including: 1) Candidate keys and partial dependencies between attributes in a relation. 2) Determining if a schedule is serializable or if it contains conflicts. 3) Drawing precedence graphs and transitively closed graphs to analyze transaction schedules. 4) Ensuring schedules are recoverable by committing transactions in the proper order so reads don't occur before writes.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Date

ExptNo
Page No.

J212 bata Mavag


36523s62.27

Cowsder nattrihu eoE


depeudenele

-) JisL al keysfo
Cy will be taeye in cauidate key

CoARE

CorEA

abey

Pxine Atribtes caBE

Dnme

Teacher's Signature
Cahe pime

Ealte

Fase

mus be a

key.
which is not Cru for any tor
! R s no
E.

For each of fhe follouing State chrong est Cano ua/


novn a fum
decompose fo scE

a) R, CABr CrD, E)
Arc,E cwill be in Ct
Ace AcE
AC

prim
Date

Expt.No. Page No.

becanse
atis tied
Checkfer paxtial depsefia n
CHs paape.

7rue

Rg
R,4 CAS)
A

R,BA (hEc)

An 1S they e
(anddate lceg
4nARF
ithe Candidak key

partialdependency
Not in QF

Teacher's Signature
R (4n)

Rs(A)D)

AD the can dida ke ley

dependewue s aYe mot ependent

Ry is alyeady

5) Rs (ALCE)
There are No
dependen aier

Gnly dependeny
Albea d y in BcNE

which of ehe folowing s ehedele s Con Plitt


Sevialinb/e) Lor each Seriali Sable Schedle determit
equivalen t Senial shedeeles:
Date

Expt. No. Page No.

T)

fhere ycle apre Cedena graph DELHo


Seialt able

Not Possih le (er'a re be cay e


there

Con tli'c t sealtable

Teacher's Signature
shedele uivalent
senablhca
ble flict (on
y
(y)j 03
rscYj
(2)l ) y) Y
/C2),
'sable Serial le
hecle Scther uhe State
s dna S fographs
r dena prece
Draw s dan S
ctons Eransa )
and Consider
lelisab
. Seria (onflhch ed
form ce Cy
Date

Expt.No. Page No.

2(2)

wot conflict SeYaltable


becau se cycle i preseub
pxe edue qyaph

Cen sider scheda les wleter


eacl Ckict cascadelesss
Ye Coueya ble

Relx)
Rzly)
(o mmit

Rly) (ommi
w()

Co mm
Tn all transacti'bnt Com mie s fon e at end
end So sbic
There is no Bead write
also

S4
73

wlY)
Commit Commit
Commi

Not stn because Yeads


data yfrom T3 bef
S re Corerable be ca se CommS be fore T;

and rh any Case oll ba ch s 72 rs irrecoverable.


73

73
YCE)

YCT)
Y(y)

(omnit
Date

Expt. No. Page No.

omiE

because toan satns from oer


tan sacon

Recove rable als o 6eca ssc CUen f any


fsan sachan Yoll bacle there s Caang rn
da tasase a

B Avinash
2o2213CSo22?

Teacher's Signature

You might also like