A New Proposed Algorithm for OBBx-index Structure

Abstract

Even if major effort has been put into the development of capable spatio-temporal indexing techniques for moving objects, some more mind has been given to the advance of techniques that professionally support queries about the past, present, and future positions of moving objects. The specification of such techniques is difficult, by the nature of the data, which reflects continuous movement, and because of the types of queries to be supported. This paper proposes the new index structure called OBB (Optimized BB) which indexes the positions of moving objects, given as linear functions of time, at any time. The index stores linearized moving-object locations in a minimum of B+-trees. 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 efforts done by the existing method and minimized time complexity. The simulation results shows that the proposed algorithm provides better performance than BB index structure.