This document summarizes a research paper that proposes a new dynamic fragment allocation algorithm for distributed database systems. The algorithm incorporates time constraints of database accesses, a volume threshold, and the volume of data transmitted between sites over time to dynamically reallocate fragments based on changing access patterns. It aims to migrate fragments to sites that consistently transfer the most data to/from that fragment over recent time intervals. This is intended to improve performance by minimizing data transmission costs as access patterns change. Key factors like the volume threshold, time interval duration, and consistency threshold regulate how frequently fragments are reallocated.