PMIT-6102
Advanced Database Systems
ByJesmin Akhter
Assistant Professor, IIT, Jahangirnagar University
Sample Questions



Q-1: “Proximity to its points of use or data localization Improve performance”,
Why?
Q-2: Problems area and Disadvantages of Distributed Database System?
Q-3: Promises of Distributed Database Management system?

Q-4: Is timesharing computer system a Distributed Database System? Explain
according to your answer.

Q-5: What is being distributed?

Q-6: Explain Logical data independence and Physical data independence.

Q-7:“Autonomy refers to the distribution or decentralization of control, not of
data.” Explain

Q-8: Network Transparency, Replication Transparency, Data independence?

Q-9: Fully Transparent Access

Q-10: Improve Performance, Reliability of distributed Database

Q-11: What is the fundamental issue in the distributed environment? “The user
should be protected from the operational details of the network” Explain
Slide 2
Sample Questions

Explain the important aspect or desirable property of simple predicates

Reasons for Fragmentation

Degree of Fragmentation

Comparisons of Relocation Alternatives

Write an iterative algorithm that would generate a complete and minimal set of
predicates Pr’ from a given set of simple predicates Pr.

Given relation PAY as in Figure B. Let p1: SAL<30000 and p2:SAL≥30000 be two
simple predicates. Perform a horizontal fragmentation of PAY with respect to these
predicates to obtain PAY1 and PAY2

Show the Stages of Normalization. Why Repeating Groups are not allowed in a
relational design?

Bring the following relation to 3rd Normal Form.

Draw E-R Diagram for the Banking Enterprise

Distinguish between super key and candidate key

Determine Keys from E-R Sets

All Example Queries

For the following relation Fig. A, find the largest account balance

Why simple join graph are desirable?

Which correctness criteria are satisfied by referential integrity?
Slide 3
Thank You
Slide 4