A Theory of Stream Queries

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 definicomputability of stream queries; the connection between abstract computability, continuity, monotonicity, and non-blocking operators; and memory computability of stream queries using abstract state machines (ASMs).

• Type: Conference
• Year: 2007
• Where: DBPL
• Authors: Yuri Gurevich, Dirk Leinders, Jan Van den Bussche
• Keywords: Data Streams, DBPL 2007, Stream Queries, Various Built-in Functions