Abstract
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.
Similar content being viewed by others
References
G.D. Abowd, M. Ebling, G. Hung, H. Lei and H.-W. Gellersen, Context-aware computing, IEEE Pervasive Computing 1(3) (2002) 22–23.
S. Acharya, R. Alonso, M. Franklin and S. Zdonik, Broadcast disks: Data management for asymmetric communications environments, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95), San Jose, CA (May 1995) pp. 199–210.
P.K. Agarwal, M. Berg, J. Matousek and O. Schwarzkopf, Constructing levels in arrangements and higher order Voronoi diagrams, SIAM Journal on Computing 27(3) (1998) 654–667.
N. Beckmann and H.-P. Kriegel, The R *-tree: An efficient and robust access method for points and rectangles, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIG-MOD'90) (1990) pp. 322–331.
S. Berchtold, B. Ertl, D.A. Keim, H.P. Kriegel and T. Seidl, Fast nearest neighbor search in high-dimensional space, in: Proceedings of the 14th International Conference on Data Engineering (ICDE'98) (February 1998) pp. 209–218.
J. Cai and D.J. Goodman, General packet radio service in GSM, IEEE Communications Magazine 35(10) (1997) 122–131.
K.L. Cheung and W.-C. Fu, Enhanced nearest neighbour search on the R-tree, SIGMOD Record 27(3) (1998) 16–21.
A. Datta, A. Celik, J.K. Kim, D. VanderMeer and V. Kumar, Adaptive broadcast protocols to support power conservation retrieval by mobile users, in: Proceedings of the 13th IEEE International Conference Data Engineering (ICDE'97), Birmingham, UK (April 1997) pp. 124–133.
A. Datta, D.E. VanderMeer, A. Celik and V. Kumar, Broadcast protocols to support efficient retrieval from databases by mobile users, ACM Transactions on Database Systems (TODS) 24(1) (1999) 1–79.
H. Ferhatosmanoglu, E. Tuncel, D. Agrawal and A.E. Abbadi, Approximate nearest neighbor searching in multimedia databases, in: Proceedings of the 17th IEEE International Conference on Data Engineering (ICDE'01) (April 2001).
C. Gotsman and M. Lindenbaum, On the metric properties of discrete space-filling curves, IEEE Transactions on Image Processing 5(5) (1996) 794–797.
A. Guttman, R-trees: A dynamic index structure for spatial searching, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'84) (1984) pp. 47–54.
A. Hinneburg, C.C. Aggarwal and D.A. Keim, What is the nearest neighbor in high dimensional spaces?, in: Proceedings of the 26th International Conference on Very Large Data Bases (VLDB'00) (September 2000).
G.R. Hjaltason and H. Samet, Ranking in spatial databases, in: Proceedings of the 4th International Symposium on Advances in Spatial Databases (SSD'95) (1995) pp. 83–95.
G.R. Hjaltason and H. Samet, Distance browsing in spatial databases, ACM Transactions on Database Systems 24(2) (1999) 265–318.
Q.L. Hu, D.L. Lee and W.-C. Lee, Optimal channel allocation for data dissemination in mobile computing environments, in: Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS'98), Amsterdam, The Netherlands (May 1998) pp. 480–487.
Q.L. Hu, W.-C. Lee and D.L. Lee, Power conservative multi-attribute queries on data broadcast, in: Proceedings of the 16th International Conference on Data Engineering (ICDE'2000), San Diego, CA, USA (February 2000) pp. 157–166.
T. Imielinski, S. Viswanathan and B.R. Badrinath, Data on air – organization and access, IEEE Transactions on Knowledge and Data Engi-neering (TKDE) 9(3) (1997).
I. Kamel and C. Faloutsos, On packing R-trees, in: Proceedings of the 2th International Conference on Information and Knowledge Management (CIKM'93), Washington, DC (November 1993) pp. 490–499.
I. Kamel and C. Faloutsos, Hilbert R-tree: An improved R-tree us-ing fractals, in: Proceedings of 20th International Conference on Very Large Data Bases (VLDB'94), Santiago de Chile, Chile (September 1994) pp. 500–509.
F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel and Z. Protopapas, Fast nearest neighbor search in medical image databases, in: Proceedings of the 22th International Conference on Very Large Data Bases (VLDB'96) (1996) pp. 215–226.
W.-C. Lee and D.L. Lee, Signature caching techniques for information broadcast and filtering in mobile environments, Wireless Networks (WINET) 5(1) (1999) 57–67.
S.T. Leutenegger, J.M. Edgington and M.A. Lopez, STR: A simple and efficient algorithm for R-tree packing, in: Proceedings of the 13th International Conference on Data Engineering (ICDE'97), Birmingham, UK (April 1997) pp. 497–506.
Microsoft Corporation, What is the directband network? (2003), available at http://www.microsoft.com/resources/spot/ direct.mspx.
M. Minsky and S. Papert, Perceptrons: An Introduction to Computational Geometry (The MIT Press, 1969).
D. Moore, Hilbert curve, available at http://www.caam.rice. edu/dougm/twiddle/Hilbert
N. Roussopoulos, S. Kelley and F. Vincent, Nearest neighbor queries, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95) (May 1995) pp. 71–79.
M. Satyanarayanan, A catalyst for mobile and ubiquitous computing, IEEE Pervasive Computing 1(1) (2002) 2–5.
H. Schwetman, CSIM user's guide (version 18), Mesquite Software, Inc. (1998), http://www.mesquite.com
T. Seidl and H. Kriegel, Optimal multi-step k-nearest neighbor search, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'98) (July 1998) pp. 154–165.
T. Sellis, N. Roussopoulos and C. Faloutsos, The R +-tree: A dynamic index for multi-dimensional objects, in: Proceedings of the 13th International Conference on Very Large Data Bases (VLDB'87) (1987) pp. 507–518.
Spatial Datasets, available at http://dias.cti.gr/ ~ytheod/ research/datasets/spatial.html
M. Vanco, G. Brunnett and T. Schreiber, A hashing strategy for efficient k-nearest neighbors computation, in: Proceedings of Computer Graphics International, Canmore, Alberta, Canada (June 1999).
J. Xu, B. Zheng, W.-C. Lee and D.L. Lee, Energy efficient index for querying location-dependent data in mobile broadcast environments, in: Proceedings of the 19th IEEE International Conference on Data Engineering (ICDE'03), Bangalore, India (March 2003) pp. 239–250.
B. Zheng, W.C. Lee and D.L. Lee, Spatial index on air, in: Proceedings of the 1st IEEE International Conference on Pervasive Computing and Communications (PerCom'03), Dallas-Fort Worth, TX (March 2003) pp. 297–304.
B. Zheng, J. Xu, W.C. Lee and D.L. Lee, Energy-conserving air indexes for nearest neighbor search, in: Proceedings of the 9th International Conference on Extending Database Technology (EDBT'04), Heraklion, Crete, Greece (March 2004).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zheng, B., Lee, WC. & Lee, D.L. Spatial Queries in Wireless Broadcast Systems. Wireless Networks 10, 723–736 (2004). https://doi.org/10.1023/B:WINE.0000044031.03597.97
Issue Date:
DOI: https://doi.org/10.1023/B:WINE.0000044031.03597.97