Power efficient filtering of data on air
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An analysis of selective tuning schemes for nonuniform broadcast
Data & Knowledge Engineering
Efficient indexing for broadcast based wireless systems
Mobile Networks and Applications - Special issue on mobile computing and system services
On selective tuning in unreliable wireless channels
Data & Knowledge Engineering
Supporting range queries in a wireless environment with nonuniform broadcast
Data & Knowledge Engineering
Indexing techniques for wireless data broadcast under data clustering and scheduling
Proceedings of the eighth international conference on Information and knowledge management
An index replication scheme for wireless data broadcasting
Journal of Systems and Software
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Efficient Data Allocation over Multiple Channels at Broadcast Servers
IEEE Transactions on Computers
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
An Adaptive Access Method for Broadcast Data under an Error-Prone Mobile Environment
IEEE Transactions on Knowledge and Data Engineering
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Bridging the Gap between Response Time and Energy-Efficiency in Broadcast Schedule Design
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
IEEE Transactions on Knowledge and Data Engineering
Adaptive Data Access in Broadcast-Based Wireless Environments
IEEE Transactions on Knowledge and Data Engineering
Information dissemination via wireless broadcast
Communications of the ACM - Adaptive complex enterprises
An Error-Resilient and Tunable Distributed Indexing Scheme for Wireless Data Broadcast
IEEE Transactions on Knowledge and Data Engineering
An Energy-Efficient and Access Latency Optimized Indexing Scheme for Wireless Data Broadcast
IEEE Transactions on Knowledge and Data Engineering
IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
A skewed distributed indexing for skewed access patterns on the wireless broadcast
Journal of Systems and Software
Interpolating the air for optimizing wireless data broadcast
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
FlexInd: a flexible and parameterizable air-indexing scheme for data broadcast systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Spatial query processing in road networks for wireless data broadcast
Wireless Networks
Hi-index | 0.00 |
Data broadcast is an efficient dissemination method to deliver information to mobile clients through the wireless channel. It allows a huge number of the mobile clients simultaneously access data in the wireless environments. In real-life applications, more popular data may be frequently accessed by clients than less popular ones. Under such scenarios, Acharya et al.'s Broadcast Disks algorithm (BD) allocates more popular data appeared more times in a broadcast period than less popular ones, i.e., the nonuniform broadcast, and provides a good performance on reducing client waiting time. However, mobile devices should constantly tune in to the wireless broadcast channel to examine data, consuming a lot of energy. Using index technologies on the broadcast file can reduce a lot of energy consumption of the mobile devices without significantly increasing client waiting time. In this paper, we propose an efficient nonuniform index called the skewed index, SI, over BD. The proposed algorithm builds an index tree according to skewed access patterns of clients, and allocates index nodes for the popular data more times than those for the less popular ones in a broadcast cycle. From our experimental study, we have shown that our proposed algorithm outperforms the flexible index and the flexible distributed index.