The design of distributed database is an optimization problem and the resolution of several sub problems as data fragmentation (horizontal, vertical, and hybrid), data allocation (with or without redundancy), optimization and allocation of operations (request transformation, selection of the best execution strategy, and allocation of operations to sites). There are some different approaches to solve each problem, so this means that the design of the distributed databases is become hard enough. There are many researches connected to the dates fragmentation and they are presented both in the case of relational database and in the case of object-oriented database. In this paper is presented the implementation of a heuristic algorithm conceived before that uses an objective function who takes over information about the administrated dates in a distributed database and it evaluates all the scheme of the database vertical fragmentation. © Springer Science+Business Media B.V. 2008.
CITATION STYLE
Runceanu, A. (2008). Fragmentation in distributed databases. In Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering (pp. 57–62). https://doi.org/10.1007/978-1-4020-8735-6_12
Mendeley helps you to discover research relevant for your work.