Abstract
Upon a system failure, a memory-resident database system will lose the portion of its database that resides in a volatile memory. In the paper, it is not assumed that the main memory is large enough to store the entire database. Instead, only a major portion of the database fits into main memory. An efficient partial reload scheme is needed to restore the lost portion of the database quickly without degrading the overall system performance upon a system crash. Page faults may be incurred during the reload process. A partial reload scheme should be capable of handling these page faults as well as database reload. The paper presents three different partial reload algorithms and page replacement schemes that aim at fast transaction response time and high system throughput.
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.
