Abstract
Supporting high update throughput is important to provide real-time location information for many applications, which involve moving objects, such as security, military, and environmental monitoring. We present an R-tree-based index structure with a family of update strategies for supporting high update throughput. It groups updates in the update buffer, and bulk-applies them into the R-tree. Extensive empirical studies have shown that it outperforms existing techniques by 2–5 times. In our experimental environment, moreover, it is able to provide the real-time update capability, while its competitors fail to do so.
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.
