loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
29th Annual International Computer Software and Applications Conference (COMPSAC'05) Volume 1
Tridirectional Computed Chaining: An Efficient Hashing Algorithm for Limited Space Applications
Edinburgh, Scotland
July 26-July 28
ISBN: 0-7695-2413-3
Mitchell Loeb, IBM Corporation
Alan L. Tharp, North Carolina State University
Hardware innovations such as motes, RFIDs, embedded microprocessors, and wireless sensors, have provided the foundation for a plethora of new applications for business, government, industry, and individuals. These applications include connected cities, smart homes and appliances, improved security and surveillance, smart vehicles, business integration, and e-commerce. Rarely does a user complain about a software system being too fast. Even though processor speeds have increased significantly, access times for external storage have lagged, causing performance bottlenecks. This paper presents a new hashing scheme, Tridirectional Computed Chaining, which is especially relevant for applications in which space may be limited but fast access is important. The performance enhancements result primarily from using a pseudolink field with three-way branching rather than one allowing only a linear chain.
Index Terms:
Hashing, External Memory, Embedded Systems, Real-time Systems, Sensor Systems, Computed Chaining
Citation:
Mitchell Loeb, Alan L. Tharp, "Tridirectional Computed Chaining: An Efficient Hashing Algorithm for Limited Space Applications," compsac, vol. 1, pp.381-387, 29th Annual International Computer Software and Applications Conference (COMPSAC'05) Volume 1, 2005
Usage of this product signifies your acceptance of the Terms of Use.