Spatial Queries in Wireless Broadcast Systems

Owing to the advent of wireless networking and personal digital devices, information systems in the era of mobile computing are expected to be able to handle a tremendous amount of traffic and service requests from the users. Wireless data broadcast, thanks to its high scalability, is particularly suitable for meeting such a challenge. Indexing techniques have been developed for wireless data broadcast systems in order to conserve the scarce power resources in mobile clients. However, most of the previous studies do not take into account the impact of location information of users. In this paper, we address the issues of supporting spatial queries (including window queries and kNN queries) of location-dependent information via wireless data broadcast. A linear index structure based on the Hilbert curve and corresponding search algorithms are proposed to answer spatial queries on air. Experiments are conducted to evaluate the performance of the proposed indexing technique. Results show that the proposed index and its enhancement outperform existing algorithms significantly.

[1]  Wang-Chien Lee,et al.  Optimal channel allocation for data dissemination in mobile computing environments , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[2]  Mahadev Satyanarayanan,et al.  A catalyst for mobile and ubiquitous computing , 2002, IEEE Pervasive Computing.

[3]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[4]  Vijay Kumar,et al.  Broadcast protocols to support efficient retrieval from databases by mobile users , 1999, TODS.

[5]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[6]  Christos Faloutsos,et al.  Fast Nearest Neighbor Search in Medical Image Databases , 1996, VLDB.

[7]  P. Dourish,et al.  Context-Aware Computing , 2001 .

[8]  Wang-Chien Lee,et al.  Signature caching techniques for information filtering in mobile environments , 1999, Wirel. Networks.

[9]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[10]  Divyakant Agrawal,et al.  Approximate nearest neighbor searching in multimedia databases , 2001, Proceedings 17th International Conference on Data Engineering.

[11]  Michael Lindenbaum,et al.  On the metric properties of discrete space-filling curves , 1996, IEEE Trans. Image Process..

[12]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[13]  Jianliang Xu,et al.  Energy-Conserving Air Indexes for Nearest Neighbor Search , 2004, EDBT.

[14]  Rafael Alonso,et al.  Broadcast disks: data management for asymmetric communication environments , 1995, SIGMOD '95.

[15]  Gregory D. Abowd,et al.  Context-aware computing [Guest Editors' Intro.] , 2002, IEEE Pervasive Computing.

[16]  Wang-Chien Lee,et al.  Spatial Index on Air , 2003, PerCom.

[17]  Tomasz Imielinski,et al.  Data on Air: Organization and Access , 1997, IEEE Trans. Knowl. Data Eng..

[18]  Vijay Kumar,et al.  Adaptive broadcast protocols to support power conservant retrieval by mobile users , 1997, Proceedings 13th International Conference on Data Engineering.

[19]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[20]  Christos Faloutsos,et al.  Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.

[21]  David J. Goodman,et al.  General packet radio service in GSM , 1997, IEEE Commun. Mag..

[22]  Hans-Peter Kriegel,et al.  Fast nearest neighbor search in high-dimensional space , 1998, Proceedings 14th International Conference on Data Engineering.

[23]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[24]  Jirí Matousek,et al.  Constructing levels in arrangements and higher order Voronoi diagrams , 1994, SCG '94.

[25]  Wang-Chien Lee,et al.  Power conservative multi-attribute queries on data broadcast , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[26]  Hans-Peter Kriegel,et al.  Optimal multi-step k-nearest neighbor search , 1998, SIGMOD '98.

[27]  Jianliang Xu,et al.  Energy efficient index for querying location-dependent data in mobile broadcast environments , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[28]  Ada Wai-Chee Fu,et al.  Enhanced nearest neighbour search on the R-tree , 1998, SGMD.

[29]  Hanan Samet,et al.  Ranking in Spatial Databases , 1995, SSD.

[30]  Marvin Minsky,et al.  Perceptrons: An Introduction to Computational Geometry , 1969 .

[31]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[32]  Guido Brunnett,et al.  A hashing strategy for efficient k-nearest neighbors computation , 1999, 1999 Proceedings Computer Graphics International.