Mobile Location Based Indexing for Range Searching

Abstract

There had been numerous uses based on two dimensional indexing techniques in recent years. Such uses were generally intended to static data or no moving object data. Today indexing is essential for both static and dynamic data with advances in location services. It is not difficult to store and process for both of them but it need to be consistent for update between arbitrary and unpredictable number of moving object nodes and index structure. For this reason, this paper proposed moving object index structure based on presort range tree that will store moving locations conveniently. In this case, synthetic dataset is needed to generate accessing for several of moving location data. Therefore, this paper also proposed a procedure to generate a synthetic dataset that is the creation of dynamic two dimensional points. Besides, there is a comparison between different indexing techniques such as presort range tree and kd tree along with performance evaluation of tree construction and range searching over moving objects. Moreover, distance based range searching is added to compare between two of indexing.