Sciweavers

25 search results - page 2 / 5
» No pane, no gain: efficient evaluation of sliding-window agg...
Sort
View
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
13 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
2006
ACM
238views Database» more  SIGMOD 2006»
14 years 5 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
KDD
2003
ACM
192views Data Mining» more  KDD 2003»
14 years 5 months ago
Efficient elastic burst detection in data streams
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
Yunyue Zhu, Dennis Shasha
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 6 months ago
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
Feifei Li, Ching Chang, George Kollios, Azer Besta...
ADBIS
2009
Springer
127views Database» more  ADBIS 2009»
14 years 2 days ago
Window Update Patterns in Stream Operators
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely result...
Kostas Patroumpas, Timos K. Sellis