Description of a set-theoretic data structure

Authors:
David L. Childs
Affiliations:
University of Michigan, Ann Arbor, Michigan
Venue:
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Year:
1968

Citing 0
Cited 5

Data architecture and data model considerations

AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Data base systems

IBM Systems Journal
Decomposition of a data base and the theory of Boolean switching functions

IBM Journal of Research and Development
Introduction to storage structure definition

SIGFIDET '70 Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
A data base sublanguage founded on the relational calculus

SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

The overall goal, of which this paper is a part, is the development of a machine-independent data structure allowing rapid processing of data related by arbitrary assignment such as: the contents of a telephone book, library files, census reports, family lineage, graphic displays, information retrieval systems, networks, etc. Data which are non-intrinsically related have to be expressed (stored) in such a way as to define the way in which they are related before any data structure is applicable. Since any relation can be expressed in set theory as a set of ordered pairs and since set theory provides a wealth of operations for dealing with relations, a set-theoretic data structure appears worth investigation.