Home → Magazine Archive → May 1978 (Vol. 21, No. 5) → Automatic data structure selection: an example and... → Abstract

Automatic data structure selection: an example and overview

By James R. Low

Communications of the ACM, Vol. 21 No. 5, Pages 376-385

The use of several levels of abstraction has proved to be very helpful in constructing and maintaining programs. When programs are designed with abstract data types such as sets and lists, programmer time can be saved by automating the process of filling in low-level implementation details. In the past, programming systems have provided only a single general purpose implementation for an abstract type. Thus the programs produced using abstract types were often inefficient in space or time. In this paper a system for automatically choosing efficient implementations for abstract types from a library of implementations is discussed. This process is discussed in detail for an example program. General issues in data structure selection are also reviewed.

The full text of this article is premium content


No entries found