Skip to main content
SpringerLink
Log in

Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme

Teil II: Zugriffssysteme

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In part I of this paper, a mathematical model for data structures has been presented. Based on this model and on a corresponding formalized notion of retrieval operation, a model for storage access systems is introduced, which is called a Q-system. Equivalence, separation, and decomposition of Q-systems are studied, resulting in a set of basic principles for transforming Q-systems. These can be used for a systematical description of practical storage access systems for multi-attribute-retrieval.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literatur

  1. Abraham, C. T., Ghosh, S. P., Ray-Chaudhury, D. K.: File organization schemes based on finite geometries. Information and Control 12, 143–163 (1968)

    Google Scholar 

  2. Bloom, B. H.: Some techniques and trade-offs effecting large data base retrieval times. Proc. 24th Nat. Conf. ACM, Boston 1969, p. 83–95

    Google Scholar 

  3. Bose, R. C., Abraham, C. T., Ghosh, S. P.: File organization of records for multiple valued attributes for multi-attribute queries. IBM Res. Rep. RC-1886, 1967

  4. Chow, D. K.: New balanced-file organization schemes. Information and Control 15, 377–396 (1969)

    Google Scholar 

  5. Ehrich, H.-D.: Datenstrukturen und Q-Systeme — eine mathematische Studie. In: Brauer, W. (Hrsg.): Gesellschaft für Informatik, 3. Jahrestagung, Hamburg 1973. Lecture Notes in Computer Science 1. Berlin-Heidelberg-New York: Springer 1973, p. 363–371

    Google Scholar 

  6. Ehrich, H.-D.: Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil I: Datenstrukturen und Schemata. Acta Informatica 4, 201–211 (1975)

    Google Scholar 

  7. Ghosh, S. P.: Organization of records with unequal multiple-valued attributes and combinatorial queries of order 2. Information Sciences 1, 363–380 (1969)

    Google Scholar 

  8. Ghosh, S. P.: On the problem of query oriented filing schemes using discrete mathematics. Proc. IFIP Congr. 68. Amsterdam: North-Holland 1969, p. 1226–1232

    Google Scholar 

  9. Knuth, D. E.: The art of computer programming, vol. 1: Fundamental algorithms. Reading (Mass.): Addison-Wesley 1968

    Google Scholar 

  10. Krägeloh, K.-D., Lockemann, P. C.: Struktur eines Frage-Antwort-Systems auf mengentheoretischer Grundlage. GMD Bericht Nr. 55, Birlinghoven 1972

  11. Lum, V. Y.: Multi-attribute retrieval with combined indexes. Comm. ACM 13, 660–665 (1970)

    Google Scholar 

  12. Ray-Chaudhury, D. K.: Combinatorial information retrieval systems for files. SIAM J. Appl. Math. 16, 973–992 (1968)

    Google Scholar 

  13. Turski, W. M.: On a model of information retrieval systems based on thesaurus. Information Storage and Retrieval 7, 89–94 (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abteilung Informatik, Universität Dortmund, Postfach 500, D-4600, Dortmund-Hombruch, Bundesrepublik Deutschland

    H. -D. Ehrich

Authors
  1. H. -D. Ehrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ehrich, H.D. Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Acta Informatica 4, 299–310 (1975). https://doi.org/10.1007/BF00289613

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289613

Search

Navigation