Abstract
Any assessment of the “cost” of encoding one data structure in another must take into account, among other issues, the intended patterns of traversing the guest structure. Two such “usage patterns,” namely, worstedge traversal and all-edges-equally-likely traversal, are particularly significant, since any bounds on encoding costs relative to these patterns yield bounds relative to large classes of other patterns also. The foregoing remarks are formalized in this paper, and a number of techniques for bounding the costs of encodings relative to these special usage patterns are developed and exemplified. Specifically, data structures are represented here as undirected graphs; and a number of lower bounds on the costs of data encodings are derived by comparing various structural features of the guest and host graphs. Relevant features include both maximum and average vertex-degree, “volume,” and “exposure,” a measure of connectivity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. A. DeMillo, S. C. Eisenstat, and R. J. Lipton, Preserving average proximity in arrays,C. ACM, 21, 228–231.
C. C. Gotlieb and F. W. Tompa, Choosing a storage schema,Acta Inform. 3, 297–319 (1974).
G. H. Hardy, J. E. Littlewood, and G. Polya,Inequalities, Cambridge Univ. Press, 1967.
L. H. Harper, Optimal assignments of numbers to vertices,J. Soc. Indust. Appl. Math., 12, 131–135 (1964).
L. H. Harper, Optimal numberings and isoperimetric problems on graphs,J. Comb. Th., 1, 385–393 (1966).
M. A. Iordansk'ii, Minimalnye numeratsii vershin derevyev (in Russian),Problemy Kibernetiki, 31, 109–132 (1976).
D. E. Knuth,The Art of Computer Programming I: Fundamental Algorithms, Addison-Wesley, Reading, MA, 1968.
R. J. Lipton, S. C. Eisenstat, and R. A. DeMillo, Space and time hierarchies for classes of control structures and data structures,J. ACM, 23, 720–732 (1976).
J. L. Pfaltz, Representing graphs by Knuth trees,J. ACM, 22, 361–366 (1975).
A. L. Rosenberg, Preserving proximity in arrays,SIAM J. Comput., 4, 443–460 (1975).
A. L. Rosenberg, Data encodings and their costs,Acta Inform, 9, 273–292 (1978).
A. L. Rosenberg, Encoding data structures in trees, IBM RC-6793, 1977; submitted for publication.
P. Scheuermann and J. Heller, A view of logical data organization and its mapping to physical storage,Proc. 3rd Texas Conf. on Computing Systems, 1974.
Author information
Authors and Affiliations
Additional information
A preliminary version of this paper was presented, under the title, “Toward a theory of data encoding,” at the Conference on Theoretical Computer Science, Waterloo, Ontario, August 15–17, 1977.
Rights and permissions
About this article
Cite this article
Rosenberg, A.L., Snyder, L. Bounds on the costs of data encodings. Math. Systems Theory 12, 9–39 (1978). https://doi.org/10.1007/BF01776564
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01776564