Denabilihy quaantees that

properhy that
commited , sts change penmanenry
aonsacien s &
voill not be Rost
toct
he database -failure (e) Cnah.
Stond systn failure
event f a
even

shord lock 9,
Define tyansaciont to nead a a

ock allos oullicle prevenk other -transacion

shaned
data tomn concunently shored boek
data ttem ohile
trom modifying the ord prevenhing
ensuning dato Conís tency
is bld
tot updatec
Eacusive lock 4
transati¡n to
What
lock atlons ony
emclucive dada ttem at a time
An
and modi fy
a uofhing
accers

Prevent
other ransacios
ot
ading
enclusve lock 'y
the
dta item unlill d prevent
to the data
his ensures
neleased kpdates
Conglick ausing tangachions ?
shat
Concuent the sinultaneou enecution sf
to allows
Concurenl trantaclions nefer
On a
database ayebem
-transactions
maltipe 7esouy Ces
for efleient

Tuoance
3a foosct
 .t Vsed

be Implement
cd in
Cneuency conBvol cunbe
Teaent wnys, one way to tmplemend it Ry
Vsig Loc ks. Nbw, led . discoSs Tine stamp
Ovdeiny protocol.
identifiex Cr eateal
Timestaup is'a vniquc
by he DBMs to tdentityál trans action They
in the Drdey o uohich
uwhich they
Usually asigned
Submi ttcd to the System. Refey to the timcstamp
TSCT) Fo
tYansactHon T

Timestamp ovdewng protoale -"

The' maio idece itor this protocol is to ovde
thë tYCAns action bused on theiv Timestamps .
h.ischedule in which the tansactíom patieipate
Hen Souali 2able Cnd the only ywvalent
pomitted
Sesiel sch edule pemitted has the
in the 0ydey of thely
tYansactions
Timestamp Vaue.
sAating simply the se hedule is
.le {he
patieuta seut oder
equdvalent
to the tYden o-f the Cuvespondi
Transaction imestamps.kg
L
 alqovit hm ensuY¬
item aceesed by Cuntlicling
that Toy each

Schedule
operotiOns
the oyden in ohich the
in
item
1

accesed by does not violate the ordeuwg

TO enswe 4his USe to Timestamp values
ve laling to cach defaocs e item x:
* W-Ts
TS Cx) is the lauqest timestamp of any
Yansacion tha eçulcd. write Cx).

* R.TsCx) is the laqest timestamp ot any

ciecutcd Yoeud Cx).
trangachon' Hhot
 Dne perormanee Taning
Ans Dalabase perçorrmance tuning is the proees
database syeten fo
oplinieing
Smpnoved perforrmante and efiien y
Deçina luster irdea
inden in a
cluter d dea is a type of
onder
database thad determines the phyical
table Sonts ad storer
et
data
the dota nos acondiq
to the values s
fnden ky, naking data nehieval more
the
queyie, that imvstus ty indeaed
eficiend for

dipuvunt typer of file rganivahion

fle erqaurabon makada are

ash de otganizalion
Bt
ctustered Fle o1qariraion
vohat
a dala sthutute that npmove the
-An

Spud of data netatevd opuaion

database tatle.
5. Explain about clustered index organization
A clustered index is created only when both the following conditions are
satisfied:
 secondary memory should be in
The data or file, that you are moving into
sequential or sorted order.
repeated values.
There should be a key value, meaning it cannot have
sorting
Whenever you apply clustered indexing in a table, it will perform
index in a table like
in that table only. You can create only one clustered
dictionary where the
a primary key. A clustered index is as same as a
data is arranged in alphabetical order.
direct
In aclustered index, the index contains a pointer to block but not
data.
Polnter to block not record

EXAMPLE OF CLUSTERED INDEX

Example of Clustered Index

Example of Clustered Index
If youapply the primary key to any column, then automatically it will
become a clustered index.
Create Table
Create table Student (Roll_No int primary key,
Name varchar(50),
Gender varchar(30),
Mob_No bigint );
insert into Student values (4, 'ankita','female', 98765432 10 ):
Student values (3, 'anita', 'female', 9675432890 ):
insert into Student values (5, 'mahima', 'female', 8976453201 ):
2. Explain Deletion and insertion operations in ISAM.
Insert
If we want to insert a record, we should:
find the leaf page where it belongs.
if the page has enough space, simply insert it.
otherwise node pmust be split intop and p and a new separator has to
be inserted into the parentof p. Splitting happens recursively and may
eventually lead to a split of root node.
distribute then entries of pand the new entry onto pages p andp
Delete
Deletion is the opposite to the insertion.
Here we denote m the number of entries of pagepandd is the order of
B+ tree.
To delete a recordwith key k
find the page where k belongs to.
if m>d>, then page p has enough occupancy, simply delete k from page p.
otherwise borrow a entryfrom its right(left) sibling
If its right(left) sibling has less then d entries, merging leaf
required.
nodes is
nampl
To inset hew vecod o enpoy
in
Us thi tnden to rd the block containirg
(ess
teas than tso
lauqut ermployer inin the bloct
there Space chitt enrttvg
7or the
new

to Mat

bloch is
tul eate a new elflow Lbck
the
and yeod there.

to pot o the
tu inden
pdat
block
 oit nope1ie ecompoxalicn
fhe paoper bies of decompesition in OPMS are:

be
toscless joirn propeaby ? the dreompoihion dodd he
duomposed relaions
tosless, meaning that pini ng the
any
should nesul! in te qinad relahion oithout
hoss infpomalion
Pesevahon: The deconmpositin shoud preseve
Dependay
he tundional dependenies Of th orqinal relahion
PAR1- B
aund
koit
Ans Nommalization: Normaligatlon sa process af mnimizng
nelatton olations
o a set of
rom a
nedundarc4
Redundany ina el ation may cause insen
tion,delet?oo ad
redundary in
update Anomales. sofit helps to educe
aelations .
are a series of 7uidelfnes that
in Densmom a f o ns base s efcfent,
the desiqn of a d t
helps to ensune that data anomalles
andoe ton
jogan?gec and
| s t Nomal form: (tN) nomal?gatioo. In Iof, each
he mOs basic tevel of
This fs value, and each
able cell should cont ao
only a sioge
Should haue a uique momeThe (ne holps to
column
etiminate duplicate data
COunSe lcon tent
TaVa,C+t
Proq amnïngl
leb HTML1PHP, AsP
SeCend Dedndant da(a
{ha cach mcD at Yibulo be clependent on the

nequining should be
nelal edto the
oimy Ke ens that
each Golum
ColumOS
dâectiy
A: student
fee
Lang Knp
lok
Ra)
shyam ccc (5K Tava
I2k 3 DBMS
faju
name Lanq - known Grop Fee

Ram
lok
DBMS CSe
Ram
ISK
Shyam
shyam Tava ECe
ECe l2k
DBMs

fon (3)F): For oa nelatioo in 3E, * must be in gNFand

Thnd nomal
key
|(o)nonon prime atjbute is 4ansitfvely defenden on pme
X’A,then
atribute (b) Fos any mon tiulal funettonl dependeney
eilhei- x is a supe key A is a Pirne Attiibute
Ex: Student Fee

Group Fee Lang- knoon

Ram CSC (oK
2 DBMS
Shyam tce ece |SK
3
Raju ece Sava
DeMS
Bcof: BcNF 15 he advanced uension of aF
Sectiog Subfecl facuil TÉme sectio Time
A Cornp Sudhakas 8:00
Pacuty
Sudhaka 800

Phy 9:0D A
Raju 7:00
I0°00
|comp lo'o0 B Ram

cori Shyar |ahyam |:00