Skip to main content
SpringerLink
Log in

Maintaining dictionaries in a hierarchical memory

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 520))

Abstract

Aggarwal, Chandra and Snir ([ACS87]) developed a model of hierarchical memory with block transfer. It is an extension of the common RAM-model, where access to location x takes time f(x) and copying of memory blocks is supported. We will specify this hierarchical memory model by assuming f to be a nondecreasing step function, which comes closer to real architectures of hierarchical memories. We propose a data structure for the dictionary problem and prove its optimality according to a modified measure of asymptotic complexity introduced in this paper.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, A.; Alpern, B.; Chandra, A.K.; Snir, M.: A Model for Hierarchical Memory.-Proc. 19th Annual ACM Symp. on Theory of Comp.; 305–314

    Google Scholar 

  2. Aggarwal, A.; Chandra, A.K.: Virtual Memory Algorithms.-Proc. 20th Annual ACM Symp. on Theory of Comp.; 173–185

    Google Scholar 

  3. Alpern, A.; Carter, L.; Feig, E.: Uniform Memory Hierarchies. Proc. 31th IEEE Symp. on Foundations of Comp. Science; 600–608

    Google Scholar 

  4. Aggarwal, A.; Chandra, A.K.; Snir, M.: Hierarchical Memory with Block Transfer.-Proc. 28th IEEE Symp. on Foundations of Comp. Science; 204–216

    Google Scholar 

  5. Aggarwal, A.; Vitter, J.: The I/O Complexity of Sorting and Related Problems.-Proc. 14th Int. Coll. on Automata, Languages and Programming.; 467–478

    Google Scholar 

  6. Floyd, R.W.: Permuting Information in Idealized Two-Level Storage.-In: Miller, R.E.; Thatcher, J.W. (editors): Complexity of Computer Computations. Plenum Press. New York 1972; 105–109

    Google Scholar 

  7. Leopold, C.: Schnelles Suchen in Speicherhierarchien. Diplomarbeit Humboldt-Universität zu Berlin

    Google Scholar 

  8. Leopold, C.: Reading Data in a Hierarchical Memory. EIK 4/91

    Google Scholar 

  9. Mehlhorn, K.: Data Structures and Algorithms. Vol. 1: Sorting and Searching. Berlin 1984

    Google Scholar 

  10. Vitter, J.S.; Shriver, E.A.M.: Optimal Disk I/O with Parallel Block Transfer.-Proc. 22th Symp. on Theory of Comp.; 159–169

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Humboldt-Universität zu Berlin, PO Box 1297, 0-1086, Berlin, Germany

    Claudia Leopold

Authors
  1. Claudia Leopold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leopold, C. (1991). Maintaining dictionaries in a hierarchical memory. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation