Total: 100 points
Due : 12/02 before class
1.
(20
points)
A PART table with Part# as search key field includes records with the following Part# values: 23,65,37,60,46,92,48,71,56,59,18,
21,10,74,78,15,16,20,24,28. Suppose that the records are inserted into a table
without sorting and the search field values are inserted in the given order
into an initially empty B+ tree. Build a B+ tree for the PART table with n = 6
pointers; show how the B+ tree expand (show several intermediate trees) and
what the final tree will look like.
2.
(10
points)
Textbook 12.12
3.
(10
points)
Textbook 14.12
4. (40 points)
(1) What
is a transaction?
(2) What is
a schedule?
(3)
Explain what is conflict-serialiable of a schedule?
(4) Given
following transactions:
T1: r1(x)w1(y)r1(x)r1(z)r1(y)w1(z)
T2: w2(x)r2(x)r2(y)w2(y)
T3: r3(x)r3(y)r3(z)w3(x)w3(z)
and following schedules:
S1:
r1(x)w1(y)w2(x)r1(x)r2(x)r1(z)r3(x)r1(y)w1(z)r3(y)r2(y)w2(y)r3(z)w3(x)w3(z)
S2:
r1(x)w1(y)r1(x)w2(x)r2(x)r1(z)r3(x)r1(y)w1(z)r2(y)w2(y)r3(y)r3(z)w3(x)w3(z)
Draw the
precedence graph for each schedule. Which schedule(s) are conflict-serializable? Why?
5.
(15
points) Explain distributive, algebraic, and
holistic aggregation functions. Give two examples for each.
6.
(5
points) Explain why bitmap indexing is considered a
good indexing schedule in data warehouses.
Submission instructions:
- Submit a hard copy of
answers before class of the due date.