Processing Complex Agreeable Queries over Data Streams
01 January 2002
In this paper, we consider the problem of approximately answering aggregate SQL queries over continuous data streams with limited memory. Our method relies on randomizing techniques that compute small "sketch" summaries of the streams that can then be used to provide approximate answers to aggregate queries with provable guarantees on the approximation error.