Sciweavers

175 search results - page 12 / 35
» Window Specification over Data Streams
Sort
View
ICDE
2012
IEEE
291views Database» more  ICDE 2012»
13 years 8 months ago
Efficiently Monitoring Top-k Pairs over Sliding Windows
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, We...
KAIS
2008
150views more  KAIS 2008»
14 years 9 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
89
Voted
KDD
2003
ACM
192views Data Mining» more  KDD 2003»
15 years 10 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
IDA
2008
Springer
14 years 9 months ago
Mining frequent items in a stream using flexible windows
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
Toon Calders, Nele Dexters, Bart Goethals
ICDE
2005
IEEE
183views Database» more  ICDE 2005»
15 years 11 months ago
Adaptive Caching for Continuous Queries
We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream syst...
Shivnath Babu, Kamesh Munagala, Jennifer Widom, Ra...