The CAMA Data Structure

Abstract

The CAMA Data Structure is a variation on a standard inverted-tree data structure. Data is stored in 'packs' which are blocks of contiguous, dynamically allocated storage. Once a pack has been defined it need not remain in virtual memory. If it is a member of the permanent Data Structure it can be shifted out of virtual memory and stored on disk memory until it is referenced again. If it is a member of a temporary Data Structure it can be destroyed when it is no longer needed. 'Garbage collection' is handled automatically for all 'predefined types' of packs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1970
Accession Number
AD0714033

Entities

People

  • L. J. Julyk
  • L. W. Wolf

Organizations

  • University of Michigan

Tags

DTIC Thesaurus Topics

  • Assembly
  • Computers
  • Contracts
  • Data Storage Systems
  • Determinants (Mathematics)
  • Differential Equations
  • Directories
  • Equations
  • Integral Equations
  • Mathematical Analysis
  • Michigan
  • Partial Differential Equations
  • Personality
  • Procedures (Computers)
  • Sequences
  • Standards
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Parallel and Distributed Computing.
  • Polar and Arctic Studies