67 search results - page 4 / 14 » Approximately Processing Multi-granularity Aggregate Queries... |
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
VLDB
1999
ACM
13 years 11 months ago
1999
ACM
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
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...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
EDBTW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Recent research efforts in the fields of data stream processing and data stream management systems (DSMSs) show the increasing importance of processing data streams, e. g...