Skip to main content
Springer Nature Link
Log in

Data encodings and their costs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This paper is devoted to developing and studying a precise notion of the “encoding” of a “logical data structure” in a “physical storage structure,” that is motivated by considerations of computational efficiency. The development builds upon the notion of an encoding of one graph in another. The cost of such an encoding is then defined so as to reflect the structural compatibility of the two graphs, the (externally specified) costs of “implementing” the host graph, and the (externally specified) set of intended “usage patterns” of the guest graph. The stability of the constructed framework is demonstrated in terms of a number of results; the faithfulness of the formalism is argued in terms of a number of examples from the literature; and the tractability of the model is hinted at by several results and by further references to the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Cook, S.A.: The complexity of theorem-proving procedures. Proc. 3rd ACM Symp. on Theory of Computing, 1970, pp. 151–158

  2. DeMillo, R.A., Eisenstat, S.C., Lipton, R.E.: Preserving average proximity in arrays. Comm. ACM (to appear)

  3. Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Real-time simulation of multihead tape units. J. Assoc. Comput. Mach. 19, 590–607 (1972)

    Google Scholar 

  4. Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity results for bandwidth minimization. Unpublished typescript, 1977

  5. Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237–267 (1976)

    Google Scholar 

  6. Gotlieb, C.C., Tompa, F.W.: Choosing a storage schema. Acta Informat. 3, 297–319 (1974)

    Google Scholar 

  7. Hardy, G.H., Littlewood, J.E., Pólya, G.: Inequalities. Cambridge Univ. Press 1967

  8. Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Indust. Appl. Math. 12, 131–135 (1964)

    Google Scholar 

  9. Harper, L.H.: Optimal numberings and isoperimetric problems. J. Combinatorial Theory 1, 385–393 (1966)

    Google Scholar 

  10. Hennie, F.C.: One-tape, off-line Turing machine computations. Information and Control 8, 553–578 (1965)

    Google Scholar 

  11. Iordansk'ii, M.A.: Minimalnye numeratsii vershin derevyev [in Russian]. Problemy Kibernet. 31, 109–132 (1976)

    Google Scholar 

  12. Knuth, D.E.: The art of computer programming. I. Fundamental algorithms. Reading, MA: Addison-Wesley 1968

    Google Scholar 

  13. Knuth, D.E.: The art of computer programming. III. Sorting and searching. Reading, MA: Addison-Wesley 1973

    Google Scholar 

  14. Lipton, R.E., Eisenstat, S.C., DeMillo, R.A.: Space and time hierarchies for classes of control structures and data structures. J. Assoc. Comput. Mach. 23, 720–732 (1976)

    Google Scholar 

  15. Papadimitriou, Ch. H.: The NP-completeness of the bandwidth minimization problem. Computing 16, 263–270 (1976)

    Google Scholar 

  16. Pippenger, N., Fischer, M.J.: Relations among complexity measures. IBM Report RC-6569, 1977

  17. Pfaltz, J.L.: Representing graphs by Knuth trees. J. Assoc. Comput. Mach. 22, 361–366 (1975)

    Google Scholar 

  18. Rosenberg, A.L.: Preserving proximity in arrays. SIAM J. Comput. 4, 443–460 (1975)

    Google Scholar 

  19. Rosenberg, A.L.: Storage mappings for extendible arrays. IBM Report RC-5798, 1976. In: Current trends in programming methodology. IV. Data structuring (R.T. Yeh, ed.). Englewood Cliffs, NJ: Prentice-Hall (to appear)

    Google Scholar 

  20. Rosenberg, A.L., Snyder, L.: Bounds on the costs of data encodings. Math. Systems theory (to appear)

  21. Scheuermann, P., Heller, J.: A view of logical data organization and its mapping to physical storage. Proc. 3rd Texas Conf. on Computing Systems, 1974

  22. Sekanina, M.: On an ordering of the set of vertices of a connected graph. Publ. Fac. Sci. Univ. Brno, No. 412, 137–142 (1960)

  23. Sheidvasser, M.A.: O dline i shirine razmeshchenii grafov v reshetkakh [in Russian]. Problemy Kibernet. 29, 63–102 (1974)

    Google Scholar 

  24. Shneiderman, B., Shapiro, S.C.: Toward a theory of encoded data structures and data translation. Internat. J. Comput. Information Sci. 5, 33–43 (1976)

    Google Scholar 

  25. Standish, T.A.: Data structures — an axiomatic approach. In: Current trends in programming methodology. IV. Data structuring (R.T. Yeh, ed.). Englewood Cliffs, NJ: Prentice-Hall (to appear)

Download references

Author information

Authors and Affiliations

  1. Mathematical Sciences Department, IBM Thomas J. Watson Research Center, 10598, Yorktown Heights, NY, USA

    Arnold L. Rosenberg

Authors
  1. Arnold L. Rosenberg
    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

Rosenberg, A.L. Data encodings and their costs. Acta Informatica 9, 273–292 (1978). https://doi.org/10.1007/BF00288886

Download citation

  • Received:

  • Issue Date:

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

Keywords