Near Neighborhood Allocation (NNA): A Novel Dynamic Data Allocation Algorithm in DDB

In this paper, a new dynamic data allocation strategy for non-replicated distributed database systems (DDBS), namely the NNA algorithm, is proposed. This algorithm reallocates data with respect to changing data access pattern for each fragment. In this algorithm, data fragment is moved to a node, which is in the neighborhood and also placed in the path to the node with maximum access frequency for that fragment. This algorithm, by providing data clustering, is very suitable for DDBS in the networks, with heavy loads, and frequent requests for data fragments coming from different sites. The simulation results show that for networks where the request for non local data fragments are generated frequently, the NNA algorithm provides better response time and spends less time for moving data fragments in the network.

Keywords:

Distributed Database Systems , Distributed Data , Fragment Allocation