Comparative Analysis of Proposed POBBx-Index Structure

In this paper the proposed work is compared with the existing index methods like BBxindex and OBBx index structure. This paper proposes the new index structure called POBBx (Parameterized Optimal BBx) which indexes the positions of moving objects, given as linear functions of time, at any time. The index supports queries that select objects based on temporal and spatial constraints, such as queries that retrieve all objects whose positions fall within a spatial range during a set of time intervals. The proposed work reduces lot of searching efforts done by the existing methods and minimized time complexity. The simulation results shows that the proposed algorithm provides better performance than BBxindex and OBBx index structure