Continuous queries over append-only databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Evolving algebras 1993: Lipari guide
Specification and validation methods
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Computable analysis: an introduction
Computable analysis: an introduction
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Characterizing memory requirements for queries over continuous data streams
ACM Transactions on Database Systems (TODS)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
The VLDB Journal — The International Journal on Very Large Data Bases
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
The CQL continuous query language: semantic foundations and query execution
The VLDB Journal — The International Journal on Very Large Data Bases
Processing sliding window multi-joins in continuous queries over data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query languages and data models for database sequences and data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Database query processing using finite cursor machines
ICDT'07 Proceedings of the 11th international conference on Database Theory
Machine models for query processing
ACM SIGMOD Record
The logic of query languages for data streams
Proceedings of the 4th International Workshop on Logic in Databases
Relational languages and data models for continuous queries on sequences and data streams
ACM Transactions on Database Systems (TODS)
Yuri, logic, and computer science
Fields of logic and computation
Fields of logic and computation
Declarative abstractions for agent based hybrid control systems
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
A universal calculus for stream processing languages
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
From a calculus to an execution environment for stream processing
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Logical foundations of continuous query languages for data streams
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
An in-browser microblog ranking engine
ER'12 Proceedings of the 2012 international conference on Advances in Conceptual Modeling
| Hi-index | 0.00 |
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).