An efficient information access scheme for mobile objects

Recently moving object databases have attracted a lot of attention due to rapid technological developments in location aware systems used in a variety of applications such as vehicle navigation devices, air traffic monitoring systems and more. The most important issue in moving object databases is indexing, using existing indexing methods on continuously changing data will lead to serious performance overhead due to the fact that the index structure should be updated frequently and constantly which is clearly not an appropriate solution. Therefore new methods must be employed in moving object databases to address the indexing issue. This paper introduces Delineated R-tree (DR-tree) indexing structure which has performance advantages over other R-tree based indexing methods. DR-tree is a highly balanced tree, and the nodes common property is based on the principle of recursive decomposition of space without any overlap.