The Community for Technology Leaders
Green Image
Issue No. 02 - February (2009 vol. 21)
ISSN: 1041-4347
pp: 273-286
Chih-Lin Hu , National Taiwan University, Taipei
Ming-Syan Chen , National Taiwan University, Taipei
The scalability of data broadcasting has been manifested by prior studies on the base of the traditional data management systems where data objects, mapped to a pair of state and value in the database, are independent, persistent, and static against simple queries. However, many modern information applications spread dynamic data objects and process complex queries for retrieving multiple data objects. Particularly, the information servers dynamically generate data objects that are dependent and can be associated into a complete response against complex queries. Accordingly, the study in this paper considers the problem of scheduling dynamic broadcast data objects in a clients-providers-servers system from the standpoint of data association, dependency, and dynamics. Since the data broadcast problem is NP-hard, we derive the lower and the upper bounds of the mean service access time. In light of the theoretical analyses, we further devise a deterministic algorithm with several gain measure functions for the approximation of schedule optimization. The experimental results show that the proposed algorithm is able to generate a dynamic broadcast schedule and also minimize the mean service access time to the extent of being very close to the theoretical optimum.
Push, broadcast, periodicity, scheduling, query processing, data dissemination, mobile database.

M. Chen and C. Hu, "Online Scheduling Sequential Objects with Periodicity for Dynamic Information Dissemination," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 273-286, 2008.
81 ms
(Ver 3.3 (11022016))