Query Integrity Assurance of Location-Based Services Accessing Outsourced Spatial Databases
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Exploiting the wisdom of the crowd: localized, distributed information-centric VANETs
IEEE Communications Magazine
A hybrid communication solution to distributed moving query monitoring systems
Electronic Commerce Research and Applications
A linear broadcast indexing scheme in road environments with sensor networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Personalization of mobile value added services
Proceedings of the CUBE International Information Technology Conference
Efficient evaluation of skyline queries in wireless data broadcast environments
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Continuous range k-nearest neighbor queries in vehicular ad hoc networks
Journal of Systems and Software
Short communication: Location-based grid-index for spatial query processing
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the ever-increasing deployment and use of mobile technologies. We show that LBSQs have certain unique characteristics that traditional spatial query processing in centralized databases does not address. For example, a significant challenge is presented by wireless broadcasting environments, which have excellent scalability but often exhibit high-latency database access. In this paper, we present a novel query processing technique that, while maintaining high scalability and accuracy, manages to reduce the latency considerably in answering location-based spatial queries. Our approach is based on peer-topeer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We demonstrate the feasibility of our approach through a probabilistic analysis, and we illustrate the appeal of our technique through extensive simulation results.