Masters' Theses A Study on Data Allocation Problems for Distributed Database Design
2015.07.29 10:56
| year | 1990 |
|---|---|
| author | Kitae Shin |
| Keyword | Distributed Database Design, Heuristic, Data Allocation |
| Abstract | This thesis examines the problems of database partitioning and file allocation in a fixed topology distributed computer network. The objective is to make files as collections of attributes and to allocate these files to network nodes so that a minimum total transmission cost is achieved subject to storage capacity constraints. A model for solving the problem is formulated and the resulting optimization problem is shown to fall in a class of NP-complete problems. Deterministic techniques for solving this class of problems are computationally cumbersome, even for small size problems. A new heuristic algorithm is developed which uses the idea of allocating attributes according to the transaction requirements at each computer node and then making files using the allocated attributes. The heuristic algorithm greatly reduces the computational complexity of the problem. Numerical results indicate that the heuristic algorithm yields practicable low cost solutions in comparison with the existing method which deals with the file allocation problem and database partitioning problems independently. |
| c | MS |
Downlaod :