Sciweavers

494 search results - page 21 / 99
» Approximate continuous querying over distributed streams
Sort
View
EDBTW
2006
Springer
13 years 11 months ago
Dynamic Plan Migration for Snapshot-Equivalent Continuous Queries in Data Stream Systems
A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially install...
Jürgen Krämer, Yin Yang, Michael Cammert...
PET
2012
Springer
11 years 10 months ago
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams
We consider applications scenarios where an untrusted aggregator wishes to continually monitor the heavy-hitters across a set of distributed streams. Since each stream can contain ...
T.-H. Hubert Chan, Mingfei Li, Elaine Shi, Wenchan...
BIRTE
2006
133views Business» more  BIRTE 2006»
13 years 11 months ago
Leveraging Distributed Publish/Subscribe Systems for Scalable Stream Query Processing
Existing distributed publish/subscribe systems (DPSS) offer loosely coupled and easy to deploy content-based stream delivery services to a large number of users. However, the lack ...
Yongluan Zhou, Kian-Lee Tan, Feng Yu
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
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