2009 33rd Annual IEEE International Computer Software and Applications Conference (2009)
Seattle, Washington, USA
July 20, 2009 to July 24, 2009
Hardware innovations such as motes, RFIDs, embedded microprocessors, and wireless sensors have introduced a new set of wide-ranging applications for business, government, industry, and individuals. These applications include connected cities, smart homes and appliances, smart vehicles, improved security and surveillance, business integration and e-commerce to name a few. The real-time nature of these applications requires direct access to data and minimal response time from underlying hardware systems. This paper presents a new hashing method, Shift Hashing, which is an improvement over existing hashing schemes such as Tridirectional Computed Chaining, which reduce the direct access time by providing multi-way branching of individual probe chains. What is distinctive about Shift Hashing is that it not only allows faster access to data in most cases, but also eliminates the space requirement for storing links completely. There is no time-space tradeoff. Hence the method is suitable for applications in which space is quite limited and fast and real-time access is important. It is simple, easy to implement and its generality makes it very flexible to use. Storage efficiency is achieved by incorporating a link field in the key of the record by using bit shifting methods. The concept of using shifting to compute data rather than storing it may be applicable to other situations as well.
Hashing, Embedded Systems, Real-time Systems, Tridirectional Computed Chaining, Bit Shifting, Data Access Methods, Minimal Response Time
A. L. Tharp and S. Deodhar, "Shift Hashing for Memory-Constrained Applications," 2009 33rd Annual IEEE International Computer Software and Applications Conference(COMPSAC), Seattle, Washington, USA, 2009, pp. 531-536.