A relational model of data for large shared data banks
Communications of the ACM
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Design and performance tools for data base systems
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
| Hi-index | 0.00 |
This paper describes a generalized page replacement problem in which the pages have variable sizes and the cost of a page fault is a function of the particular page referenced. In such an environment the conventional page replacement algorithms are found to perform inadequately. New algorithms are proposed for reducing the cost incurred because of page faults in response to a series of references. Simulation experiments have been run in order to compare the cost performance of these algorithms with standard techniques, and also with the minimum achievable cost. The latter is determined by means of a novel tree-pruning algorithm. One practical environment in which the general problem may arise is a relational data base having an implied relations facility, in which some relations are maintained in definition form until queried. The implied relation is analogous to a page, and the processing time for restructuring a relation from its definition varies from one relation to another. An efficient replacement algorithm is needed to manage the process as the implied relations alternate between the state of definitions and the state of explicit representation.