Abstract | ||
---|---|---|
File space is an important type of resource needed during the process of converting data base from one form to another. Each file used in the conversion process has a size and life span. The life span of a file is measured from its creation time until the time it is no longer needed in the conversion process. The problem considered in this paper is to find a schedule for the different steps of the conversion process such that the sum of file costs is minimized. The cost of a file is defined as its life span times its size. The problem under consideration is NP -complete, and we therefore present an efficient algorithm for a special case, where the given precedence constraints are series parallel. |
Year | DOI | Venue |
---|---|---|
1987 | 10.1016/0305-0548(87)90003-7 | Computers & OR |
Keywords | DocType | Volume |
database conversion,space utilization | Journal | 14 |
Issue | ISSN | Citations |
2 | Computers and Operations Research | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hussein M. Abdel-Wahab | 1 | 97 | 20.10 |
Tiko Kameda | 2 | 638 | 224.17 |