119 search results - page 8 / 24 » D-CAPE: distributed and self-tuned continuous query processi... |
136
click to vote
SSD
2007
Springer
15 years 3 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that...
100
click to vote
DEBS
2009
ACM
15 years 4 months ago
2009
ACM
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
152
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...
ISORC
2006
IEEE
15 years 3 months ago
2006
IEEE
Many real-time applications, such as traffic control systems, surveillance systems and health monitoring systems, need to operate on continuous unbounded streams of data. These ap...