Range and nearest neighbor query processing for mobile clients

Authors:
KwangJin Park;MoonBae Song;Ki-Sik Kong;Chong-Sun Hwang;Kwang-Sik Chung;SoonYoung Jung
Affiliations:
Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea National Open University;Dept. of Computer Science Education, Korea University
Venue:
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Year:
2005

Citing 11
Cited 0

Sleepers and workaholics: caching strategies in mobile environments

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Energy efficient indexing on air

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 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
A Hybrid Index Technique for Power Efficient Data Broadcast

Distributed and Parallel Databases
Data Management in Location-Dependent Information Services

IEEE Pervasive Computing
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments

IEEE Transactions on Computers
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Location-Dependent Cache Invalidation Schemes for Mobile Environments

IEEE Transactions on Knowledge and Data Engineering
The D-Tree: An Index Structure for Planar Point Queries in Location-Based Wireless Services

IEEE Transactions on Knowledge and Data Engineering
Spatial queries in wireless broadcast systems

Wireless Networks - Special issue: Pervasive computing and communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Indexing techniques have been developed for wireless data broadcast environments, in order to conserve the scarce power resources of the mobile clients. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based spatial query processing algorithm for LBS. In this algorithm, we simply sort the data objects based on their locations, then the server broadcasts them sequentially to the mobile clients. The experimental results show that the proposed BBS scheme significantly reduces the Access latency.