Spatial query processing in road networks for wireless data broadcast
- 384 Downloads
Recently, wireless broadcast environments have attracted significant attention due to its high scalability to broadcast information to a large number of mobile subscribers. It is especially a promising and desirable dissemination method for the heavily loaded environment where a great number of the same type of requests are sent from the users. There have been many studies on processing spatial queries via broadcast model recently. However, not much attention is paid to the spatial queries in road networks on wireless broadcast environments. In this paper, we focus on three common types of spatial queries, namely, k nearest neighbor (kNN) queries, range queries and reverse nearest neighbor (RNN) queries in spatial networks for wireless data broadcast. Specially, we propose a novel index for spatial queries in wireless broadcast environments (ISW). With the reasonable organization and the effectively pre-computed bounds, ISW provides a powerful framework for spatial queries. Furthermore, efficient algorithms are designed to cope with kNN, range and RNN queries separately based on ISW. The search space can be obviously reduced and subsequently the client can download as less as possible data for query processing, which can conserve the energy while not significantly influence the efficiency. The detailed theory analysis of cost model and the experimental results are presented for verifying the efficiency and effectiveness of ISW and our methods.
KeywordsWireless data broadcast Spatial queries Road networks ISW
This work was supported in part by the the National Natural Science Foundation of China under grants Nos. 60933001, 61003058, and the Fundamental Research Funds for the Central Universities under grants No.N100604014 and No. N110604001.
- 4.Gedik, B., Singh, A., & Liu, L. (2004). Energy efficient exact knn search in wireless broadcast environments. In GIS (pp. 137–146).Google Scholar
- 6.Ambient information network. http://www.ambientdevices.com/cat/index.html.
- 8.Zhang, X., Lee, W.-C., Mitra, P., & Zheng, B. (2008). Processing transitive nearest-neighbor queries in multi-channel access environments. In Proceedings of EDBT (pp. 452–463).Google Scholar
- 10.Shahabi, C., Kolahdouzan, M. R., & Sharifzadeh, M. (2002). A road network embedding technique for k-nearest neighbor search in moving object databases. In GIS (pp. 94–100).Google Scholar
- 11.Papadias, D., Zhang, J., Mamoulis, N., & Tao, Y. (2003). Query processing in spatial network databases. In VLDB (pp. 802–813).Google Scholar
- 12.Kolahdouzan, M., & Shahabi, C. (2004). Voronoi-based k nearest neighbor search for spatial network databases. In VLDB (pp. 840–851).Google Scholar
- 13.Samet, H., Sankaranarayanan, J., & Alborzi, H. (2008). Scalable network distance browsing in spatial databases. In SIGMOD (pp. 43–54).Google Scholar
- 14.Kellaris, G., & Mouratidis, K. (2010). Shortest path computation on air indexes. In VLDB (pp. 747–757).Google Scholar
- 18.Lee, W.-C., & Zheng, B. (2005). Dsi: A fully distributed spatial index for location-based wireless broadcast services. In ICDCS (pp. 349–358).Google Scholar
- 19.Xu, J., Lee, W.-C., & Tang, X. (2004). Exponential index: a parameterized distributed indexing scheme for data on air. In Proceedings of MobiSys (pp. 153–164).Google Scholar
- 21.Zhong, J., Wu, W., Shi, Y., & Gao, X. (2011). Energy-efficient tree-based indexing schemes for information retrieval in wireless data broadcast. In Proceedings of DASFAA (pp. 335–351).Google Scholar
- 23.Möhring, R., Schilling, H., Schütz, B., Wagner, D., & Willhalm, T. (2006). Partitioning graphs to speedup dijkstra’s algorithm. Journal of Experimental Algorithmics, 11, 1–29.Google Scholar
- 24.Xiao, X., Yao, B., & Li, F. (2011). Optimal location queries in road network databases. In ICDE (pp. 804–815).Google Scholar