.png){kind=icon}
Return
Distributed selection: A missing piece of data aggregation
.png){kind=icon}
PRE
AI
DOI：10.1145/1378727.1378749.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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(th) 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(th) 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.
Keywords:
COMPLEXITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12.2
Papers:
1.2W
Citations:
3.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more