Ordering a set of multi-dimensional data is an essential task in modern spatial data processing systems such as raster geographical information systems. This can effectively be carried out by a transformation called spatial ordering. It has been reported that the H ilbert order exhibits desirable performance. However, its encoding or decoding process in the n -dimensional space (n 3) is complicated and would place a considerable computational burden on the application problems. In this paper, we propose a new spatial order with efficient algorithms. The performance evaluation suggests that this new order is competitive with the Hilbert order.