A theory of stream queries
DBPL, pp. 153-168, 2007.
bounded memory computabilityfixed universeabstract computabilityfinite sequencedata elementMore(5+)
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predicates. Stream queries are modeled as functions from streams to streams. Both timed and untimed settings are considered. Issues investigated include abstract defini...More
Full Text (Upload PDF)
PPT (Upload PPT)