Advertisement

Änderungsfunktionen bei Datenbanken

  • J. Niedereichholz

Zusammenfassung

Die Abbildung 1 zeigt wesentliche Bestandteile des Wegs vom Anwendungsfall bis zu den Daten in einer Datenbank.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturhinweise

  1. [1]
    Adel’son- Vel’skii, G.M., und EM. Landis: An Algorithm for the Organization of information, Dokl. Akad. Nauk. SSSR, Mathemat. 146 (2), 1962, 263–266.Google Scholar
  2. [2]
    Bayer, R., und E. McCreight: Organization and Maintenance of Large Ordered Indexes, Acta Informatica, 1, 1972, 173–189.CrossRefGoogle Scholar
  3. [3]
    Bayer, R.: Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms, Acta Informatica 1, 1972, 290–306.CrossRefMATHMathSciNetGoogle Scholar
  4. [4]
    EXEC 8 Coding.Google Scholar
  5. [5]
    Foster, C.C.: Information Storage and Retrieval using AVL-trees, Proc. ACM Natl. Conf. 1965, 192–205.Google Scholar
  6. [6]
    Honeywell Bull: Multi-Access-IDS-Implementation Guide, Ref.: 19.31.401.A, Januar 1972.Google Scholar
  7. [7]
    Honeywell Bull: Integrated Data Store, Ref.: 19.30.218.A, 1972.Google Scholar
  8. [8]
    IBM: OS/VS DASD Data Management, ZR 20–4383-2.Google Scholar
  9. [9]
    Morris: Scatter Storage Techniques, CACM 11, 1968, 38–44.CrossRefGoogle Scholar
  10. [10]
    Stone, H.S.: Introduction to Computer Organization and Data Structures, McGraw-Hill, 1972, Kap. 11.Google Scholar
  11. [11]
    UNIVAC: EXEC 8 Reference Manuel.Google Scholar
  12. [12]
    Wedekind, H.: Standardization of access path structures, German Chapter ACM, Lectures II-1974, 51–76.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • J. Niedereichholz

There are no affiliations available

Personalised recommendations