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.
CITATION STYLE
Vossough, E., & Getta, J. R. (2002). Processing of continuous queries over unlimited data streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2453, pp. 799–809). Springer Verlag. https://doi.org/10.1007/3-540-46146-9_79
Mendeley helps you to discover research relevant for your work.