Characterizing Memory Requirements for Queries over Continuous Data Streams

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.

• Type: Conference
• Year: 2002
• Where: PODS
• Authors: Arvind Arasu, Brian Babcock, Shivnath Babu, Jon McAlister, Jennifer Widom
• Keywords: Conjunctive Queries, Continuous Data Streams, Database, PODS 2002, Possible Instances