Location-dependent spatial query containment

Ken C.K. Lee, Brandon Unger, Baihua Zheng, Wang-chien Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)842-865
Number of pages24
JournalData and Knowledge Engineering
Volume70
Issue number10
DOIs
StatePublished - Oct 1 2011

Fingerprint

Query
Location-based services
Evaluation
Bandwidth
Simulation
Workload
Energy
Mobile devices

All Science Journal Classification (ASJC) codes

  • Information Systems and Management

Cite this

Lee, Ken C.K. ; Unger, Brandon ; Zheng, Baihua ; Lee, Wang-chien. / Location-dependent spatial query containment. In: Data and Knowledge Engineering. 2011 ; Vol. 70, No. 10. pp. 842-865.
@article{106179c1e13f49bd8b853979181551b5,
title = "Location-dependent spatial query containment",
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.",
author = "Lee, {Ken C.K.} and Brandon Unger and Baihua Zheng and Wang-chien Lee",
year = "2011",
month = "10",
day = "1",
doi = "10.1016/j.datak.2011.06.001",
language = "English (US)",
volume = "70",
pages = "842--865",
journal = "Data and Knowledge Engineering",
issn = "0169-023X",
publisher = "Elsevier",
number = "10",

}

Location-dependent spatial query containment. / Lee, Ken C.K.; Unger, Brandon; Zheng, Baihua; Lee, Wang-chien.

In: Data and Knowledge Engineering, Vol. 70, No. 10, 01.10.2011, p. 842-865.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Location-dependent spatial query containment

AU - Lee, Ken C.K.

AU - Unger, Brandon

AU - Zheng, Baihua

AU - Lee, Wang-chien

PY - 2011/10/1

Y1 - 2011/10/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80051802774&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051802774&partnerID=8YFLogxK

U2 - 10.1016/j.datak.2011.06.001

DO - 10.1016/j.datak.2011.06.001

M3 - Article

AN - SCOPUS:80051802774

VL - 70

SP - 842

EP - 865

JO - Data and Knowledge Engineering

JF - Data and Knowledge Engineering

SN - 0169-023X

IS - 10

ER -