Range and nearest neighbor query processing for mobile clients

Kwangjin Park, Moon Bae Song, Ki Sik Kong, Chong Sun Hwang, Kwang Sik Chung, Soon Young Jung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationOn the Move to Meaningful Internet Systems 2005
Subtitle of host publicationOTM Workshops - OTM Confederated Int. Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005, Proceedings
Pages1097-1106
Number of pages10
DOIs
Publication statusPublished - 2005
EventOTM Confederated Internationl Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005 - Agia Napa, Cyprus
Duration: 2005 Oct 312005 Nov 4

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3762 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherOTM Confederated Internationl Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005
CountryCyprus
CityAgia Napa
Period05/10/3105/11/4

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Range and nearest neighbor query processing for mobile clients'. Together they form a unique fingerprint.

Cite this