• DocumentCode
    2346296
  • Title

    Gray Code Chaining: A High Performance Hashing Algorithm for Limited Storage Applications

  • Author

    Loeb, Mitchell ; Tharp, Alan L.

  • Author_Institution
    IBM Corp., Research Triangle Park, NC
  • fYear
    2007
  • fDate
    2-4 April 2007
  • Firstpage
    1014
  • Lastpage
    1014
  • Abstract
    Hardware continues to evolve which implies that software and the data structures contained therein must also. Motes, RFIDs, and embedded system s are examples of hardware which require updated software and storage structures because of limited amounts of storage. Even though processor speeds have increased significantly recently, access times for external storage have lagged. This paper introduces gray code chaining, a hashing scheme which provides the best retrieval performance to date when storage is limited. In fact, the performance approaches the theoretical limit but uses only 40% of the storage otherwise needed for the link fields. Unlike other methods, its retrieval performance actually improves as the file size increases. The method is also easier to implement than previous chaining methods
  • Keywords
    Gray codes; storage management; data structures; gray code chaining; high performance hashing algorithm; limited storage applications; Application software; Computer science; Data structures; Embedded computing; Embedded system; Hardware; Probes; Radiofrequency identification; Reflective binary codes; Sensor systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology, 2007. ITNG '07. Fourth International Conference on
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    0-7695-2776-0
  • Type

    conf

  • DOI
    10.1109/ITNG.2007.99
  • Filename
    4151837