.png){kind=icon}
返回
Distributed selection: A missing piece of data aggregation
.png){kind=icon}
PRE
AI
DOI：10.1145/1378727.1378749.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
COMPLEXITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.2
论文数:
1.2W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
查看更多内容