A Dynamic Data Fragmentation and Distribution Strategy for Main-Memory Database Cluster

MMDB cluster system is a memory optimized relation database that implements on cluster computing platform, provides applications with extremely fast response time and very high throughput as required by many applications in a wide range of industries. Here, a new dynamic fragment allocation algorithm (DFAPR) in Partially Replicated allocation scenario is proposed. This algorithm reallocates data with respect to changing data access pattern for each fragment in which data is maintained in current site, migrated or created new replicas on remote sites depend on accessing frequency and average response time. At last, the simulation results show that the DFAPR is suitable for MMDB cluster because it provides a better response time and maximize the locality of processing so it could be developed parallel processing of MMDB in cluster environment.