Abstract
A data item, in the present context, is the most elementary building block of records and therefore a database. It can represent a conceptual object (e.g the edition number of a book) or a structural object (e.g an internal value, pointing to a book held by a reader and therefore linking entities READER and BOOK together). A data structure is an organised system of relationships among data items, structural objects and record types, the totality of which provides the means of mapping the logical schema onto an internal equivalent.
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.
References
Bachman, C. W., ‘Data Structure Diagrams’, Database, Vol. 1, No. 2, pp. 4–10, 1969.
Bayer, R. & McCreight, E. M., ‘Organisation and Maintenance of Large Ordered Indices’, Acta Informatica, Vol. 1, No. 3, pp. 173–189, 1972.
Chen, P. P., ‘The Entity-Relationship Model: Toward a Unified View of Data’, ACM TODS, Vol. 1, No. 1, pp. 9–36, 1976.
CODASYL, Report of the CODASYL Data Description Language Committee, Pergamon Press, 1978.
Codd, E. F., ‘A Relational Model of Data for Large Shared Databases’, CACM, Vol. 13, No. 6. pp. 377–387, 1970.
Codd, E. F. & Date, C. J., ‘Interactive Support for Non-Programmers: The Relational and Network Approaches’, In: Data Models: Structure Set vs. Relational’, Randall & Rustin (editors), Proc. ACM SIGMOD Workshop on Data Description, Access and Control, Vol. II, May 1974.
Comer, D., ‘The Ubiquitous B-tree’, Vol. I, 4th Edition, Addison-Wesley, 1986
Date, C. J. J., ‘An Introduction to Database Systems’, Vol. I, 4th Edition, Addison-Wesley, 1986.
Held, G. & Stonebraker, M., ‘B-trees Reexamined’, CACM, Vol. 21, No. 2, pp. 139–143, 1978.
Knuth, D., ‘The Art of Computer Programming: Sorting and Searching’, Vol. 3’, Addison-Wesley, 1973.
Kouvatsos, D. D. & Yannakoudakis, E. J., ‘A New Approach to the Design of Structured Bibliographic Records’, Information Technology: Research and Development, vol 1, No. 4, pp.
Navathe, S. B. & Fry, J. P., ‘Restructuring for Large Databases: Three Levels of Abstraction’, ACM TODS, Vol. 1, No. 2, pp. 138–158, 1976.
Olle, T. W. ‘Data Structures and Storage Structures for Generalised File Processing’, File Organisation Selected Papers from File-68 — An I. A. G. Conference, Swets & Zeitlinger N. V., pp. 310–315, 1969.
Senko, M. E., ‘Information Systems: Records, Relations, Sets, Entities, and Things’, Information Systems, Vol. 1, No. 1, pp. 1–13, 1975.
Sibley, E. H. (editor), ‘Special Issue on Database Management Systems’, ACM Computing Surveys, Vol. 8, No. 1, 1976.
Teorey, T. J. & Fry, J. P., ‘Design of Database Structures’, Prentice-Hall, 1982.
Tsichritzis, D. C. & Lochovsky, F. H., ‘Data Models’, Prentice-Hall, 1982.
Yannakoudakis, E. J., ‘Towards a Universal Record Identification and Retrieval Scheme’, J. of Informatics, Vol. 3, No. 1, pp. 7–11, 1979.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yannakoudakis, E.J. (1988). Data Structures and Data Models. In: The Architectural Logic of Database Systems. Springer, London. https://doi.org/10.1007/978-1-4471-1616-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-1616-5_3
Publisher Name: Springer, London
Print ISBN: 978-3-540-19513-9
Online ISBN: 978-1-4471-1616-5
eBook Packages: Springer Book Archive