Storage representations for tree-like data structures

Authors:
Arnold L. Rosenberg;Derick Wood;Zvi Galil
Affiliations:
-;-;-
Venue:
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Year:
1979

Citing 4
Cited 0

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Space and Time Hierarchies for Classes of Control Structures and Data Structures

Journal of the ACM (JACM)
Encoding Data Structures in Trees

Journal of the ACM (JACM)
Preserving average proximity in arrays

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

We review the motivation underlying the study of data encodings and the formal framework of the study. We then present a series of results whose main message is that (complete) trees are materially less congenial storage representations for tree-like data structures than they have been shown to be for array-like data structures. In response to these results, we propose a new data structure, called a dree, which we show to share the advantages of trees, but not to suffer their disadvantages, when used as a storage structure.