494 search results - page 41 / 99 » Approximate continuous querying over distributed streams |
ICMCS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper, we propose an efficient algorithm, called MQSchange (changes of Music Query Streams), to detect the changes of maximal melody structures in user-centered music quer...
DEBS
2009
ACM
14 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...
SIGMOD
2004
ACM
14 years 9 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...
SIGMOD
2004
ACM
14 years 9 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
SIGMOD
2005
ACM
14 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...