Skip to main content
SpringerLink
Log in
Book cover

Datenstrukturen und Algorithmen pp 267–286Cite as

Externes Suchen und Sortieren

  • Chapter

  • 63 Accesses

Part of the book series: Leitfäden und Monographien der Informatik ((LMI))

Zusammenfassung

Wir haben bisher stillschweigend angenommen, daß beliebig komplexe Datenstrukturen bzw. alle von einem Algorithmus benötigten Daten komplett im Hauptspeicher gehalten werden können.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturhinweise

  • Bayer, R., und E.M. McCreight [ 1972 ]. Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1, 173–189.

    Article  Google Scholar 

  • Ghosh, S., und M. Senko [ 1969 ]. File Organization: On the Selection of Random Access Index Points for Sequential Files. Journal of the ACM 16, 569–579.

    Article  MATH  Google Scholar 

  • Nakamura, T., und T. Mizzogushi [1978]. An Analysis of Storage Utilization Factor in Block Split Data Structuring Scheme. Proceedings of the 4th Intl. Conference on Very Large Data Bases, 489–495.

    Google Scholar 

  • Yao, A.C. [ 1985 ]. On Random 2–3 Trees. Acta Informatica 9, 159–170.

    Article  Google Scholar 

  • Culik, K., T. Ottmann und D. Wood [ 1981 ]. Dense Multiway Trees. ACM Transactions on Database Systems 6, 486–512.

    Article  MathSciNet  MATH  Google Scholar 

  • Wedekind, H. [ 1974 ]. On the Selection of Access Paths in a Data Base System. In: J.W. Klimbie und K.L. Koffeman (eds.), Data Base Management. North-Holland Publishing Co., Amsterdam.

    Google Scholar 

  • Bayer, R., und K. Unterauer [ 1977 ]. Prefix-B-Trees. ACM Transactions on Database Systems 2, 11–26.

    Article  Google Scholar 

  • Küspert, K. [ 1983 ]. Storage Utilization in B*-Trees With a Generalized Overflow Technique. Acta Informatica 19, 35–55.

    Article  MathSciNet  MATH  Google Scholar 

  • Wagner, R.E. [ 1973 ]. Indexing Design Considerations. IBM Systems Journal 12, 351–367.

    Article  MATH  Google Scholar 

  • Lockemann, P.C., und J.W. Schmidt (Hrsg.) [ 1987 ]. Datenbank-Handbuch. Springer-Verlag, Berlin.

    MATH  Google Scholar 

  • Comer, D. [ 1979 ]. The Ubiquitous B-Tree. ACM Computing Surveys 11, 121–137.

    Article  MATH  Google Scholar 

  • Knuth, D.E. [ 1973 ]. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Massachusetts.

    Google Scholar 

  • Shell, D.L. [ 1971 ]. Optimizing the Polyphase Sort. Communications of the ACM 14, 713–719.

    Article  Google Scholar 

  • Six, H.W., und L. Wegner [ 1981 ]. EXQUISIT: Applying Quicksort to External Files. Proceedings of the 19th Annual Allerton Conference on Communication, Control, and Computing, 348–354.

    Google Scholar 

  • Salzberg, B. [ 1989 ]. Merging Sorted Runs Using Large Main Memory. Acta Informatica 27, 195–215.

    Article  MathSciNet  MATH  Google Scholar 

  • Salzberg, B., A. Tsukerman, J. Gray, M. Stewart, S. Uren und B. Vaughan [ 1990 ]. FastSort: A Distributed Single-Input Single-Output External Sort. Proceedings of the ACM SIGMOD Intl. Conference on Management of Data, Atlantic City, NJ, 94–101.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FernUniversität Hagen, Deutschland

    Prof. Dr. rer. nat. Ralf Hartmut Güting

Authors
  1. Prof. Dr. rer. nat. Ralf Hartmut Güting
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1992 B. G. Teubner Stuttgart

About this chapter

Cite this chapter

Güting, R.H. (1992). Externes Suchen und Sortieren. In: Datenstrukturen und Algorithmen. Leitfäden und Monographien der Informatik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-92105-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-92105-5_8

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-519-02121-6

  • Online ISBN: 978-3-322-92105-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation