Allocation
Allocation
• Allocation strategies
• Centralized- stores data at one site
• Partitioned- divides database into parts &
stores at several sites
• Replicated- Copies of one or more are stored
at several sites.
Allocation problem
• Fragments F={ f1,f2…….. Fn}
• Sites S={s1,s2……..sn}
• Applications Q={q1,q2,……..qn}
• Find the optimal or best distribution of F to S.
• Optimality:The optimality can be defined with
respect to two measures
• Minimal cost. The cost function consists of the cost
of storing each Fi at a site Sj, the cost of querying Fi
at site Sj , the cost of updating Fi at all sites where
it is stored, and the cost of data communication.
The allocation problem then, attempts to find an
allocation scheme that minimizes a combined cost
function.
• Performance. The allocation strategy is designed to
maintain a performance metric. Two well-known
ones are to minimize the response time and to
maximize the system throughput at each site.
Information Requirements
• Database Information
• Application Information
• Site Information
• Network Information