2009 IEEE International Conference on
Systems, Man, and Cybernetics |
![]() |
Abstract
For efficient retrieval to data, the data structures are used. Tree structure and hashing are major techniques of them. Hashing is simple structure and hash system can retrieves with good response time for partial match query. But for range query, hash system maybe needs to search to many data blocks. Then, hashing technique has the disadvantage for range query. In this paper, in order to overcome to this problem, the order-preserved linear hashing is proposed. This hashing technique is the linear hashing which use special hash function to efficient retrieval for range queries. By comparing this new hashing with traditional linear hashing, good retrieval time for range query is proved.