A distributed linear hashing enabling efficient retrieval for range queries

For efficient retrieval of data, the design of the data structuring is important. Tree structures and hash tables are popular data structures. A hash table is a simple data structure and it can be retrieved very fast for an exact match query. But for a range query, the hashing scheme is necessary to search much more data blocks than other data structures. Order-preserving linear hashing is one of the solutions for this problem. Its hash function is a combination of division function and bit reversal function. By using this kind of hashing, the nearest data can be stored on the same data block in many cases as the tree structure and good performance for a range query is expected. In this paper, we estimate the performance of the order-preserving linear hashing on distributed environment. The experimental results show that the proposed scheme provides better results than the traditional distributed linear hashing.