Thumbnail
Access Restriction
Subscribed

Author Huang, J. C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Data-base management ♦ Graph ♦ Information retrieval ♦ Tree ♦ File organization ♦ Information structure ♦ Storage allocation ♦ Data base
Abstract 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.
Description Affiliation: Univ. of Houston, Houston, TX (Huang, J. C.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 7
Page Count 5
Starting Page 406
Ending Page 410


Open content in new tab

   Open content in new tab
Source: ACM Digital Library