Sciweavers

175 search results - page 9 / 35
» Window Specification over Data Streams
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 11 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
SSDBM
2005
IEEE
140views Database» more  SSDBM 2005»
14 years 4 months ago
Optimizing In-Order Execution of Continuous Queries over Streamed Sensor Data
The widespread use of sensor networks in scientific and engineering applications leads to increased demand on the efficient computation of the collected sensor data. Recent rese...
Moustafa A. Hammad, Walid G. Aref, Ahmed K. Elmaga...
ISCI
2006
145views more  ISCI 2006»
13 years 10 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
14 years 2 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
CIKM
2009
Springer
14 years 5 months 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