96 search results - page 11 / 20 » Load Shedding for Aggregation Queries over Data Streams |
171
click to vote
DC
2008
14 years 11 months ago
2008
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
165
click to vote
BTW
2011
Springer
14 years 3 months ago
2011
Springer
Abstract: The rise of the Web 2.0 has made content publishing easier than ever. Yesterday’s passive consumers are now active users who generate and contribute new data to the web...
102
click to vote
EDBTW
2006
Springer
15 years 3 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...
183
click to vote
ICDE
2005
IEEE
16 years 1 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...