109 search results - page 14 / 22 » Evaluating top-k queries over incomplete data streams |
PAM
2012
Springer
13 years 5 months ago
2012
Springer
Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
RTSS
2006
IEEE
15 years 3 months ago
2006
IEEE
With the emergence of large wired and wireless sensor networks, many real-time applications need to operate on continuous unbounded data streams. At the same time, many of these s...
178
Voted
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
156
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
In order to support continuous queries over data streams, a plethora of suitable techniques as well as prototypes have been developed and evaluated in recent years. In particular,...
170
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...