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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
