International Journal of Innovative Research and Development

Abstract

For querying large amounts of moving objects, a key problem is to create efficient indexing structures that make it possible to effectively answer various types of queries. Traditional spatial indexing approaches cannot be used because the locations of moving objects are highly dynamic, which go ahead to frequent updates of index structures, which in turn will cause huge expenditure. In earlier researches states that the functional approaches to manage moving objects in Euclidean spaces. In this paper, to describe the techniques that effectively indexing the positions of moving objects in spatial networks and supports the heavy update loads. Not only that and also increases the efficiency of the query extraction. The performance study, comparing this indexing method with FNR-Tree, MON-Tree, and TPR-Tree, shows that ANR-Tree outperforms them.

Keywords

Full Text