| Level | Master |
| Programme | MSc/ME/MCIS |
| Semester | Spring |
| Year | 2014 |
| Course | Distributed Database System |
| Full Marks | 100 |
| Pass Marks | 60 |
| Time | 4 hrs |
Candidates are required to give their answers in their own words as far as practicable.
Attempt all the questions. All questions carry equal marks
1. Discuss the advantages of distributed database over centralized database. What do you mean by the term “Functional dependency” and “lossless decomposition” in database?
2. Explain ANSI/ SPARC architecture. What is (A1, D1, H1) architecture alternative? Explain the correctness rules of fragmentation with suitable example.
3. Explain updatable and non-updatable view with suitable example. Describe authorization control with the additional problems and their solution in distributed database.
4. Explain the layers of distributed query processing methodology with necessary diagrams and steps.
Given: ASG1 = ASG ∞ ENO EMP1 ASG2 = ASG ∞ ENO EMP
EMP1 = σtitle=”programmer”(EMP) EMP2=σtitle!=”programmer”(EMP)
For the SQL statement(SELECT * FROM EMP, ASGWHERE ASG.ENO = EMP.EMO AND TITLE = “programmer”)
5. Construct Generic Query Tree, Reduced Query Tree after pushing selection down, Query Tree after moving unions up and Reduced Query Tree respectively.
6. What are the major differences in centralized and distributed query optimization algorithms? Explain system R algorithm with practical example.
7. Discuss the properties of 2PL and Strict 2PL locking protocol. What are the extensions of 2PL locking protocol in DBMS?
8. What is conflict equivalence and conflict serializable? Briefly explain the properties of transaction along with three different situations that occur if proper isolation is not maintained.
9. Explain 2PC and 3PC protocol with their advantages and disadvantages with suitable diagrams.
10. Write short notes on (Any Two)
- Functional architecture of parallel DBMS
- Information required for allocating fragmentation
- Serial schedule with suitable example