Theory of Computing Systems

, Volume 49, Issue 4, pp 757–780

Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses


  • MohammadHossein Bateni
    • Princeton University
    • AT&T Labs–Research
  • MohammadTaghi Hajiaghayi
    • AT&T Labs–Research
  • Howard Karloff
    • AT&T Labs–Research

DOI: 10.1007/s00224-011-9347-2

Cite this article as:
Bateni, M., Golab, L., Hajiaghayi, M. et al. Theory Comput Syst (2011) 49: 757. doi:10.1007/s00224-011-9347-2


We study scheduling algorithms for loading data feeds into real time data warehouses, which are used in applications such as IP network monitoring, online financial trading, and credit card fraud detection. In these applications, the warehouse collects a large number of streaming data feeds that are generated by external sources and arrive asynchronously. Data for each table in the warehouse are generated at a constant rate, different tables possibly at different rates. For each data feed, the arrival of new data triggers an update that seeks to append the new data to the corresponding table; if multiple updates are pending for the same table, they are batched together before being loaded. At time τ, if a table has been updated with information up to time rτ, its staleness is defined as τr.

Our first objective is to schedule the updates on one or more processors in a way that minimizes the total staleness. In order to ensure fairness, our second objective is to limit the maximum “stretch”, which we define (roughly) as the ratio between the duration of time an update waits till it is finished being processed, and the length of the update.

In contrast to earlier work proving the nonexistence of constant-competitive algorithms for related scheduling problems, we prove that any online nonpreemptive algorithm, no processor of which is ever voluntarily idle, incurs a staleness at most a constant factor larger than an obvious lower bound on total staleness (provided that the processors are sufficiently fast). We give a constant-stretch algorithm, provided that the processors are sufficiently fast, for the quasiperiodic model, in which tables can be clustered into a few groups such that the update frequencies within each group vary by at most a constant factor. Finally, we show that our constant-stretch algorithm is also constant-competitive (subject to the same proviso on processor speed) in the quasiperiodic model with respect to total weighted staleness, where tables are assigned weights that reflect their priorities.


On-line schedulingData warehouse maintenanceCompetitive analysis

Copyright information

© Springer Science+Business Media, LLC 2011