Valid scope computation for location-dependent spatial query in mobile broadcast environments

Authors:
Ken C.K. Lee;Josh Schiffman;Baihua Zheng;Wang-Chien Lee
Affiliations:
Pennsylvania State University, University Park, PA, USA;Pennsylvania State University, University Park, PA, USA;Singapore Management University, Singapore, Singapore;Pennsylvania State University, University Park, PA, USA
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 13
Cited 3

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
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
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
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
Spatial Index on Air

PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Location-based spatial queries

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Exponential index: a parameterized distributed indexing scheme for data on air

Proceedings of the 2nd international conference on Mobile systems, applications, and services
The D-Tree: An Index Structure for Planar Point Queries in Location-Based Wireless Services

IEEE Transactions on Knowledge and Data Engineering
DSI: A Fully Distributed Spatial Index for Location-Based Wireless Broadcast Services

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
On the metric properties of discrete space-filling curves

IEEE Transactions on Image Processing

Efficient valid scope computation for location-dependent spatial queries in mobile and wireless environments

Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Exploiting replication on dependent data allocation for ordered queries over multiple broadcast channels

Wireless Networks
Air-Indexing on error prone communication channels

DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless data broadcast is an efficient and scalable means to provide information access for a large population of clients in mobile environments. With Location-Based Services (LBSs) deployed upon a broadcast channel, mobile clients can collect data from the channel to answer their location-dependent spatial queries (LDSQs). Since the results of LDSQs would become invalid when mobile client moves to new locations, the knowledge of valid scopes for LDSQ results is necessary to assist clients to determine if their previous LDSQ results can be reused after they moved. This effectively improves query response time and client energy consumption. In this paper, we devise efficient algorithms to determine valid scopes for various LDSQs including range, window and nearest neighbor queries along with LDSQ processing over a broadcast channel. We conduct an extensive set of experiments to evaluate the performance of our proposed algorithms. While the proposed valid scope algorithm incurs only little extra processing overhead, unnecessary LDSQ reevaluation is significantly eliminated, thus providing faster query response and saving client energy.