A Theory of Stream Queries
- Yuri Gurevich ,
- Dirk Leinders ,
- Jan Van den Bussche
11th International Symposium on Database Programming Languages (DBPL 2007). Springer Lecture Notes in Computer Science (2007). |
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 definitions of computability of stream queries; the connection between abstract computability, continuity, monotonicity, and non-blocking operators; and bounded memory computability of stream queries using abstract state machines (ASMs).