Publisher Summary The history of histograms is long and rich, full of detailed information in
every step. It includes the course of histograms in different scientific fields, the successes …

We investigate algorithms for evaluating sliding window joins over pairs of unbounded
streams. We introduce a unit-time-basis cost model to analyze the expected performance of …

Publisher Summary This chapter presents and analyzes incremental, multi-way join
algorithms for sliding windows over data streams. Based on a per-unit-time cost model, it …

Publisher Summary This chapter focuses on a fundamental problem that arises in
Continuous Query (CQ) processing over data streams. It investigates the problem of …

We present a query architecture in which join operators are decomposed into their
constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is …

Traditional databases store sets of relatively static records with no pre-defined notion of time,
unless timestamp attributes are explicitly added. While this model adequately represents …

As low-level architectural support for context-aware computing matures, we are ready to
explore more general and powerful means of accessing context data. Information required …

Speculation is an every day phenomenon whereby one acts in anticipation of particular
conditions that are likely to hold in the future. Computer science research has seen many …

In contrast to traditional query processing based on persistent data, new application
scenarios arise that heavily rely on the continuous evaluation of data streams. These …

Support for exploratory interaction with databases in applications such as data mining
requires that the first few results of an operation be available as quickly as possible. We …