Database tuning: a principled approach
Database tuning: a principled approach
Power efficient filtering of data on air
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 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
Broadcast protocols to support efficient retrieval from databases by mobile users
ACM Transactions on Database Systems (TODS)
Data on Air: Organization and Access
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
Indexed Sequential Data Broadcasting in Wireless Mobile Computing
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
An indexing method for wireless broadcast XML data
Information Sciences: an International Journal
A collaborative virtual geographic environment based on P2P and Grid technologies
Information Sciences: an International Journal
Information Sciences: an International Journal
Packet construction for secure conference call request in ad hoc network systems
Information Sciences: an International Journal
Hi-index | 0.00 |
Data broadcast is an efficient method for disseminating data items in a mobile computing environment. With the data broadcast method, data items are broadcast periodically according to a predetermined schedule. If a data item is retrieved from a storage device with a nondeterministic access time, the content of the data item may not be ready when it is required in a broadcast cycle. We call this problem the data-missing problem. To handle this problem, we revise the existing data broadcast schemes using two approaches. The reaccess approach requires a mobile client to access a missing data item in the next broadcast cycle, while the add-missing approach allows a mobile client to access a missing data item in an attached missing data segment. We compare the performance of the revised schemes in terms of access time and tuning time. The comparison shows that, except latency_opt, the access time of an add-missing-based revised scheme is shorter than that of its reaccess-based counterpart. On the contrary, the tuning time of the former is longer than that of the latter. For latency_opt, both the access time and the tuning time of its add-missing-based revised scheme are shorter than those of its reaccess-based revised scheme. The comparison also shows that the access times of the revised schemes increases dramatically as the data missing probability increases, while the tuning times of the revised schemes are not so sensitive to the data missing probability.