Problem 3.6 (**). Let Q= {91,...,95} be a set of queries, A = {A1,...,A5} be a set of attributes, and S = {S1,S2,S3} be a set of sites. The matrix of Figure 3.21a describes the attribute usage values and the matrix of Figure 3.21b gives the applica- tion access frequencies. Assume that refi(9x) = 1 for all qk and S; and that Aj is the key attribute. Use the bond energy and vertical partitioning algorithms to obtain a vertical fragmentation of the set of attributes in A. S, S2 S3 10 200 - A, A A3 A4 Ag an o 1 1 0 1 | 1 1 1 0 1 | 1 0 0 1 1 To 0 1 0 0 95 1 1 1 0 0 | 035 010 0 150 (a) (b) Fig. 3.21 Attribute Usage Values and Application Access Frequencies in Exercise 3.6 Problem 3.6 (**). Let Q= {91,...,95} be a set of queries, A = {A1,...,A5} be a set of attributes, and S = {S1,S2,S3} be a set of sites. The matrix of Figure 3.21a describes the attribute usage values and the matrix of Figure 3.21b gives the applica- tion access frequencies. Assume that refi(9x) = 1 for all qk and S; and that Aj is the key attribute. Use the bond energy and vertical partitioning algorithms to obtain a vertical fragmentation of the set of attributes in A. S, S2 S3 10 200 - A, A A3 A4 Ag an o 1 1 0 1 | 1 1 1 0 1 | 1 0 0 1 1 To 0 1 0 0 95 1 1 1 0 0 | 035 010 0 150 (a) (b) Fig. 3.21 Attribute Usage Values and Application Access Frequencies in Exercise 3.6