Sciweavers

1552 search results - page 14 / 311
» Efficient Aggregate Computation over Data Streams
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 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
ICDE
2008
IEEE
165views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Data Interpretation and Compression over RFID Streams
Abstract-- Despite its promise, RFID technology presents numerous challenges, including incomplete data, lack of location and containment information, and very high volumes. In thi...
Richard Cocci, Thanh Tran 0002, Yanlei Diao, Prash...
IEAAIE
2009
Springer
14 years 2 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
CIKM
2006
Springer
13 years 9 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
DAWAK
2008
Springer
13 years 9 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash