Automatic Coding: Choice of Data Structures
Abstract
A system is described which automatically chooses representations for high-level information structures, such as sets, sequences, and relations for a given computer program. Representations are picked from a fixed library of low- level data structures including linked-lists, binary trees and hash tables. The representations are chosen by attempting to minimize the predicted space-time integral of the user's program execution. Predictions are based upon statistics of information structure use provided directly by the user and collected by monitoring executions of the user program using default representations for the high-level structures. A demonstration system has been constructed. Results using that system are presented.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1974
- Accession Number
- ADA000500
Entities
People
- James R. Low
Organizations
- Stanford University