Skip to main content
SpringerLink
Log in

Choosing a storage schema

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In using a general-purpose language such as PL/I, a data base management system such as IMS, or a special-purpose language such as SNOBOL, program designers must decide on strategies for storing their data. This paper contains a description of an algorithm for choosing suitable data linking methods from a class of available storage schemata. Emphasis is placed on specifying the types of parameters which are involved in this choice, such as the volatility of the data, the density of the keys, and the amount of storage available.

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

References

  1. Adelson-Velskii, G. M., Landis, E. M.: An information organization algorithm. Doklady Akademii Nauk SSSR 146, 263–266 (1962) (Russian); Soviet Math. Dokl. 3, 1259–1267 (1962) (English)

    Google Scholar 

  2. Balzer, R. M.: Dataless programming. Proc. AFIPS 1967 FJCC 31, p. 535–544

  3. Bayer, R., McCreight, E. M.: Organization and maintenance of large ordered indices. Acta Informatica 1, 173–189 (1972)

    Google Scholar 

  4. Cardenas, A. F.: Evaluation and selection of file organization—a model and system. Comm. ACM 16, 540–548 (1973)

    Google Scholar 

  5. Childs, D. L.: Description of a set-theoretic data structure. Proc. AFIPS 1968 FJCC 33, p. 557–564

  6. Codd, E. F.: A relational model of data for large shared data banks. Comm. ACM 13, 377–387 (1970)

    Google Scholar 

  7. D'Imperio, M.: Data structures and their representations in storage. Annual Review in Automatic Programming 5, 1–75 (1969)

    Google Scholar 

  8. Earley, J.: Toward an understanding of data structures. Comm. ACM 14, 617–627 (1971)

    Google Scholar 

  9. Foster, C. C.: Information storage and retrieval using AVL trees. Proc. 20th Nat'l. Conf. ACM, Cleveland (Ohio) 1965, p. 192–205

    Google Scholar 

  10. Gotlieb, C. C.: Data types and structures: a synthetic approach. University of Toronto, Department of Computer Science, Tech. Rep. 61, 1974

  11. Harary, F.: Graph theory. Reading (Mass.): Addison-Wesley 1969

    Google Scholar 

  12. Hoare, C. A. R.: Notes on data structuring. In: Dahl, O.-J., Dijkstra, E. W., Hoare, C. A. R.: Structured Programming. London-New York (N.Y.): Academic Press 1972, p. 83–174

    Google Scholar 

  13. Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Stanford University, Department of Computer Science, Tech. Rep. CS-71-207, March 1971

  14. Ichbiah, J. D., Rissen, J. P., Heliard, J. C.: The two-level approach to data description and space management in the LIS system implementation language. Proc. IFIP TC-2 Conf. on Machine-oriented High-level Languages, 1973

  15. McGee, W. C.: Informal definitions for the development of a storage structure definition language. Proc. 1970 ACM SICFIDET Workshop on Data Description and Access, April 1971, p. 338–353

  16. Morris, R.: Scatter storage techniques. Comm. ACM 11, 38–44 (1968)

    Google Scholar 

  17. Nievergelt, J., Reingold, E. M.: Binary search trees of bounded balance. Proc. 4th Annual ACM Symposium on the Theory of Computing, Denver (Col.) 1972, p. 137–142

  18. Perlis, A. J., Thornton, C.: Symbol manipulation by threaded lists. Comm. ACM 3, 195–204 (1960)

    Google Scholar 

  19. Randall, L. S.: A relational model for data for the determination of optimum computer storage structures. SEL, Tech. Rep. 54, RADC-TR-72-25, 1972

  20. Report of the CODASYL Systems Committee: Feature analysis of generalized data base management systems. New York (N.Y.): Assoc. Comp. Mach. 1971

  21. Roberts, L. G.: Graphical communications and control languages. 2nd Congress on Information Systems Sciences. Washington (D.C.): Spartan 1964

    Google Scholar 

  22. Ross, D. T.: Uniform referents: An essential property for a software engineering language. In: Tou, J. T. (ed.): Software Engineering 1. London-New York (N.Y.) : Academic Press 1970, p. 91–101

  23. Senko, M. E., Altman, E. B., Astrahan, M. M., Fehder, P. L.: Data structures and accessing in data base systems. IBM Systems J. 12, 30–93 (1973)

    Google Scholar 

  24. Severance, D. G., Merten, A. G.: Performance evaluation of file organizations through modeling. Proc. 27th Nat'l Conf. ACM, 1972, p. 1061–1072

  25. Tompa, F. W.: Choosing a storage schema. University of Toronto, Department of Computer Science (thesis to appear)

  26. Tompa, F. W.: The run-time cost for storage schemata. University of Toronto, Department of Computer Science, Internal report (submitted for publication, 1974)

  27. Windley, P. F.: Trees, forests, and rearranging. Computer J. 3, 84–88 (1960)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Toronto, M5S 1A7, Toronto, Ontario, Canada

    C. C. Gotlieb & Frank W. Tompa

Authors
  1. C. C. Gotlieb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank W. Tompa
    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

Gotlieb, C.C., Tompa, F.W. Choosing a storage schema. Acta Informatica 3, 297–319 (1974). https://doi.org/10.1007/BF00263586

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation