• DocumentCode
    3255234
  • Title

    A simple perfect hashing method for static sets

  • Author

    Ramakrishna, M.V.

  • Author_Institution
    Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
  • fYear
    1992
  • fDate
    28-30 May 1992
  • Firstpage
    401
  • Lastpage
    404
  • Abstract
    Perfect hashing refers to hashing without collisions. There are a number of methods proposed in the literature for determining perfect hashing functions for a given key set. Direct perfect hashing methods are those which do not involve auxiliary table lookup. This paper proposes a direct perfect hashing method using random functions. This method is shown to be as good as any other in performance, and simple to use
  • Keywords
    file organisation; key set; random functions; simple perfect hashing method; static sets; Computer science; Data structures; Information retrieval; Sorting; Table lookup;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
  • Conference_Location
    Toronto, Ont.
  • Print_ISBN
    0-8186-2812-X
  • Type

    conf

  • DOI
    10.1109/ICCI.1992.227626
  • Filename
    227626
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3255234