Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10321197 | Data & Knowledge Engineering | 2011 | 24 Pages |
Abstract
Nowadays, location-related information is highly accessible to mobile users via issuing Location-Dependent Spatial Queries (LDSQs) with respect to their locations wirelessly to Location-Based Service (LBS) servers. Due to the limited mobile device battery energy, scarce wireless bandwidth, and heavy LBS server workload, the number of LDSQs submitted over wireless channels to LBS servers for evaluation should be minimized as appropriate. In this paper, we exploit query containment techniques for LDSQs (called LDSQ containment) to enable mobile clients to determine whether the result of a new LDSQ Qâ² is completely covered by that of another LDSQ Q previously answered by a server (denoted by Qâ²Â â Q) and to answer Qâ² locally if Qâ²Â â Q. Thus, many LDSQs can be reduced from server evaluation. To support LDSQ containment, we propose a notion of containment scope, which represents a spatial area corresponding to an LDSQ result wherein all semantically matched LDSQs are answerable with the result. Through a comprehensive simulation, our proposed approach significantly outperforms existing techniques.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Ken C.K. Lee, Brandon Unger, Baihua Zheng, Wang-Chien Lee,