Skip to main content
SpringerLink
Log in
Book cover

GI - 10. Jahrestagung pp 389–399Cite as

Towards Single Probe Retrieval

  • Conference paper

  • 97 Accesses

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 33))

Abstract

A short survey on minimization techniques for reducing the numbers of probes in open addressing schemes is given. Further, universal classes of hash functions (in the sense of Carter-Wegman) are discussed briefly. Finally, methods for constructing single probe retrieval functions are presented such as Sprugnoli’s, Cichelli’s and the author’s approach (Reciprocal Hashing). Investigations belong to the Information Management Research Project (AIM) at the IBM Scientific Center, Heidelberg

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
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Brent, R.P. Reducing the Retrieval Time of Scatter Storage Techniques, CACM 16, 2, Feb 1973, pp.105–109

    MathSciNet  MATH  Google Scholar 

  2. Lyon, G. Packed Scatter Tables, CACM 21,10, Oct 1978, pp.857–865

    MATH  Google Scholar 

  3. Rivest, R.L. (Optimal Arrangement of Keys in a Hash Table, JACM 25,2, April 1978, pp.200–209

    Article  MathSciNet  MATH  Google Scholar 

  4. Sprugnoli, R. Perfect Hashing Functions A Single Probe Retrieving Method for Static Sets, CACM 20,11, Nov 1977, pp.841–850

    MathSciNet  MATH  Google Scholar 

  5. Cichelli, R.J. Minimal Perfect Hash Functions Made Simple, CACM 23,1, Jan 1980, pp.17–19

    Google Scholar 

  6. Jaeschke, G. Minimal Perfect Hashing, TR 80.02.003, IBM Scientific Center, Heidelberg

    Google Scholar 

  7. Knuth, D.E. The Art of Computer Programming, 1968 vol.1–3, Addison-Wesley,Reading Mass., 1968–1973

    MATH  Google Scholar 

  8. Carter, J.L. and Wegman, M.N. Universal Classes of Hash Functions, Journal of Computer and Systems Sciences vol.18,2, April 1979, pp.143–154

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Scientific Center, Heidelberg, Germany

    G. Jaeschke

Authors
  1. G. Jaeschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich 10 - Angewandte Mathematik und Informatik, Universität des Saarlandes, 6600, Saarbrücken, Deutschland

    R. Wilhelm

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Jaeschke, G. (1980). Towards Single Probe Retrieval. In: Wilhelm, R. (eds) GI - 10. Jahrestagung. Informatik-Fachberichte, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-67838-7_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10388-2

  • Online ISBN: 978-3-642-67838-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation