Scribd Logo
Upload

Welcome to Scribd!

  • Homework

    Uploaded by

    Kailash Bal
    52 views1 page
    This document discusses vertically fragmenting a relation R with attributes A1,A2,A3,A4 based on an attribute usage matrix Q and access frequency matrix M for 4 queries across 3 sites. It involves calculating an attribute affinity matrix AA, using a bond energy algorithm to get a clustered affinity matrix CA, and then vertically splitting into 2 fragments, assuming the primary key is A1.

    Original Description:

    Original Title

    homework

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses vertically fragmenting a relation R with attributes A1,A2,A3,A4 based on an attribute usage matrix Q and access frequency matrix M for 4 queries across 3 sites. It involves calculating an attribute affinity matrix AA, using a bond energy algorithm to get a clustered affinity matrix CA, and then vertically splitting into 2 fragments, assuming the primary key is A1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    52 views1 page

    Homework

    Uploaded by

    Kailash Bal
    This document discusses vertically fragmenting a relation R with attributes A1,A2,A3,A4 based on an attribute usage matrix Q and access frequency matrix M for 4 queries across 3 sites. It involves calculating an attribute affinity matrix AA, using a bond energy algorithm to get a clustered affinity matrix CA, and then vertically splitting into 2 fragments, assuming the primary key is A1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Exercise on Vertical Fragmentation

    Consider the following Attribute Usage Matrix (Q) and Access


    Frequencies (M) for a relation R{A1,A2,A3,A4}, which has 4 queries
    (Q1,Q2,Q3,Q4) running at 3 sites (S1,S2,S3):

    Q: M:

    A1 A2 A3 A4 S1 S2 S3
    Q1 1 0 1 0 Q1 10 15 5
    Q2 0 1 0 1 Q2 20 15 20
    Q3 0 1 1 0 Q3 5 0 0
    Q4 0 0 1 1 Q4 10 0 5

    1. Find the Attribute Affinity Matrix (AA)


    2. Use the Bond Energy Algorithm to find the Clustered Affinity
    Matrix (CA)
    3. Perform vertical splitting to obtain 2 fragments. Assume that the
    primary key of relation R is A1.

    You might also like