loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Information Technology (ITNG'07)
Gray Code Chaining: A High Performance Hashing Algorithm for Limited Storage Applications
Las Vegas, Nevada, USA
April 02-April 04
ISBN: 0-7695-2776-0
Mitchell Loeb, IBM Corporation
Alan L. Tharp, North Carolina State University
Hardware continues to evolve which implies that software and the data structures contained therein must also. Motes, RFIDs, and embedded systems 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.
Citation:
Mitchell Loeb, Alan L. Tharp, "Gray Code Chaining: A High Performance Hashing Algorithm for Limited Storage Applications," itng, pp.1014, International Conference on Information Technology (ITNG'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.