Affiliation:
1. National University of Singapore, Singapore
2. Singapore Management University, Singapore
Abstract
The pervasiveness of mobile computing devices and wide-availability of wireless networking infrastructure have empowered users with applications that provides location-based services as well as the ability to pose queries to remote servers. This necessitates the need for adaptive, robust, and efficient techniques for processing the queries. In this chapter, we identify the issues and challenges of processing spatial data on the move. Next, we present insights on state-of-art spatial query processing techniques used in these dynamic, mobile environments. We conclude with several potential open research problems in this exciting area.
Reference57 articles.
1. Arge, L. A., Procopiuc, O., Ramaswamy, S., Suel, T., & Vitter, J. S. (1998, 24-27). Scalable sweeping-based spatial joIn in. Proceedings of International Conference on Very Large Data Bases (VLDB) (pp. 570-581).
2. Bakalov, P., Hadjieleftheriou, M., Keogh, E., & Tsotras, V. J. (2005). Efficient trajectory joins using symbolic representations. In P. K. Chrysanthis, & F. Samaras (Eds.), Mobile data management. ACM Press.
3. Beckmann, N., Kriegel, H. P., Schneider, R., & Seeger, B. (1990). 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 (pp. 322-331). New York: ACM Press.
4. The k-Nearest Neighbour Join: Turbo Charging the KDD Process
5. Brinkhoff, T., Kriegel, H. P., Schneider, R., & Seeger, B. (1994). Multi-step processing of spatial joins. In Proceedings of the ACM 14 SIGMOD International Conference on Management of Data (pp. 197-208).