Abstract
Although lot of spatio-temporal indexing techniques for moving objects are availed, some more intelligence has been given to the advance of techniques that competently support queries about the past, present, and future positions of moving objects. This paper proposes the new index structure called SOBBx (Space Based Optimal BBx) which indexes the positions of moving objects, given as linear functions of time, at any time. In a Time t, more objects are updated to the tree than usual. It saves the cost of regular update as well. The simulation results shows that the proposed algorithm provides superior performance than POBBx index structure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
