The datacycle architecture for very high throughput database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Communications of the ACM - Special issue on information filtering
The Information Bus: an architecture for extensible distributed systems
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Mobile wireless computing: challenges in data management
Communications of the ACM
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A dynamic scheduler for the infinite air-cache
Data & Knowledge Engineering
Broadcast scheduling for information distribution
Wireless Networks
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Efficient algorithms for scheduling data broadcast
Wireless Networks
Supporting range queries in a wireless environment with nonuniform broadcast
Data & Knowledge Engineering
Mobile Computing
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Generating Broadcast Programs that Support Range Queries
IEEE Transactions on Knowledge and Data Engineering
Mobile Computing and Databases-A Survey
IEEE Transactions on Knowledge and Data Engineering
Querying in Highly Mobile Distributed Environments
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Pinwheel Scheduling for Fault-Tolerant Broadcast Disks in Real-time Database Systems
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
AIDA-based real-time fault-tolerant broadcast disks
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Broadcast on Demand: Efficient and Timely Dissemination of Data in Mobile Environments
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
An Efficient Scheduling Method for Query-Set-Based Broadcasting in Mobile Environments
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Efficient query execution on broadcasted index tree structures
Data & Knowledge Engineering
An efficient data placement for query-set-based broadcasting in mobile environments
Computer Communications
A skewed distributed indexing for skewed access patterns on the wireless broadcast
Journal of Systems and Software
WSEAS TRANSACTIONS on COMMUNICATIONS
Cooperative caching by clients constructing a peer-to-peer network for push-based broadcast
Data & Knowledge Engineering
Hi-index | 0.00 |
Acharya et al. have proposed the use of a periodic dissemination architecture in the context of mobile systems, called Broadcast disks. This strategy can construct a memory hierarchy where the highest level contains a few items and broadcasts them with high frequency while subsequent levels contain more and more items and broadcast them with less and less frequency. In this way, one can establish a trade-off between access time for high-priority data and that of the low-priority items, where access time means the time elapsed from the moment a client submits a query to the receipt of data of his (her) interest on the broadcast channel. However, based on Acharya et al.'s algorithm, some broadcast slots may be unused, which results in the waste of bandwidth and the increase of access time. Therefore, in this paper, we propose an efficient broadcast program, the complementary approach, in which no empty slot is wasted. The basic idea of the complementary approach is to move some pages which are located near the end of a broadcast cycle to those empty slots which occur before these pages. Therefore, finally, the total number of slots in a broadcast cycle is equal to the one computed from Acharya et al.'s algorithm minus the number of empty slots. Obviously, our complementary approach generates a small number of slots in one broadcast cycle and shorter mean access time than Acharya et al.'s algorithm.