Distributed Selection: A Missing Piece of Data Aggregation
METADATA ONLY
Loading...
Author / Creator
Date
2008-09
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each node holds a numeric element, the goal of a k-selection algorithm is to determine the kᵗʰ smallest of these elements. We prove that distributed selection indeed requires more work than other aggregation functions such as, e.g., the computation of the average or the maximum of all elements. On the other hand, we show that the kᵗʰ smallest element can be computed efficiently by providing both a randomized and a deterministic k-selection algorithm, dispelling the misconception that solving distributed selection through in-network aggregation is infeasible. © 2008 ACM.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
51 (9)
Pages / Article No.
93 - 99
Publisher
Association for Computing Machinery
Event
Edition / version
Methods
Geographic location
Date collected
Date created
Subject
Organisational unit
03604 - Wattenhofer, Roger / Wattenhofer, Roger