Data Structures and Data Models

  • E. J. Yannakoudakis


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.


Data Model Database System Data Item Structural Object Logical Schema 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bachman, C. W., ‘Data Structure Diagrams’, Database, Vol. 1, No. 2, pp. 4–10, 1969.Google Scholar
  2. Bayer, R. & McCreight, E. M., ‘Organisation and Maintenance of Large Ordered Indices’, Acta Informatica, Vol. 1, No. 3, pp. 173–189, 1972.Google Scholar
  3. Chen, P. P., ‘The Entity-Relationship Model: Toward a Unified View of Data’, ACM TODS, Vol. 1, No. 1, pp. 9–36, 1976.Google Scholar
  4. CODASYL, Report of the CODASYL Data Description Language Committee, Pergamon Press, 1978.Google Scholar
  5. Codd, E. F., ‘A Relational Model of Data for Large Shared Databases’, CACM, Vol. 13, No. 6. pp. 377–387, 1970.MATHGoogle Scholar
  6. 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.Google Scholar
  7. Comer, D., ‘The Ubiquitous B-tree’, Vol. I, 4th Edition, Addison-Wesley, 1986Google Scholar
  8. Date, C. J. J., ‘An Introduction to Database Systems’, Vol. I, 4th Edition, Addison-Wesley, 1986.Google Scholar
  9. Held, G. & Stonebraker, M., ‘B-trees Reexamined’, CACM, Vol. 21, No. 2, pp. 139–143, 1978.MATHGoogle Scholar
  10. Knuth, D., ‘The Art of Computer Programming: Sorting and Searching’, Vol. 3’, Addison-Wesley, 1973.Google Scholar
  11. 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.Google Scholar
  12. Navathe, S. B. & Fry, J. P., ‘Restructuring for Large Databases: Three Levels of Abstraction’, ACM TODS, Vol. 1, No. 2, pp. 138–158, 1976.CrossRefGoogle Scholar
  13. 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.Google Scholar
  14. Senko, M. E., ‘Information Systems: Records, Relations, Sets, Entities, and Things’, Information Systems, Vol. 1, No. 1, pp. 1–13, 1975.CrossRefGoogle Scholar
  15. Sibley, E. H. (editor), ‘Special Issue on Database Management Systems’, ACM Computing Surveys, Vol. 8, No. 1, 1976.Google Scholar
  16. Teorey, T. J. & Fry, J. P., ‘Design of Database Structures’, Prentice-Hall, 1982.MATHGoogle Scholar
  17. Tsichritzis, D. C. & Lochovsky, F. H., ‘Data Models’, Prentice-Hall, 1982.Google Scholar
  18. Yannakoudakis, E. J., ‘Towards a Universal Record Identification and Retrieval Scheme’, J. of Informatics, Vol. 3, No. 1, pp. 7–11, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • E. J. Yannakoudakis
    • 1
  1. 1.Postgraduate School of Computer SciencesUniversity of BradfordBradford, West YorkshireUK

Personalised recommendations