Abstract
Temporal and Spatial database of moving objects on fixed network involves frequent updates. Information on query about the historical, present and future positions of moving objects is still limited. The current study propose a new index model (RRH) based on R*- tree, R-tree and Hash table. The R*-Tree is used to index the spatial data of the network. The R Tree forest is employed to index the time intervals. A composite hash table and link list storage structure is used to queries retrieve based on trajectory. The exponential smoothing algorithm is applied to forecast position/speed of the moving objects for a given time. The analysis results show that the proposed model has higher efficiency position prediction.
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.
