An algorithm to manage variable-length records for highly portable clinical data base systems
✍ Scribed by Masahiko Okada; Mihoko Okada
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 774 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0010-4809
No coin nor oath required. For personal study only.
✦ Synopsis
An algorithm to archive patient data at free size in disk storage is presented. A record. assumed to be a character string such as an ASCII-coded text, is compressed and divided into fixed-length blocks. One block consists of a data field and a pointer field, and the blocks comprising a record are chained with pointers forwardly. A head pointer of each record is sequentially saved on a separate file. The data compression is performed as-follows: if the same character code appears more than twice in succession, we count the number of the repetitions and save it with initial two characters. The algorithms for fetching, re-saving, and purging a record are also presented. These were implemented in FORTRAN77 and-tested for performance using a practical patient data file. As the algorithm allows highly flexible record manipulation and can easily be implemented in conventional programming languages, it will make a useful tool for constructing a portable data base management system. Ed 1986 Academic Press, Inc.