Heuristic Approach to Dynamic Data Allocation in Distributed Database Systems

Ulus, Tolga; Uysal, Mithat

doi:10.3923/itj.2003.231.239

Cited by 34 publications

(22 citation statements)

References 18 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consequently, it aims at minimizing the total execution time as compared to the Optimal Algorithm, 13 Threshold Algorithm, 14 Threshold and Time Constraint Algorithm (TTCA), 22 and Region Base Fragment Allocation Algorithm (RFA). Consequently, it aims at minimizing the total execution time as compared to the Optimal Algorithm, 13 Threshold Algorithm, 14 Threshold and Time Constraint Algorithm (TTCA), 22 and Region Base Fragment Allocation Algorithm (RFA).…”

Section: The Proposed Optimal Fragment Reallocation and Replication (mentioning

confidence: 99%

“…The proposed OFRAR Algorithm attempts to solve all the problems embedded in the previous Optimal Algorithm, 13 Threshold Algorithm, 14 Region Base Fragment Allocation Algorithm (RFA), 16 Threshold and Time Constraint Algorithm (TTCA), 22 and Static Allocation Strategy. The proposed OFRAR Algorithm attempts to solve all the problems embedded in the previous Optimal Algorithm, 13 Threshold Algorithm, 14 Region Base Fragment Allocation Algorithm (RFA), 16 Threshold and Time Constraint Algorithm (TTCA), 22 and Static Allocation Strategy.…”

Section: Reallocate In a Remote Clustermentioning

confidence: 99%

“…In order to solve the limitation of the previous proposed algorithms 13,14,16,22 and reduce the access time for more than one node and not for just only one site, first, the proposed OFRAR Algorithm needs to exclude the nodes with low access counts for a specific fragment relative to the access .…”

Section: Casementioning

confidence: 99%

“…In order to solve the limitation of the previous algorithms 13,14,16,22 and reduce the access time for more than one node and not for just only one site, first, the proposed OFRAR Algorithm needs to exclude the nodes with low read access counts for a specific fragment relative to the access of other nodes. In order to solve the limitation of the previous algorithms 13,14,16,22 and reduce the access time for more than one node and not for just only one site, first, the proposed OFRAR Algorithm needs to exclude the nodes with low read access counts for a specific fragment relative to the access of other nodes.…”

Section: Create Replica In Remote Clustermentioning

confidence: 99%

“…Table 6 In the simulated environment, we performed 4 experiments. The first three experiments are used to measure the performance of the proposed OFRAR Algorithm to take the reallocation in a remote cluster decision against existing algorithms like the Optimal Algorithm, 13 Threshold Algorithm, 14 Threshold and Time Constraint Algorithm (TTCA), 22 and Region Base Fragment Allocation Algorithm (RFA), 16 The simulated environment …”

Section: The Simulated Environmentmentioning

confidence: 99%

See 4 more Smart Citations

Dynamic data reallocation and replication over a cloud environment

Raouf

Badr

Tolba

2018

Concurrency and Computation

View full text Add to dashboard Cite

The performance and efficiency of the distributed database system (DDBS) design are dependent on proper data fragmentation, reallocation, and replication of global relations. In this research, a Cluster Based Distributed and Parallel Database System (CB-DDBS) architecture over a cloud environment is proposed. The proposed CB-DDBS architecture processes the client's query requests, which access the clustered DDBS from anywhere. It also allows vertical and horizontal fragmentation, allocation, and replication decisions to be taken statically at the initial stage of the design. In addition, it allows migration and/or replication decisions to be taken by each cluster independently of other clusters using the proposed Optimal Fragment Reallocation and Replication (OFRAR) Algorithm. The proposed CB-DDBS architecture and the proposed OFRAR Algorithm are tested in both Amazon cloud environment and a simulated environment. Experimental results show that the proposed OFRAR Algorithm efficiently reduces the communication costs for typical access patterns, the overloads of the sites, and the frequency and time spent on fragment migration over the network sites by imposing a stricter condition for fragment reallocation and replication, resulting in a great overall improvement in the DDBS performance. It also shows that the proposed CB-DDBS architecture results in a significant reduction of the execution time needed for the transactions and for noticing an error.

show abstract