A Library for Managing Persistent Storage

Abstract

The storage package provides a library of routines by which a program can manage variable length records or fixed length records in a persistent heap (using Unix files), and index them using either btrees or extendible hashing. Figure 1 defines the interface to the heap portion of the library. This heap library can be used for either fixed length or variable length records. It uses a record size as its principal parameter. Records of any length can be allocated, although they will be embedded in an integral number of records.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 09, 1988
Accession Number
ADA631493

Entities

People

  • Dennis M. Heimbigner

Organizations

  • University of Colorado Boulder

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Colorado
  • Computer Science
  • Computers
  • Corporations
  • Debugging
  • Hash Tables
  • Information Operations
  • Law
  • Measurement
  • Random Number Generators
  • Scanning
  • Semantics
  • Side Effects
  • Standards
  • Statistics
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Library and Information Science/ Studies, Southeast Asia Studies, Bibliography of Vietnam and Lao Studies.
  • Trauma or Military Medicine