Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Scheduling data broadcast to “impatient” users
Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
Scheduling and caching strategies for broadcasting correlated data
Proceedings of the 2001 ACM symposium on Applied computing
IEEE Transactions on Computers
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Prefetching from Broadcast Disks
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Efficient Algorithms for Scheduling Single and Multiple Channel Data Broadcast
Efficient Algorithms for Scheduling Single and Multiple Channel Data Broadcast
Scheduling Data Broadcast in Asymmetric Communication Environments
Scheduling Data Broadcast in Asymmetric Communication Environments
Efficient Index Caching Schemes for Data Broadcasting in Mobile Computing Environments
DEXA '03 Proceedings of the 14th International Workshop on Database and Expert Systems Applications
Information Sciences: an International Journal
Hi-index | 0.00 |
Due to the limited power supply of mobile devices, much research has been done on reducing the power consumption of mobile devices in mobile computing environments. Since supporting indices on the broadcast data items can effectively reduce the power consumption of the mobile clients, most of the existing research on data broadcasting has focused on designing efficient indexing schemes. In this paper, we propose to cache indices on the mobile clients and to use cached indices to facilitate the access of the broadcast data items. To manage the cache usage of the mobile clients, we propose two cache management policies. The lower-level-index-first policy caches the index nodes that are at the lower level of the index tree, while the cut-plane-first policy caches the index nodes that belong to a cut-plane of the index tree. Through experiments, we compare the performance of the two proposed policies with some existing policies in terms of tuning time and access time. The experiments show that index caching significantly reduces the tuning time of a mobile client without increasing its access time. In terms of tuning time, the experiments show that, when the access pattern of a mobile client is not skew, the cut-plane-first policy outperforms the lower-level-index first policy, LRU and LRFU. On the contrary, when the mobile client has a small cache and its access pattern is skew, the lower-level-index-first policy outperforms the cut-plane-first policy, LRU and LRFU. In terms of access time, the lower-level-index first policy outperforms the cut-plane-first policy, LRU and LRFU.