Browse Prior Art Database

THE CAMA DATA STRUCTURE

IP.com Disclosure Number: IPCOM000128399D
Original Publication Date: 1970-Aug-01
Included in the Prior Art Database: 2005-Sep-15

Publishing Venue

Software Patent Institute

Related People

Julyk, L.J.: AUTHOR [+4]

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 he destroyed when it is no longer needed. ";Garbage collection"; is handled automatically for all ";predefined types"; of packs.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 7% of the total text.

Page 1 of 39

THIS DOCUMENT IS AN APPROXIMATE REPRESENTATION OF THE ORIGINAL.

THE CAMA DATA STRUCTURE

THE UNIVERSITY OF MICHIGAN Memorandum 29
L.J. Julyk
L.W. Wolf

CONCOMP: Research in Conversational Use of Computers ORA Project 07449 F.H. Westervelt, Director

supported by: DEPARTMENT OF DEFENSE ADVANCED RESEARCH PROJECTS AGENCY WASHINGTON, D.C.

CONTRACT NO. DA-49-083 OSA-3050 ARPA ORDER NO. 716

administered through: OFFICE OF RESEARCH ADMINISTRATION ANN ARBOR August 1970

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 he destroyed when it is no longer needed. "Garbage collection" is handled automatically for all "predefined types" of packs.

TABLE OF CONTENTS

1. INTRODUCTION.....1
2. GLOSSARY.....4
3. CAMA-DS USER'S GUIDE.....12
3.1 Introduction.....12
3.2 Global Routines.....13
3.3 Routines Which Operate Only on Association Tables (Type 3.....19
3.4 Routines Which Operate Only on Line Directories (Type 2).....20
3.5 Routines Which Act Only on Stacks or Queues (Type 4).....20
3.6 Routines to Use on Packs for Type 5 or Greater.....21
3.7 Examples.....23
4. REFERENCES.....46
APPENDIX A: DATA STRUCTURES ROUTINES DESCRIPTORS.....A-1

University of Michigan Page 1 Aug 01, 1970

Page 2 of 39

THE CAMA DATA STRUCTURE

APPENDIX B: THE STRING-HANDLING PACKAGE.....B-1

1. INTRODUCTION

Under the auspices of the CONCOMP Project: Research in Conversational Use of Computers, the authors undertook to devise a man-machine interactive system (using a DEC 338 and an IBM 360/67) for Computer-Aided Mathematical Analysis. In brief, CAMA enables the user to define mathematical expressions using standard mathematical notations such as Σ, α, β, ∫f(x)dx through the use of a Grafacon and DEC 338 computer. These expressions can then be algebraically manipulated or evaluated and the results displayed graphically, if desired. The user may work with ordinary or partial differential equations, matrices, polynomials, double polynomials (i.e., polynomials spanning a 2-dimensional space), integral equations, or he may define his own modes.

Much of the work on CAMA involved the creation of a suitable data structure, and it is this data structure which is the subject of this report.

The CAMA Data Structure package (CAMA-DS) was designed to be used with CAMA and a number of associated systems. It interfaces with the MTS (Michigan Terminal System)1 system at the University of Michigan to take advantage of the richness of that system, and in a few cases seeks to overcome the limitations of that system.

CAMA-DS is a variation on a standard inverted-tree structure, a design chosen to meet a...