With advances in location-based services, indexing the need for storing and processing continuously moving data arises in a wide variety of applications. Some traditional spatial index structures are not suitable for storing these moving positions because of their unbalance structure. Searching an unbalanced tree may require traversing an arbitrary and unpredictable number of nodes and pointers. Presorting before tree structure is one of the ways of building a balanced two dimensional tree. In this paper, we proposed Presort Range tree that is suitable for moving objects with the dynamic range query. Moreover, with extending mobile technology, tracking the changing position of devices becomes a new challenge. The current location of each user would always be known at the server side whereas it would create a problem. If the mobile movements are small and frequent, at that time unnecessary updates would be performed at the server. In this paper, we also proposed Hybrid Update Algorithm to reduce the server update cost greatly
