Sciweavers

61 search results - page 7 / 13
» Sketching asynchronous data streams over sliding windows
Sort
View

Publication
431views
17 years 5 months ago
Incremental Evaluation of Sliding-window Queries over Data Streams
Thanaa M. Ghanem, Moustafa A. Hammad, Mohamed F. Mokbel, Walid G. Aref, and Ahmed K. Elmagarmid. "Incremental Evaluation of Sliding-window Queries over Data Streams". IEE...
Thanaa M. Ghanem, Moustafa A. Hammad, Mohamed F. M...
VLDB
2004
ACM
113views Database» more  VLDB 2004»
15 years 11 months ago
Resource Sharing in Continuous Sliding-Window Aggregates
We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important...
Arvind Arasu, Jennifer Widom
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
15 years 3 months ago
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, St&e...
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 6 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
CIKM
2009
Springer
16 years 15 days ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer