Redistributing Fragments into a Distributed Database | Zendy

Leon Ţâmbulea | Zendy; Manuela Petrescu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Redistributing Fragments into a Distributed Database

Author(s) -

Leon Ţâmbulea,

Manuela Petrescu

Publication year - 2008

Publication title -

international journal of computers communications and control

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.422

H-Index - 33

eISSN - 1841-9844

pISSN - 1841-9836

DOI - 10.15837/ijccc.2013.4.2406

Subject(s) - computer science , distributed database , transfer (computing) , heuristic , plan (archaeology) , fragment (logic) , database , distributed computing , data mining , algorithm , parallel computing , artificial intelligence , archaeology , history

A distributed system database performance is strongly related to the fragment allocation in the nodes of the network. An heuristic algorithm for redistributing the fragments is proposed. The algorithm uses the statistical information relative to the requests send to a distributed database. This algorithm minimizes the size of the data transferred for solving a request. Assuming that a distribution of the fragments in the nodes of a network is known, the algorithm generates a plan to transfer data fragments, plan that will be used to evaluate a request.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research