Aufsatz![](/themes/Mirage2/images/Open_Access_logo_PLoS_transparent.svg)
A storage scheme for an automated archive
Abstract
Presentation given at the Al-Azhar Engineering First Conference, AEC’89, Dec. 9-12 1989, Cairo, Egypt.
The paper presented at AEC'89 suggests an infinite storage scheme divided into one volume which is online and an arbitrary number of off-line volumes arranged into a linear chain which hold records which haven't been accessed recently. The online volume holds the records in sorted order (e.g. as a B-tree) and contains shortest prefixes of keys of records already pushed offline. As new records enter, older ones are retired to the first volume which is going offline next. Statistical arguments are given for the rate at which an off-line volume needs to be fetched to reload a record which had been retired before. The rate depends on the distribution of access probabilities as a function of time. Applications are medical records, production records or other data which need to be kept for a long time for legal reasons.
The paper presented at AEC'89 suggests an infinite storage scheme divided into one volume which is online and an arbitrary number of off-line volumes arranged into a linear chain which hold records which haven't been accessed recently. The online volume holds the records in sorted order (e.g. as a B-tree) and contains shortest prefixes of keys of records already pushed offline. As new records enter, older ones are retired to the first volume which is going offline next. Statistical arguments are given for the rate at which an off-line volume needs to be fetched to reload a record which had been retired before. The rate depends on the distribution of access probabilities as a function of time. Applications are medical records, production records or other data which need to be kept for a long time for legal reasons.
Citation
@article{urn:nbn:de:hebis:34-2015040147934,
author={Wegner, Lutz M. and Khalifa, Reda},
title={A storage scheme for an automated archive},
year={1989}
}
0500 Oax 0501 Text $btxt$2rdacontent 0502 Computermedien $bc$2rdacarrier 1100 1989$n1989 1500 1/eng 2050 ##0##urn:nbn:de:hebis:34-2015040147934 3000 Wegner, Lutz M. 3010 Khalifa, Reda 4000 A storage scheme for an automated archive / Wegner, Lutz M. 4030 4060 Online-Ressource 4085 ##0##=u http://nbn-resolving.de/urn:nbn:de:hebis:34-2015040147934=x R 4204 \$dAufsatz 4170 5550 {{Datei}} 5550 {{Datenspeicherung}} 7136 ##0##urn:nbn:de:hebis:34-2015040147934
2015-04-01T11:41:56Z 2015-04-01T11:41:56Z 1989 urn:nbn:de:hebis:34-2015040147934 http://hdl.handle.net/123456789/2015040147934 eng University of Kassel, Department of Mathematics and Computer Science Urheberrechtlich geschützt https://rightsstatements.org/page/InC/1.0/ Storage Archive File 004 A storage scheme for an automated archive Aufsatz Presentation given at the Al-Azhar Engineering First Conference, AEC’89, Dec. 9-12 1989, Cairo, Egypt. The paper presented at AEC'89 suggests an infinite storage scheme divided into one volume which is online and an arbitrary number of off-line volumes arranged into a linear chain which hold records which haven't been accessed recently. The online volume holds the records in sorted order (e.g. as a B-tree) and contains shortest prefixes of keys of records already pushed offline. As new records enter, older ones are retired to the first volume which is going offline next. Statistical arguments are given for the rate at which an off-line volume needs to be fetched to reload a record which had been retired before. The rate depends on the distribution of access probabilities as a function of time. Applications are medical records, production records or other data which need to be kept for a long time for legal reasons. open access Wegner, Lutz M. Khalifa, Reda Datei Datenspeicherung
The following license files are associated with this item:
Urheberrechtlich geschützt