The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
Hi-index | 0.00 |
In mobile computing, a huge number of users expect various data services based on their location. Wireless data broadcast is suitable for meeting requests from lots of users owing to its scalability. Air indexing techniques have been developed for energy efficient query processing of mobile clients in the wireless data broadcast. Especially for spatial queries related to the user's location, the index based on Hilbert Curve is proposed. However, the index makes clients listen to a lot of data objects in order to process range queries. In this paper, we describe indexing technique for spatial range queries. And we propose the distributed air index based on space partition. For the performance evaluation, it is implemented using a discrete event-driven simulation package, SimJava. A Simulation is conducted with the real dataset that contains 5922 cities of Greece. The results show that the proposed index outperforms the index based on the Hilbert Curve in the energy efficiency and query processing time significantly.