.png){kind=icon}
返回
Identifying frequent items in distributed data sets
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-012-0220-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many practical problems in computer science require the knowledge of the most frequently occurring items in a data set. Current state-of-the-art algorithms for frequent items discovery are either fully centralized or rely on node hierarchies which are inflexible and prone to failures in massively distributed systems. In this paper we describe a family of gossip-based algorithms that efficiently approximate the most frequent items in large-scale distributed datasets. We show, both analytically and using real-world datasets, that our algorithms are fast, highly scalable, and resilient to node failures.
Keyword:
Frequency
Most-frequent
Distributed
Decentralized
Gossip
Aggregation
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
引用论文
分享收藏Ultrastrong Regulation Effect of the Electric Field on the All‐Carboatomic Ring Cyclo[18]Carbon**.png)
ChemPhysChem
ChemPhysChemIF0
PREAI
分享收藏分享收藏
查看更多内容