Add to ORKGConsider n nodes connected to a single coordinator. Each node receives an individual online data stream of numbers and, at any point in time, the coordinator has to know the k nodes currently observing the largest values, for a given k between 1 and n. We design and analyze an algorithm that solves this problem while bounding the amount of messages exchanged between the nodes and the coordinator. Our algorithm employs the idea of using filters which, intuitively speaking, leads to few messages to be sent, if the new input is “similar ” to the previous ones. The algorithm uses a number of messages that is on expectation by a factor of O ((log ∆ + k) · logn) larger than that of an offline algorithm that sets filters in an optimal way, where ...
The past decade has witnessed many interesting algorithms for maintaining statistics over a data str...
In this paper we extend the study of algorithms for monitoring distributed data streams from whole d...
Wir betrachten ein Sensornetzwerk aus zahlreichen Knoten, die die Umgebung beobachten und in der Lag...
We investigate several basic problems in the distributed streaming model. In the this model, we have...
Abstract Most of the traditional top-k algorithms are based on a single-server setting. They may be ...
The querying and analysis of data streams has been a topic of much recent interest, motivated by app...
LNCS v. 6534 has title: Approximation and online algorithms : 8th international workshop, WAOA 2010,...
Consider the following problem: We have k players each receiving a stream of items, and communicatin...
Consider the following problem: We have k players each receiving a stream of items, and communicatin...
Monitoring data streams in a distributed system is the fo-cus of much research in recent years. Most...
Monitoring data streams in a distributed system has attracted considerable interest in recent years....
This paper presents a new algorithm to answer top-k queries (e.g. “find the k objects with the highe...
Many distributed signal processing problems involve aggregating vectors of data, and often we are in...
In online tracking, an observer S receives a sequence of values, one per time instance, from a data ...
Monitoring is an issue of primary concern in current and next gen-eration networked systems. For exa...
The past decade has witnessed many interesting algorithms for maintaining statistics over a data str...
In this paper we extend the study of algorithms for monitoring distributed data streams from whole d...
Wir betrachten ein Sensornetzwerk aus zahlreichen Knoten, die die Umgebung beobachten und in der Lag...
We investigate several basic problems in the distributed streaming model. In the this model, we have...
Abstract Most of the traditional top-k algorithms are based on a single-server setting. They may be ...
The querying and analysis of data streams has been a topic of much recent interest, motivated by app...
LNCS v. 6534 has title: Approximation and online algorithms : 8th international workshop, WAOA 2010,...
Consider the following problem: We have k players each receiving a stream of items, and communicatin...
Consider the following problem: We have k players each receiving a stream of items, and communicatin...
Monitoring data streams in a distributed system is the fo-cus of much research in recent years. Most...
Monitoring data streams in a distributed system has attracted considerable interest in recent years....
This paper presents a new algorithm to answer top-k queries (e.g. “find the k objects with the highe...
Many distributed signal processing problems involve aggregating vectors of data, and often we are in...
In online tracking, an observer S receives a sequence of values, one per time instance, from a data ...
Monitoring is an issue of primary concern in current and next gen-eration networked systems. For exa...
The past decade has witnessed many interesting algorithms for maintaining statistics over a data str...
In this paper we extend the study of algorithms for monitoring distributed data streams from whole d...
Wir betrachten ein Sensornetzwerk aus zahlreichen Knoten, die die Umgebung beobachten und in der Lag...