Sciweavers

485 search results - page 2 / 97
» Processing complex aggregate queries over data streams
Sort
View
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
14 years 5 months ago
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...
SIGMOD
2006
ACM
150views Database» more  SIGMOD 2006»
14 years 5 months ago
On-the-fly sharing for streamed aggregation
Data streaming systems are becoming essential for monitoring applications such as financial analysis and network intrusion detection. These systems often have to process many simi...
Sailesh Krishnamurthy, Chung Wu, Michael J. Frankl...
DEBS
2011
ACM
12 years 9 months ago
DejaVu: a complex event processing system for pattern matching over live and historical data streams
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
Nihal Dindar, Peter M. Fischer, Nesime Tatbul
ICEBE
2005
IEEE
168views Business» more  ICEBE 2005»
13 years 11 months ago
Frequency Operators for Condensative Queries over Data Streams
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
Lisha Ma, Werner Nutt
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 6 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura