Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Semantic Data Broadcast for a Mobile Environment Based on Dynamic and Adaptive Chunking
IEEE Transactions on Computers
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Semantic Caching in Location-Dependent Query Processing
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Valid scope computation for location-dependent spatial query in mobile broadcast environments
Proceedings of the 17th ACM conference on Information and knowledge management
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Hi-index | 0.00 |
In mobile and wireless environments, mobile clients can access information with respect to their locations by submitting Location-Dependent Spatial Queries (LDSQs) to Location-Based Service (LBS) servers. Owing to scarce wireless channel bandwidth and limited client battery life, frequent LDSQ submission from clients must be avoided. Observing that LDSQs issued from similar client positions would normally return the same results, we explore the idea of valid scope, that represents a spatial area in which a set of LDSQs will retrieve exactly the same query results. With a valid scope derived and an LDSQ result cached at the client side, a client can assert whether the new LDSQs can be answered with the maintained LDSQ result, thus eliminating the LDSQs sent to the server. As such, contention on wireless channel and client energy consumed for data transmission can be considerably reduced. In this paper, we design efficient algorithms to compute the valid scope for common types of LDSQs, including nearest neighbor queries and range queries. Through an extensive set of experiments, our proposed valid scope computation algorithms are shown to significantly outperform existing approaches.