Roll no

Total no. of Pages: 03

Degree: B. Tech (CSDS) Semester: 6th— Course vVork
END-SEMESTER EXAMINATION, APRIL-MAY, 2024

Course Title: Distributed Databases

Course Code: CDCSCI S
Max. Marks: 40
Duration: 03 Hours

Note: Attempt all questions in the given order only. Missing data/information (if any), maybe
..

suitably assumed & mentioned in the answer.

~Z5.N0. Question Mark CO

L~
L Q~ Attempt any 2 parts of the following
P. ~ Describe at least S distributed design issues. (2-3 line description each) ~ COt
fT~ Illustrate the work-flow of various components of distributed DBMS in tenns of user processor and data 4 COl
L~ c
— processor using a neat diagram only.
Describe cloud computing with at least 4 significant levels of functionalities. List the typical advantages and 4 COt
~ disadvantages of cloud computing.
~Q2 Attempt any 2 parts of the following
~ 2a An Employee table has the following relational schema: “Employee (name, sal, bc, mgr),” where mine is 4 COZ
~ the primary key. The table has been horizontally fragmented into SP and MPLS fragments. SP has
~ employees who work in St. Paul and MPLS contains all employees who work in Minneapolis. Each
~ fragment is stored in the city where the employees are located. Assume transactions only enter the system in
~ NY and there are no employees in NY. Write down the local schemas and global schema and indicate in
~ which cities these schemas are located for the following three cases:
~ A. The system does not provide for any transparencies.
B. The system provides for location and replication transparencies.
C. The system provides for location, replication, and fragmentation transparencies.
~ 2b Consider table “EMP(EnpID, Name, Sal, Loc, Dept~.” There are four applications running against this table 4 C02
~ as shown below, Design an optimal vertical fragmentation strategy that satisfies the needs of these
~ applications. Show steps for arriving at the answer.
~ Al: ‘Select EmpID, Sal From EMP;”
~ A2: “Select EmpiD, Name, Loc. Dept From EMP Where Dept =

~ A3: “Select EmpiD, Name, Loc, Dept From EMP Where Loc
A4: “Select EmpID, Name, Loc, Dept from EMP Where Loc ‘MPLS’;”
2c Let AP={API AP5} be a set of applications, A {Al
= A5} be a set of attributes, and S {Sl, S2, S3, 4 C02
S4} be a set of sites. The given matrices in the table describe the attribute usage values and the application
access frequencies. Assume that refi(APk) = 1 for all APk and Si and that Al is the key attribute. Use the
bond energy and vertical partitioning algorithms to obtain a vertical fragmentation of the set of attributes
in A.
Attribute Uses Values Access Frequency
~ Q/A
 I) Write a nested query on Use relation account to find, fee cads israncis wins netne starting witlt B, all
acceunte with the nsaximum balance at the branch.
ii) Rewrite the nreceding ones-v. witlsottt uaing a neseed subqtterv; in other words. dacorrelote the
,~ Attempt sny 2 psrta afthe following
Sa It, ~(W,(x), WaLt), E3(x), Rt(x) WaLt), Ra(y), )?3(z), R2(x)]
H3 [Rs(z), RaCy), WaLt), RiCa), Wt(x), R3~x), WaLt), Rt (-x))
H3 =(Ra(z), WaLt), W~(y), .RtCx), R3(x), Ra(z), I?3(y), Ws (x)}
H4 =a(R,(z), Wa(,x), Wa(y), Wi fr), lIt (x), t?a(x). Raft). R3(y)]
Observing above histories ofdifl’crcnt sites, answer tise following wilh properjtustiticatien
I) Which ofthe following hiatories are conflict equivalent [2 Marks]
if) Which of the above hiatories Hi -‘24 are sorialirable? r2 Markel
2L’ Attempt ally 2 parts of the following — Sb Daing suitable hansaction processing examples on tnulliple sites, explaist lite foliowitsg for a diatributed
3a i. Assume tisat as a DBA you need to perform list join of two relations B. and S over attribute A, stored at 4 003 DBMS envirenment,
sites I and 2, respectively. Write iso 3 rules to compute the same by replacing one or both relations with a i) Working ofstriet 2 phase cnnsmit (2PC) protocol and titatesratssp based prsiocoi. (2 Marks)
~ semijoin. Also write the condition that assures the claim that sctsaijoin is better as cotstpareel to the natural — ii) Hierarchical and distril,tsted deadlock detectiott. [2 Mtrksl —
• join in this case. (3 Marks) Sc Briefly explain the Following,
II. Illustrate else rotnparison ofloin vs scmuioin [I Marki —
I) ACID preparlies for distributed databases (2 Marks) U) Lost Update and Inconsistent Retrievals [2
3b Assume that relation PROJ ofeho sstnple database is horizontally fragnsenled as follows: 4 003 Marks]
?ROJt O’rsoc’n-(PROJ)
PROJ2 = Upssoa’pa.(PROJ)
Furtisennort, relation ASO is indirectly fragtssented end rclatiott EMP is vertically fragmented Ca:
A501 ASG kasto PROJ1 EMPt = flzsso,esqswsss(EMP)

ASG2 = ASO kasso PROJ2 E5’1P2 = flxssn,nne(EMP)

Trattafona the following query into a reduccd query on ft’agtstrnss:
SELEcT ENAME
PROM EMP NATURAL JOIN ASO NATURAL JOIN PROJ WHERE PNAMB “lnelnttnentatiun’
(Note: Jfnseded assume the records for lIt,, relations by yourself) —
3e 5tte Costsider lisejoin grapls given and use following infonsiation: 4 003
~
)s.A,,
~ size(BMP) = 100, size(ASfJ) = 200, size(PROJ) = 300.
sizo(EMP ASO) “300, and size(ASG PROS) 200.
~ ass 7 ‘s~,re Describe an optitsial
transnsission rinse. join program based ots tlse objective function oftotal

SIt, a ate, S

~j_ Attempt any 2 parta oftlte following — —

4a Explain the database nonnalisation. Using suitable eseansples explain ZNP. 3NF, and SCM’. - 4 004
—
4b Show Isow to derive the following equivalences by a sequence of trans- formations using the equivalence 4 004
a. ObjAIt54m(E) on, (n’o.(era,(E))) . (2+2)
b. erik.,a,(E, ‘4, E~) = ns,,(Es t40, (rs-,a,(E3))), where I), involves Only
rules, attributes from E~

4c Conoider the following bank database, where the primary keys are underlined. 4 004
brauch(~pag~J~, bratselt city, assets) (2+2)
cuatomtr fctiatonser ID, customer nttsse, customer sheet, customer city)
loan fioan.ijgmbg~, brands tame, amounl)
borrower (customer ID, loan netmber)
account (account tttmber, brands name, balance)
depositor (custotaer ID, aceoutst sunsher)

2.