Methods of Implementation of the Mumps Global Data-Base
- 1 January 1979
- journal article
- research article
- Published by Taylor & Francis in Medical Informatics
- Vol. 4 (3) , 151-164
- https://doi.org/10.3109/14639237909010910
Abstract
Recent standardization of the MUMPS language (ANSI Xlll-1977) has resulted in increased investigations into its efficient implementation. Of particular concern is the method of implementation of the MUMPS hierarchical data file, or global. Two implementation techniques have found substantial support: a traditional technique utilizing linked physical blocks, and a more recent, self-indexing method based on the theory of balanced trees. Comparison of these methods shows that the balanced-tree implementation offers significant advantages in most MUMPS environments.Keywords
This publication has 6 references indexed in Scilit:
- B-trees re-examinedCommunications of the ACM, 1978
- Pagination of B*-trees with variable-length recordsCommunications of the ACM, 1977
- Analysis of design alternatives for virtual memory indexesCommunications of the ACM, 1977
- MUMPS — An economical and efficient time-sharing system for information managementComputer Programs in Biomedicine, 1976
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- Design and implementation of a clinical data management systemComputers and Biomedical Research, 1969