Page ordering is to define the order of pages in one-dimensional storage for storing two-dimensional spatial data to reduce the number of disk seeks. Previous works relating to page ordering have only used the space filling curves, especially the Hilbert curves. Page ordering based on the space filling curves does not take into account the uneven distribution of spatial data and the types of spatial queries. In this paper, we develop a cost model to be used for defining the problem of page ordering based on performance measurement and then find out the optimal page ordering based on the cost model for processing region queries in static databases. The experimental results show that the newly proposed ordering method can achieve considerable improvement over the previous ordering methods.