Maulana Azad National Urdu University M.Tech I Semester Examination, March 2023
Paper - MTCS112PET : Distributed Databases
en
:^ J] ; ç: en p 9 J : p 6 ,
Time : 3 hrs Marks : 70
@ c Z
* ] :
» V ß Z Î Ð V x Ó X ì è S g á Z Z ® Å V / n Æ [ Z C Ù X x Î z Ô zx z Ô w Zz z : ì 6 , V & ] Ñ Z Î p ! 6 , t
Z
[ b i Ñ ì ò X ì
C X Ù Z Î
Æ w ò i Ñ [ Z » w Z Î C Ù X ] Ñ Z Î á zZ [ Z ¿ & * * %æFN ( à { & ] Ñ Z Î è z c ] Ñ Z Î ò i Ñ
10~ w Zz z
.1(10 x 1 = 10 Marks)
X ì
1a
/ 6 V , ì
X
(200)Î z ã ½ [ Z » w Z Î C Ù X ¶ [ Z Æ V ß Z Î õ 0 * ð Ã Ã D ¨ ( ¤ Ð ~ k ÔZ ] Ñ Z Î
8~ zx z
.2(5 x 6 = 30 Marks)
X ] Z
6a Æ w Z Î C Ù
V / 6 ,
ì
(500)Î õ 0 * ã ½ [ Z » w Z Î C Ù X ¶ [ Z Æ V ß Z Î & ð Ã Ã D ¨ ( ¤ Ð ~ k XZ ] Ñ Z Î
5~ x Î z
.3(3 x 10 = 30 Marks)
X ] Z
10a Æ w Z Î C Ù
Zz z w
(1)
w Z Î Å
z s
# ,
X
Allocation Schema (i)H ì
?
Locks (ii)Å
z s
# ,
X
Local Schemag Zz
Global Schema (iii)ß
(
/9 ) X ì C x ³ 6 , Ü z Ï Z Ç ! *
Sitesx Ó ñ ~
Distributed Database (iv)» Ý Z E Z ì w ' ' '
'
Two Phase Commit Protocol (v)Concurrency control can be avoided (b) Deadlock will not occur (a)
Z
~ y Ð ð Ã
7
(d) Atomicity, ie., all-or-nothing commits at all sites (c)7 ì
?
(Promise){ ° z »
Distributed Database y à Р~ s f z g q
(vi)Replication Transparency (b) Network Transparency (a)
Z
~ y Ð ð Ã
7
(d) Fragmentation Transparency (c)i Ð c
*
¯ { Z Z
+
X
Centralized DatabaseÆ
Dsitributed Databaseq - Z
(vii)Software Complexity (b) Software Cost (a)
Modular Growth (d) Slow Response (c)
g q z s f
~ Ð
¾ Z Å i Y
] î ì
?
Location Transparency (viii)Users to treat the data as if it is at one location (a) Programmers to treat the data as if it is at one location (b) Managers to treat the data as if it is at one location (c)
Z
~ y Ð ð Ã
7
(d)2/1
g q z s f
~ Ð
¾ Z Å i Y
] î ì
?
Heterogeneous Distributed Database (ix)Same DBMS is used at each location and data are not distributed across all nodes (a) The same DBMS is used at each location and data are distributed across all nodes (b) A different DBMS is used at each location and data are not distributed across all nodes (c) A different DBMS is used at each location and data are distributed across all nodes (d)
g
` s f
~
X
All Rowsg Zz
Some ColumnsÆ
Relation6 ,
SitesZ
(x)Horizontal Partition (b) Data Replication (a) Horizontal and Vertical Partition (d) Vertical Partion (c)
z zx
Å
Disadvantagesg Zz
AdvantagesÆ
Distributed DatabaseX , s # z Å
Distributed Database (2) z s
# , X ù
¯ 4
@ * ì
?
Performancet ? ì H
Data Localization~
Distributed Database (3)z Å
s
# ,
X
TransparencyÅ n Z B Æ w V & o X , s # z Å ¤ S Å
Transparency~
DDB (4)a Æ
Y õ z Å
s
# , ù X
\ M
ð D
Serializability~ e Æ
Concurrency Control Scheme (5)ì c 7 *
?
Schedule Serializableà , zZ Ð
ã ,
X
SIXX , s # z Å
Multiple Granularity (6) Lazyg Zz
EggerB Æ w V X N C { Z + Ã Æ
Data Replication~
Distributed Database Environment (7)z Å
s #
, X Y Ð
Z V ì
?
Centralized Query Processingt ? ì H
Distributed Query Processing (8)Ã V V ß Z » E
w D
ñ
z s
# ,
X
Distributed Query Processing StrategiesÐ ì Z o ?
&
V
V ß
Full Joint V Y ? ì Zg H »
Semi Join~
Distributed Database Environment (9)Z » E
w D
ñ
z s
# , X
z x Î
X , s # ?z ì Z V Y Ð
Multiversion Timestampt ? ì H
Multiversion Two phase Locking (10)Ã , Ò Ð
y ,
X
Architecture ModelsÆ
DDBMS , s # z Å
Design IssuesÆ
DDB (11) ä
Æ . Þ ì c
*
Conflict Serializable,
Checkt g Zz { Æ s Z ¤ /
Precedencea Æ
Scheduleñ b
(12) ,
X
FindÃ
Equivalent ScheduleÆ k Z ì
Conflict Serializable¤ / Z ó 7
R1(x); r2(x); w1(y); r3(y); r2(y); w2(y); r3(w); w3(y); r4(w); r4(z) w4(w) r1(z); w1(z);
~ Û
t ,
X
Three Phase Commit Protocolg Zz
Two Phase CommitX , p ° Å
Commit Protocol (13)Ð ì Z Z X
n
Replicationst V Y ? ì È H » \ M Ð
Fragmentations~
Distributed Database (14)ñ iz V V Æ w B C N
X
(Techniques)i § » ä
FragmentationsÆ
/ / /
2/2