Indian Journal of Science and Technology

Abstract

Location management systems require multi-dimensional access methods to allow efficient handling of spatial queries. Because there is no total ordering of locations that preserves the spatial locality between objects, it is difficult to design multi-dimensional access method in the way as traditional one-dimensional access methods. However, mapping multidimensional data into a single dimension makes it possible to answer these queries in an efficient way. Space filling curves are used to connect all the points on a plane. Hilbert curve preserves locality than any other space filling curves. Hilbert curve is used for sequencing the points in a plane and use the order for storage. This paper discusses the efficient way of calculating the mapping from two dimensional planes to integer line or real line and the vice versa. The time complexity for encoding and decoding using the proposed algorithm is less compared with existing algorithm. The memory requirement is almost constant compared to state machine approach. This algorithm can be used for storing spatial data in efficient way so that the access time becomes minimal.

Keywords: Efficient Storage Management, Hilbert Curve, Indexing, Spatial Data Structure