Publication Type

Journal Article

Version

acceptedVersion

Publication Date

10-2011

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

Location-Dependent Spatial Query, Query containment, Containment scope

Discipline

Computer Sciences | Databases and Information Systems | Numerical Analysis and Scientific Computing

Research Areas

Data Science and Engineering

Publication

Data and Knowledge Engineering

Volume

70

Issue

10

First Page

842

Last Page

865

ISSN

0169-023X

Identifier

10.1016/j.datak.2011.06.001

Publisher

Elsevier

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1016/j.datak.2011.06.001

Download

Share

COinS