Malcolm C. Easton

Learn More
The observation that references to a particular page are clustered (in time) in typical database reference strings is used as the intuitive motivation for a model of page reference activity in an interactive database system. The model leads to a two-parameter form for the (Denning) working-set functions associated with a page. Methods for estimating(More)
A particularly simple Markov chain model for a reference string is described. The model, which is only slightly more complicated than the independent reference model, generates strings that have a locality property and that have a specified probability distribution of references over pages. Expressions are obtained for expected working-set size and expected(More)
Methods for creating and maintaining key-sequence data sets without overwriting the storage medium are described. These methods may be applied to erasable or to write-once storage devices, and they are compatible with conventional device error-management techniques. All past values of data records are preserved in a data structure called a Write-Once(More)