Window specification over data streams

Patroumpas, K and Sellis, T 2006, 'Window specification over data streams', in Grust, T; Hopfner, H; Illarramendi, A; Jablonski, S; Mesiti, M; Muller, S; Patranjan, PL; Sattler, KU; Spiliopoulou, M; Wijsen, J (ed.) Proceedings of the International Conference on Semantics of a Networked World: Semantics of sequence and time dependent data (ICSNW'06, co-located with EDBT '06), Munich, Germany, 26-31 March 2006, pp. 445-464.


Document type: Conference Paper
Collection: Conference Papers

Title Window specification over data streams
Author(s) Patroumpas, K
Sellis, T
Year 2006
Conference name International Conference on Semantics of a Networked World: Semantics of sequence and time dependent data (ICSNW'06, co-located with EDBT '06)
Conference location Munich, Germany
Conference dates 26-31 March 2006
Proceedings title Proceedings of the International Conference on Semantics of a Networked World: Semantics of sequence and time dependent data (ICSNW'06, co-located with EDBT '06)
Editor(s) Grust, T; Hopfner, H; Illarramendi, A; Jablonski, S; Mesiti, M; Muller, S; Patranjan, PL; Sattler, KU; Spiliopoulou, M; Wijsen, J
Publisher Springer
Place of publication Germany
Start page 445
End page 464
Total pages 20
Abstract Several query languages have been proposed for managing data streams in modern monitoring applications. Continuous queries expressed in these languages usually employ windowing constructs in order to extract finite portions of the potentially unbounded stream. Explicitly or not, window specifications rely on ordering. Usually, timestamps are attached to all tuples flowing into the system as a means to provide ordered access to data items. Several window types have been implemented in stream prototype systems, but a precise definition of their semantics is still lacking. In this paper, we describe a formal framework for expressing windows in continuous queries over data streams. After classifying windows according to their basic characteristics, we give algebraic expressions for the most significant window types commonly appearing in applications. As an essential step towards a stream algebra, we then propose formal definitions for the windowed analogs of typical relational operators, such as join, union or aggregation, and we identify several properties useful to query optimization.
Subjects Database Management
Keyword(s) Data stream
query optimization
window specification
Copyright notice © Springer
ISSN 0302-9743
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 23 times in Thomson Reuters Web of Science Article | Citations
Access Statistics: 188 Abstract Views  -  Detailed Statistics
Created: Mon, 21 Jan 2013, 10:51:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us