Characterizing memory requirements for queries over continuous data streams

3 June 2002

proceedings article
Published by Association for Computing Machinery (ACM)

p. 221-232
https://doi.org/10.1145/543613.543642

Abstract

We consider conjunctive queries with arithmetic comparisons,over multiple continuous data streams. We specify an algorithm for determining whether,or not a query can be evaluated using a bounded amount,of memory,for all possible instances of the data streams. When a query can be evaluated using bounded memory, our algorithm produces an evaluation plan based on constant-sized synopses of the data streams.

Keywords

This publication has 13 references indexed in Scilit:

Continuous queries over data streams
ACM SIGMOD Record, 2001
Monitoring XML data on the Web
Published by Association for Computing Machinery (ACM) ,2001
On computing correlated aggregates over continual data streams
Published by Association for Computing Machinery (ACM) ,2001
Trajectory sampling for direct traffic observation
Published by Association for Computing Machinery (ACM) ,2000
An adaptive query execution system for data integration
Published by Association for Computing Machinery (ACM) ,1999
Cost-based query scrambling for initial delays
Published by Association for Computing Machinery (ACM) ,1998
The space complexity of approximating the frequency moments
Published by Association for Computing Machinery (ACM) ,1996
View maintenance issues for the chronicle data model (extended abstract)
Published by Association for Computing Machinery (ACM) ,1995
Continuous queries over append-only databases
Published by Association for Computing Machinery (ACM) ,1992
Updating derived relations: detecting irrelevant and autonomously computable updates
ACM Transactions on Database Systems, 1989