Abstract
The combined query, which consists of the region and trajectory query, finds trajectories of moving objects which are located in a certain region. The trajectory query is a very informant factor to determine query performance because it processes a point query continuously to find predecessors. This results in bad performance due to revisiting nodes in an index. This paper suggests an efficient method for the combined query, based on the three-dimensional R-tree ,which has good performance of the region query. The basic idea is that we define the minimum common search line, which is enabled to search a single path, and a filtering method, based on prediction without revisiting nodes
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.
