A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
On Indexing Sliding Windows over Online Data Streams
[chapter]
2004
Lecture Notes in Computer Science
We consider indexing sliding windows in main memory over on-line data streams. Our proposed data structures and query semantics are based on a division of the sliding window into sub-windows. When a new sub-window fills up with newly arrived tuples, the oldest sub-window is evicted, indices are refreshed, and continuous queries are re-evaluated to reflect the new state of the window. By classifying relational operators according to their method of execution in the windowed scenario, we show
doi:10.1007/978-3-540-24741-8_41
fatcat:ynu6ci542bff5pgxqw2lgvm4w4