Online Scheduling Sequential Objects with Periodicity for Dynamic Information Dissemination

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 a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on knowledge and data engineering 2009-02, Vol.21 (2), p.273-286
Main Authors: HU, Chih-Lin, CHEN, Ming-Syan
Format: Article
Language:English
Subjects:
Access time
Algorithm design and analysis
Algorithms
Applied sciences
Approximation algorithms
broadcast
Broadcasting
Computer science
control theory
systems
Computer systems and distributed systems. User interface
data dissemination
Data processing. List processing. Character string processing
Dynamic scheduling
Dynamic tests
Dynamical systems
Dynamics
Exact sciences and technology
Information retrieval
Information systems. Data bases
Memory organisation. Data processing
mobile database
Optimal scheduling
periodicity
Push
Queries
query processing
Scalability
Schedules
scheduling
Scheduling algorithm
Software
Studies
Upper bound
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2008.148