www.jntuworld.

com

R05

Code No: R05420504

Set No. 2

IV B.Tech II Semester Examinations,AUGUST 2011

DISTRIBUTED DATABASES
Computer Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. Explain the following approaches:
(a) Write-locks-all
(b) Weighted majority locking.

D
L

2. (a) Explain about semi-join reduction DDB.

(b) Discuss the problems in query optimization.

[8+8]

[8+8]

R
O

3. (a) Discuss the properties of distributed transactions.

(b) Write about the communication structure of distributed transactions. [8+8]

4. (a) Explain the conservative timestamp method.

W
U

(b) Consider the data item x. Let RTM(x)=25 and WTM(x)=20. Let the pair(Ri(x),
TS) (Wi(x), TS) denote the read(write) request of transaction Ti on the item
x with timestamp TS. Indicate the behavior of the basic timestamp method
with the following sequence of requests.
(R1(x), 19), (R2(x), 22), (w3(x), 21)
(W4(x), 23), (R5(x), 28), (W6(x), 27).
[6+10]

T
N

5. (a) Discuss the architecture of DDB with a neat diagram.

(b) Write about horizontal and vertical fragmentation.
6. Explain about the push based technologies.

[8+8]
[16]

7. Hardware and software pointer swizzling mechanisms have complementary strengths

and weakness. Propose a hybrid pointer swizzling mechanism which incorporates
the strengths of both.
[16]
8. (a) Discuss parametric queries in detail.
(b) Draw an operator tree for the following query
PJ
SNUMSL AREA=North(SUPPLY JN DEPTNUM=DEPTNUMDEP T )[8+8]
?????

www.jntuworld.com

www.jntuworld.com

R05

Code No: R05420504

Set No. 4

IV B.Tech II Semester Examinations,AUGUST 2011

DISTRIBUTED DATABASES
Computer Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. (a) Explain the conservative timestamp method.
(b) Consider the data item x. Let RTM(x)=25 and WTM(x)=20. Let the pair(Ri(x),
TS) (Wi(x), TS) denote the read(write) request of transaction Ti on the item
x with timestamp TS. Indicate the behavior of the basic timestamp method
with the following sequence of requests.
(R1(x), 19), (R2(x), 22), (w3(x), 21)
(W4(x), 23), (R5(x), 28), (W6(x), 27).
[6+10]
2. Explain about the push based technologies.

R
O

D
L

[16]

3. (a) Discuss the properties of distributed transactions.

(b) Write about the communication structure of distributed transactions. [8+8]

W
U

4. (a) Explain about semi-join reduction DDB.

(b) Discuss the problems in query optimization.

T
N

[8+8]

5. Explain the following approaches:

(a) Write-locks-all

(b) Weighted majority locking.

[8+8]

6. (a) Discuss the architecture of DDB with a neat diagram.

(b) Write about horizontal and vertical fragmentation.

[8+8]

7. Hardware and software pointer swizzling mechanisms have complementary strengths

and weakness. Propose a hybrid pointer swizzling mechanism which incorporates
the strengths of both.
[16]
8. (a) Discuss parametric queries in detail.
(b) Draw an operator tree for the following query
PJ
SNUMSL AREA=North(SUPPLY JN DEPTNUM=DEPTNUMDEP T )[8+8]
?????

www.jntuworld.com

www.jntuworld.com

R05

Code No: R05420504

Set No. 1

IV B.Tech II Semester Examinations,AUGUST 2011

DISTRIBUTED DATABASES
Computer Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. (a) Discuss the properties of distributed transactions.
(b) Write about the communication structure of distributed transactions. [8+8]
2. (a) Discuss the architecture of DDB with a neat diagram.

D
L

(b) Write about horizontal and vertical fragmentation.

3. (a) Discuss parametric queries in detail.

[8+8]

R
O

(b) Draw an operator tree for the following query

PJ
SNUMSL AREA=North(SUPPLY JN DEPTNUM=DEPTNUMDEP T )[8+8]
4. (a) Explain the conservative timestamp method.

(b) Consider the data item x. Let RTM(x)=25 and WTM(x)=20. Let the pair(Ri(x),
TS) (Wi(x), TS) denote the read(write) request of transaction Ti on the item
x with timestamp TS. Indicate the behavior of the basic timestamp method
with the following sequence of requests.
(R1(x), 19), (R2(x), 22), (w3(x), 21)
(W4(x), 23), (R5(x), 28), (W6(x), 27).
[6+10]

W
U

T
N

5. Explain the following approaches:

(a) Write-locks-all

(b) Weighted majority locking.

[8+8]

6. Hardware and software pointer swizzling mechanisms have complementary strengths

and weakness. Propose a hybrid pointer swizzling mechanism which incorporates
the strengths of both.
[16]
7. Explain about the push based technologies.

[16]

8. (a) Explain about semi-join reduction DDB.

(b) Discuss the problems in query optimization.
?????

www.jntuworld.com

[8+8]

www.jntuworld.com

R05

Code No: R05420504

Set No. 3

IV B.Tech II Semester Examinations,AUGUST 2011

DISTRIBUTED DATABASES
Computer Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. Explain the following approaches:
(a) Write-locks-all
(b) Weighted majority locking.

D
L

2. (a) Discuss the properties of distributed transactions.

[8+8]

(b) Write about the communication structure of distributed transactions. [8+8]

R
O

3. (a) Explain about semi-join reduction DDB.

(b) Discuss the problems in query optimization.

[8+8]

4. Hardware and software pointer swizzling mechanisms have complementary strengths

and weakness. Propose a hybrid pointer swizzling mechanism which incorporates
the strengths of both.
[16]

W
U

5. (a) Discuss the architecture of DDB with a neat diagram.

T
N

(b) Write about horizontal and vertical fragmentation.

[8+8]

6. (a) Explain the conservative timestamp method.

(b) Consider the data item x. Let RTM(x)=25 and WTM(x)=20. Let the pair(Ri(x),
TS) (Wi(x), TS) denote the read(write) request of transaction Ti on the item
x with timestamp TS. Indicate the behavior of the basic timestamp method
with the following sequence of requests.
(R1(x), 19), (R2(x), 22), (w3(x), 21)
(W4(x), 23), (R5(x), 28), (W6(x), 27).
[6+10]
7. Explain about the push based technologies.

[16]

8. (a) Discuss parametric queries in detail.

(b) Draw an operator tree for the following query
PJ
SNUMSL AREA=North(SUPPLY JN DEPTNUM=DEPTNUMDEP T )[8+8]
?????

www.jntuworld.com