Zusammenfassung
Die Abbildung 1 zeigt wesentliche Bestandteile des Wegs vom Anwendungsfall bis zu den Daten in einer Datenbank.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literaturhinweise
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.
Bayer, R., und E. McCreight: Organization and Maintenance of Large Ordered Indexes, Acta Informatica, 1, 1972, 173–189.
Bayer, R.: Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms, Acta Informatica 1, 1972, 290–306.
EXEC 8 Coding.
Foster, C.C.: Information Storage and Retrieval using AVL-trees, Proc. ACM Natl. Conf. 1965, 192–205.
Honeywell Bull: Multi-Access-IDS-Implementation Guide, Ref.: 19.31.401.A, Januar 1972.
Honeywell Bull: Integrated Data Store, Ref.: 19.30.218.A, 1972.
IBM: OS/VS DASD Data Management, ZR 20–4383-2.
Morris: Scatter Storage Techniques, CACM 11, 1968, 38–44.
Stone, H.S.: Introduction to Computer Organization and Data Structures, McGraw-Hill, 1972, Kap. 11.
UNIVAC: EXEC 8 Reference Manuel.
Wedekind, H.: Standardization of access path structures, German Chapter ACM, Lectures II-1974, 51–76.
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Niedereichholz, J. (1976). Änderungsfunktionen bei Datenbanken. In: Noltemeier, H. (eds) Computergestützte Planungssysteme. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-41562-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-41562-7_12
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0170-5
Online ISBN: 978-3-662-41562-7
eBook Packages: Springer Book Archive