INC: a language for incremental computations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Continuous queries over append-only databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Compensation-based on-line query processing
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
View maintenance issues for the chronicle data model (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Continuous queries over data streams
ACM SIGMOD Record
Incremental Computation of Time-Varying Query Expressions
IEEE Transactions on Knowledge and Data Engineering
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Tribeca: A Stream Database Manager for Network Traffic Analysis
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Block Level Query Scrambling Algorithm within Distributed Multidatabase Environment
DEXA '01 Proceedings of the 12th International Workshop on Database and Expert Systems Applications
| Hi-index | 0.00 |
This work addresses the problem of continuous query processing over infinite data streams. The paper defines new semantics for continuous queries and describes a continuous query processing system based on the concepts of continuous computations and online algorithms. A new programming control structure called as Continuous Iterator is proposed for implementation of continuous computations. The paper describes the semantics of three types of Continuous Iterators (composition, merge, and elimination), compares the iterators with the traditional relational algebra operations and proposes implementation of the iterators. The results of preliminary experiments are provided as well.