Quickly generating billion-record synthetic databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Mobile wireless computing: challenges in data management
Communications of the ACM
Data broadcasting strategies over multiple unreliable wireless channels
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
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
CSIM: a C-based process-oriented simulation language
WSC '86 Proceedings of the 18th conference on Winter simulation
Proceedings of the ninth international conference on Information and knowledge management
The Challenges of Mobile Computing
Computer
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
Index and Data Allocation on Multiple Broadcast Channels Considering Data Access Frequencies
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
Semantic Data Access in an Asymmetric Mobile Environment
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Optimal Index and Data Allocation in Multiple Broadcast Channels
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
A Semantic Broadcast Scheme for a Mobile Environment Based on Dynamic Chunking
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Object Organization on a Single Broadcast Channel in a Global Information Sharing Environment
EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 2
Efficient data access to multi-channel broadcast programs
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
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
An efficient nonuniform index in the wireless broadcast environments
Journal of Systems and Software
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Energy-efficient tree-based indexing schemes for information retrieval in wireless data broadcast
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Algebraic data retrieval algorithms for multi-channel wireless data broadcast
Theoretical Computer Science
Hi-index | 0.00 |
Broadcast has often been used to disseminate frequently requested data efficiently to a large volume of mobile units over single or multiple channels. Since mobile units have limited battery power, the minimization of the access and tuning times for the broadcast data is an important problem. There have been many research efforts that focus on minimizing access and tuning times by providing indexes on the broadcast data. In this paper, we have studied an efficient index allocation method for broadcast data with skewed access frequencies over multiple physical channels which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques have one of two problems. The first problem is that they require equal size for both index and data. The second problem is that their performance degrades when the number of given physical channels is not enough. These two problems will result in an increased average access time for the broadcast data. To cope with these problems, we propose a tree-structured index allocation method. Our method minimizes the average access time by broadcasting the hot data and their indices more frequently than the less hot data and their indexes over the dedicated index and data channels. We present an in-depth experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decreases the average access and tuning times for the broadcast data over existing methods.