Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Volume 4, Issue 4Dec. 1979
Editor:
  • David K. Hsiao
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
ISSN:0362-5915
EISSN:1557-4644
Reflects downloads up to 04 Oct 2024Bibliometrics
Skip Table Of Content Section
article
Free
Extending the database relational model to capture more meaning

During the last three or four years several investigators have been exploring “semantic models” for formatted databases. The intent is to capture (in a more or less formal way) more of the meaning of the data so that database design can become more ...

    article
    Free
    Efficient optimization of a class of relational expressions

    The design of several database query languages has been influenced by Codd's relational algebra. This paper discusses the difficulty of optimizing queries based on the relational algebra operations select, project, and join. A matrix, called a tableau, ...

    article
    Free
    Testing implications of data dependencies

    Presented is a computation method—the chase—for testing implication of data dependencies by a set of data dependencies. The chase operates on tableaux similar to those of Aho, Sagiv, and Ullman. The chase includes previous tableau computation methods as ...

    article
    Free
    Pipelining: a technique for implementing data restructurers

    In the past several years much attention has been given to the problem of data translation. The focus has been mainly on methodologies and specification languages for accomplishing this task. Recently, several prototype systems have emerged, and now the ...

    article
    Free
    Theseus—a programming language for relational databeses

    Theseus, a very high-level programming language extending EUCLID, is described. Data objects in Theseus include relations and a-sets, a generalization of records. The primary design goals of Theseus are to facilitate the writing of well-structured ...

    article
    Free
    Design of a balanced multiple-valued file-organization scheme with the least redundancy

    A new balanced file-organization scheme of order two for multiple-valued records is presented. This scheme is called HUBMFS2 (Hiroshima University Balanced Multiple-valued File-organization Scheme of order two). It is assumed that records are ...

    article
    Free
    On searching transposed files

    A transposed file is a collection of nonsequential files called subfiles. Each subfile contains selected attribute data for all records. It is shown that transposed file performance can be enhanced by using a proper strategy to process queries. Analytic ...

    Subjects

    Comments