Abstract

The ubiquity of geo-positioning technologies stimulates continuous growth in dynamic spatial datasets that fuels the development of location-based services. These services require tracking and querying a large population of moving objects. High workloads of users’ requests, both location updates and queries, need to be processed concurrently. Current solutions employ an index that is updated incrementally or rebuilt from scratch periodically. Due to the concurrency of updates and queries, current solutions still suffer from query staleness. In this paper, we present swapQt, a novel in-memory cloud-based approach for indexing dynamic spatial data that efficiently processes updates and answers queries. SwapQt consists of two main components, a routing index and local indexes. The routing index maintains the addresses of all the cloud nodes in the system and the boundaries of the data in each cloud node. Two local indexes, one to process updates and another to answer queries, are maintained and swapped periodically in each cloud node to eliminate interference between incoming updates and queries. swapQt outperformed the state-of-the-art approaches in terms of speedup and query staleness. For a workload of 1 million updates, the query staleness in swapQt was around 0.22 s compared to 4.3 s for the state-of-the-art approach. All the experiments were conducted on Microsoft Azure Cloud Computing Platform to provide realistic experimental settings.

Full Text
Paper version not known

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 call

Disclaimer: 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.