A set-theoretic view of data-base representation

ABSTRACT

To achieve what I believe to be an acceptable. Information Management System, I propose that a set-theoretic view of a data-base be adopted. Most potential data-base users use the language of set-theory in their day to day references to the objects and relationships of their data-bases. Instead of twisting these natural language references to “collections”, a representation that is modelled on sets should be implemented. Among the many advantages to be gained by adopting this approach are: non-redundant storage of data common to two or more application environments, controlled access to the entire data-base by any data-dependent key, rapid selection and isolation of easily specified subsets of data, and the extraction of only those data necessary to satisfy specific needs. This description of data-base representation will include some conceptual aspects and will address specific problems related to the computer-based data-base. Some of the areas that will be addressed are security, integrity, accessibility, and flexibility.

REFERENCES

• 1: Beitz, E. H., The Interpretation of Structured Stored Data Using Delimiters. Record ACM SIGFIDET Workshop, Houston 1970.
• 2: Childs, D. L., Feasibility of a Set-Theoretic Data Structure: A General Structure Based on a Reconstituted Definition of Relation. Proc. IFIP Congress 1968.
• 3: Childs, D. L., Description of a Set-Theoretic Data Structure. Proc. FJCC 1968.
• 4: Childs, D. L., Extended Set Theory: A Formalism for the Design, Implementation and Operation of Information Systems. Set-Theoretic Information Systems Corporation, Ann Arbor, Michigan 1974.
• 5: Dewey, G., Relative Frequency of English Speech Sounds. Harvard University Press 1923.
• 6: Jerome A. Feldman , Paul D. Rovner, An ALGOL-based associative language, Communications of the ACM, v.12 n.8, p.439-449, Aug. 1969 [doi>10.1145/363196.363204]
• 7: Halmos, P. R., Naive Set Theory. vanNostrand Reinhold 1960.
• 8: Kolmogorov, A. N., Three Approaches to the Quantitive Definition of Information. International Journal of Computer Mathematics 1968.
• 9: Mealy, G. H., Another Look at Data. Proc. FJCC 1967.
• 10: Franco P. Preparata , Raymond Tzuu-Yau Yeh, Introduction to Discrete Structures for Computer Science and Engineering, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1973
• 11: Rovner, P. D. and Feldman, J. A., The LEAP Language and Data Structure. Proc. IFIP Congress 1968.
• 12: Schwartz, J. T., Abstract Algorithms and a Set-Theoretic Language for their Expression. Computer Science Department, Courant Institute of Mathematical Sciences, NYU 1971.
• 13: Schwartz, J. T., On Programming: An Interim Report on the SETL Project. Installment 1: Generalities. Computer Science Department, Courant Institute of Mathematical Sciences, NYU 1973.
• 14: Shannon, C. E., Prediction & Entropy of Printed English. Bell System Technical Journal 1951.
• 15: Suppes, P., Axiomatic Set Theory. vanNostrand Reinhold.
• 16: Warren, H. S., ASL:.A Proposed Variant of SETL. Computer Science Department, Courant Institute of Mathematical Sciences, NYU 197
• 17: Zipf, G. K., Human Behavior & the Principle of Least Effort. Addison-Wesley 1949.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.7 Database Administration
          Subjects: Security, integrity, and protection

General Terms:
Management, Security