A storage scheme for an automated archive
| dc.date.accessioned | 2015-04-01T11:41:56Z | |
| dc.date.available | 2015-04-01T11:41:56Z | |
| dc.date.issued | 1989 | |
| dc.identifier.uri | urn:nbn:de:hebis:34-2015040147934 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/2015040147934 | |
| dc.language.iso | eng | |
| dc.publisher | University of Kassel, Department of Mathematics and Computer Science | eng |
| dc.rights | Urheberrechtlich geschützt | |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
| dc.subject | Storage | ger |
| dc.subject | Archive | ger |
| dc.subject | File | ger |
| dc.subject.ddc | 004 | |
| dc.title | A storage scheme for an automated archive | eng |
| dc.type | Aufsatz | |
| dcterms.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. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Wegner, Lutz M. | |
| dcterms.creator | Khalifa, Reda | |
| dc.subject.swd | Datei | ger |
| dc.subject.swd | Datenspeicherung | ger |
Files in this item
This item appears in the following Collection(s)
-
Publikationen [18]