Using Punctuation Schemes to Characterize Strategies for Querying over Data Streams

Authors:
Peter Tucker;David Maier;Tim Sheard;Paul Stephens
Affiliations:
-;-;-;-
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2007

Citing 0
Cited 7

Towards a streaming SQL standard

Proceedings of the VLDB Endowment
Window Update Patterns in Stream Operators

ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Location-dependent query processing: Where we are and where we are heading

ACM Computing Surveys (CSUR)
Maintaining consistent results of continuous queries under diverse window specifications

Information Systems
Recognizing patterns in streams with imprecise timestamps

Proceedings of the VLDB Endowment
A survey of B-tree logging and recovery techniques

ACM Transactions on Database Systems (TODS)
Recognizing patterns in streams with imprecise timestamps

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many systems and strategies have been proposed for processing non-terminating data streams. Each approach has advantages and disadvantages, including the kinds of queries that can be executed. We present a framework for characterizing the kinds of queries that can be executed over streams based on a notion of compact sets from topology. We first apply our framework to queries over punctuated data streams. Previous work on punctuations focused primarily on the behavior of individual query operators. We use our framework to determine if an entire query can benefit from punctuations available from stream sources. We then consider other common strategies proposed in the literature for executing queries over streams, and we discuss how our framework can characterize the kinds of queries each strategy can answer.