316 search results - page 20 / 64 » Top-K aggregation queries over large networks |
157
click to vote
DC
2008
14 years 10 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...
168
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Online monitoring of data streams poses a challenge in many data-centric applications, such as telecommunications networks, traffic management, trend-related analysis, webclick st...
167
click to vote
ICDE
2005
IEEE
15 years 11 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...
168
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
In advertising and content relevancy prediction it is important to understand whether, over time, information that reaches one demographic group spreads to others. In this paper w...