Efficient Valid Scope Computation for Location-Dependent Spatial Queries in Mobile and Wireless Environments

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

Full description

Saved in:
Bibliographic Details
Main Authors: LEE, Ken C. K., LEE, Wang-chien, LEONG, Hong Va, UNGER, Brandon, ZHENG, Baihua
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2009
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/385
https://ink.library.smu.edu.sg/context/sis_research/article/1384/viewcontent/p131_lee.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1384
record_format dspace
spelling sg-smu-ink.sis_research-13842018-06-04T02:59:57Z Efficient Valid Scope Computation for Location-Dependent Spatial Queries in Mobile and Wireless Environments LEE, Ken C. K. LEE, Wang-chien LEONG, Hong Va UNGER, Brandon ZHENG, Baihua 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. 2009-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/385 info:doi/10.1145/1516241.1516264 https://ink.library.smu.edu.sg/context/sis_research/article/1384/viewcontent/p131_lee.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Databases and Information Systems
Numerical Analysis and Scientific Computing
LEE, Ken C. K.
LEE, Wang-chien
LEONG, Hong Va
UNGER, Brandon
ZHENG, Baihua
Efficient Valid Scope Computation for Location-Dependent Spatial Queries in Mobile and Wireless Environments
description 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.
format text
author LEE, Ken C. K.
LEE, Wang-chien
LEONG, Hong Va
UNGER, Brandon
ZHENG, Baihua
author_facet LEE, Ken C. K.
LEE, Wang-chien
LEONG, Hong Va
UNGER, Brandon
ZHENG, Baihua
author_sort LEE, Ken C. K.
title Efficient Valid Scope Computation for Location-Dependent Spatial Queries in Mobile and Wireless Environments
title_short Efficient Valid Scope Computation for Location-Dependent Spatial Queries in Mobile and Wireless Environments
title_full Efficient Valid Scope Computation for Location-Dependent Spatial Queries in Mobile and Wireless Environments
title_fullStr Efficient Valid Scope Computation for Location-Dependent Spatial Queries in Mobile and Wireless Environments
title_full_unstemmed Efficient Valid Scope Computation for Location-Dependent Spatial Queries in Mobile and Wireless Environments
title_sort efficient valid scope computation for location-dependent spatial queries in mobile and wireless environments
publisher Institutional Knowledge at Singapore Management University
publishDate 2009
url https://ink.library.smu.edu.sg/sis_research/385
https://ink.library.smu.edu.sg/context/sis_research/article/1384/viewcontent/p131_lee.pdf
_version_ 1770570404164796416