Graduate Project
 

An attributed-based database structure for small computers

Public Deposited

Contenu téléchargeable

Télécharger le fichier PDF
https://ir.library.oregonstate.edu/concern/graduate_projects/1g05fm00n

Descriptions

Attribute NameValues
Creator
Abstract
  • Contemporary database systems are used in a variety of business applications requiring rapid retrieval of on­line data. When records contain unique information indexed by a single key, the retrieval operation can be simplified. However, when added generality and flexibil­ity is needed, inverted files and sophisticated data models result in a system of interconnecting pointers and their associated data management programs. These, in turn, add unnecessary complexity to the overall system. This paper develops a simplified data representation that overcomes many of the object1ons of other flexible database representations. In particular, we solve the following problems inherent in other database techniques employing a technique called the hashed index arrays. (1) Space consuming redundancy inherent in inverted files or linked structures is reduced to a minimum, thus making the indexed array structure attractive for small systems. (2) Records may be indexed by multiple keys (com­bined domain values). Each key field need not store a unique value, thus providing multi-attribute processing via a hashing function. (3) Fast retrieval, updates, and database "growth" is possible without excessive complexity. This is made possible by using extendible array structures based on shells rather than rows and columns.
Resource Type
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Déclaration de droits
Publisher
Peer Reviewed
Language

Des relations

Parents:

This work has no parents.

Articles

La vignette Titre Date de téléchargement Visibilité actes
file details Elton_Terry_J_1978_03.pdf 2023-01-27 Public Télécharger