A note on information organization and storage

Since the logical structure of a data base can be represented by a tree or graph, it is quite natural for us to view the process of designing a data base as that of constructing a tree or a graph. A general method for constructing such a tree or graph is provided. There are three important elements...

Full description

Saved in:
Bibliographic Details
Published inCommunications of the ACM Vol. 16; no. 7; pp. 406 - 410
Main Author Huang, J. C.
Format Magazine Article
LanguageEnglish
Published New York, NY, USA ACM 01.07.1973
Subjects
Online AccessGet full text
ISSN0001-0782
1557-7317
1557-7317
DOI10.1145/362280.362285

Cover

More Information
Summary:Since the logical structure of a data base can be represented by a tree or graph, it is quite natural for us to view the process of designing a data base as that of constructing a tree or a graph. A general method for constructing such a tree or graph is provided. There are three important elements in this general construction method; namely, a set of binary relations, an algorithm for constructing subsets of a set, and an algorithm for selecting an element from the given set of objects. The use of different relations and algorithms results in different information structures, as list, tree, ring, etc. Thus the problem of information organization and storage is reduced to that of defining relations and formulating algorithms under a given set of constraints. The results presented may be valuable to designers as useful design concepts, and may serve as a basis for developing a formal theory on the subject.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0001-0782
1557-7317
1557-7317
DOI:10.1145/362280.362285