Fuzzy Neighborhood Allocation (FNA): A Fuzzy Approach to Improve Near Neighborhood Allocation in DDB

Basseda, Reza; Rahgozar, Maseud; Lucas, Caro

doi:10.1007/978-3-540-89985-3_114

Cited by 1 publication

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gope and Basseda et al proposed an algorithm, which is based on the Optimal Algorithm, but with a different strategy for selecting nodes for data movement. Basseda et al presented and analyzed a new approach for dynamic data allocation, named the Fuzzy Neighborhood Allocation (FNA) Algorithm, which is based on the algorithm proposed in the work of Basseda et al…”

Section: Related Workmentioning

confidence: 99%

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

Section: Related Workmentioning

confidence: 99%