Abstract
Consider a very large ordered collection of indices for an index organization of a dynamically changing random access file. In this paper, we propose a technique for compressing keys from the collection of indices into the minimal set, and hence reducing tremendously the storage space requirement. A set of criteria is given for considering whether the application of this compression technique on keys can meet the minimal space requirement. We also propose the storage structure design for these compressed indices with a view to tackling the key redundancy problem, supporting a general algorithm for retrieving the keys and minimizing costs for updating and maintenance of indices. Finally, we give a comparison between the use of ON KEY interruption implemented in PL/1 and the use of the key compression technique and the hierarchical tree structure as our alternative in dealing with indexed sequential files.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Bayer and E. McCreight, “Organization and maintenance of large ordered indexes,”ACTA Information 1:173–189 (1972).
C. J. Date,An Introduction to Database Systems (Addison-Wesley, Reading, Massachusetts, 1977).
P. A. D. de Maine, “File structure of the SOLID system,” inFile Organization Ole C. Nord,et al., Eds. (Swets and Zeitlinger N. V., Amsterdam, 1969), pp. 137–148.
P. A. D. de Maine and G. K. Springer, “The COPAK compressor,” inFile Organization Ole C. Nord,et al., Eds. (Swets and Zeitlinger N. V., Amsterdam, 1969), pp. 149–159.
C. C. Foster, “Information storage and retrieval using AVL trees,”Proceedings of the ACM 20th National Conference (1965), pp. 192–205.
E. N. Gilbert and E. F. Moore, “Variable-length binary encodings,”Bell Syst. Tech. J. 38:933–968 (July 1959).
D. A. Huffman, “A method for the construction of minimum-redundancy codes,”Proc. IRE 40:1098–1101 (Sept. 1952).
D. E. Knuth,The Art of Computer Programming, Vol.III:Sorting and Searching (Addison-Wesley, Reading, Massachusets, 1973).
W. I. Landauer, “The balance tree and its utilization in information retrieval,”IEEE Trans. Electronic Computers,EC-12 (6):863–871(Dec. 1963).
B. A. Marron and P. A. D. de Maine, “Automatic data compression,”Comm. ACM 10 (11):711–715 (1967).
P. A. Ng, D. T. Chen, and S. Y. Bang, “A data compression scheme for large ordered indices,”Proceedings of the 7th Texas Conference on Computing Systems, Houston, Texas (1978), pp. 8–6 through 8–16.
S. V. Pollack and T. D. Sterling,A Guide to PL/1 (Holt, Rinehart and Winston, New York, 1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ng, P.A., Tsai, L. The design and implementation of a scheme for large ordered indices. International Journal of Computer and Information Sciences 9, 407–434 (1980). https://doi.org/10.1007/BF00978522
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00978522