This paper proposes an efficient spatial index, named $AR^*$-tree(Area $R^*$-tree) which is a variant of the $R^*$-tree, for mobile software. A MBR(Minimum Bounding Rectangle) structure of the $AR^*$-tree has additional min and max values of area axis as well as x and y axes. The value of area axis is used to determine the significance of a spatial data. If area of a spatial data is large, then it is significant when drawing a map. To reduce complexity of a map on a small screen of mobile device, only significant spatial data can be found by the $AR^*$-tree. The result of a series of tests indicates that the $AR^*$-tree provides a method for control of readability of a map and guarantees an efficient performance at the same time.