B.

kuthilha
LBMS ASsigorment- 5 Q0WTIA0429
¬CE-1
Enplain dle kec ior 6 instrtion operakon s in lineoy hoshing
with examples
To linear hathing, însovtion invoves
plating a
enty o a bucktl .It ht butktl ovrlouS, a ntw spli}
bltun s, deubling the ß veditn ibuHng ikms.
" Fon inS tanle, dirttory
lon sider Q tablt
hashtd with hoo buckets.
Tnstr ting values 3,6 and 9 wovkS shnoohly
unHl the
butkt kor 5 ove Mows- This hiq4ts
tigths a split. Grta Hng a
ntw butktt & adius ing ht divcctoy.
DeHcHon finds
elenens by hoshing 4 traversin g butkek. 14 4 is
í! hoshs to butKet 2. leadin g (ought,
diyettly to fhe ttm. lint a
hathing dyrnarni ta ly adapk, eticie nty maraging
qrowing ha ohile cnsuring quick attesS trough
hash baced organiza Hon.
Constutt a G tree to he follooinq stt of Values
(213,5, 7, I1, 11, 19, 22, 29, 31) ASsume hat the tyec is eopty
îniHalts & values Gre added in asending oder
Cons truet et tre toy tht Cases ohtrl nurnbe ot
piotvs fhat win io one node is as follo us
) fouy b) Cia ht.
Case ti) foun poip ts in one n0de
iniHal ftl

2 3
 nlle totey ing , 14,23

(t19,28)
nl intey ting 24, 31:

(ba) ) ,19) (24,3i]

tase (h) ight poinkas în ont NOde

Dfko insc ing 2,3, 5, 7:

PBtr îns tr ting I1, 14, 23

hca) )
:

94ty inStr ing 24, 31:

3 ompat heap hie orqoni 2a tion with hash Hle

OrqonizaHon.
 Heap Fie rganization Hasb lil Organization.
Data is Organized
Ovdey,uSing a bash tunivo
Struttere
toithput speci ic to
dircctly mapping keyAle.
alltowtng or Casy SptiHe lota Hons in
Ynser tiorn. fast fo
cs
Retnieval otko Yequlr euact mattbes, as if
Stanning thnough he
eceess
(omputts lvco
file, poen iay leading |dire
baced
Hy
on hashed key
a(esS tines
fo slowUb Can becffitien fox disett
Snsertion Stoataht fove0dd
due t may lead to
tooted tes s bul
Ihe lack D4 Poto mon le
ctutfx ing ß undr
detekion but may leod. to Hon sonne
rder, ine degrada
thaqmentalion ey Cond's
spate
lan Su/fty bom Can sulf(r tom
wastage due fo chusting
Stovage
traq men la tioo, leading
efficieny fo wasttd spat
Suitab)e for saenarios
(on mOnty used
tieval ot
Vaious da fabeses duc towhere ast ve
Spetific necDvds based on
insertiorn
Keys in itical.
Setondary oden.
blw primary îndex
make a omparision
4.
Sttonday indea.
Primavy index

non-priny Rey
DeiniHon he ppimary ke9
Lotumn.
a fable
 cvecHy hing |Poin key. hashed times Qttess
oYder Sorted byt o disk motches
to SlouwedPotofol
duingqutvics
tocut pOinicrs. leadirgfasteoemelyl, entivt leading
to
ated Scarnningcná Stanning|involvee file, enine the
inuolvcs
nethit tast Dllens retieval fast oftn Retoieval offenRetvitval
soting hic speci onactess spedup to ttion -fun Stqutolfaalny wiy thout
basd Halyt qutp |Seindees uoith file bash |asing
Stored is ta Da ta ombins
da Crqaniz Data
is Stovd isData
Crqaniza
ion. ion rqani
za Orqaniation
Hioo Organi
za
ile tialStquen fYlTndexcd
e ie Heap
file Hash
zaHon. ani org File varibus comprisioo
of 6tivt
o
non-Privy
key kprirmary
ey
cpecific Riless
to Dn
based ta da to AccesS
eflicient Povides acts5
e dhet provides Direel
nCs. Tnde oy rim to
rmpved /0 disk mo7e
Keyoinibuks primary On
inolvts but
key imory tdnon-pr basyetvitval tast
on
based Stanths enabling dtSS uen tniq
ting ltva atte fo
usetul entor(ing tor Tdel
primony inden
than latQts pace lessRequivas size.
inden
td the Tlo disk7¬duting
Ordey order. Tndexed D/
mntb rtdoes (0vds ve
0rds of
Dvdty
bvdey sital
0! phy the machs Stovage
he ohere index,
mtans wohich index, phyciat
cushr
td a is T4
hved (lus non- is 11
Tnstr tion | Clicitnt for
Dele tion ís diyet actes6 (ompara hively oete Hion (an
be cloe

eQuivts an also suffer

St (an eod to Can sutltr T1
h0m spa te
fom tragmenl
waskd cpact afion.
Suifable tor
USed in voninut pdeal foY tomonly
uted cohen Sce nayiDS
dota bass due applns veq uhing Speti he
Bo sinplieihy ohere nonat
ottess pa Her battd querils
- ns ncds fhe hequent.
insts tion optinnazaHion