Communication Efficient Algorithms for Top-k Selection Problems

被引：6
|
作者：
Huebschle-Schneider, Lorenz [1 ]
Sanders, Peter [1 ]
机构：
[1] Karlsruhe Inst Technol, Inst Theoret Informat, Karlsruhe, Germany
来源：
2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016) | 2016年
关键词：
frequent elements; sampling; selection; sum aggregation; priority queue;
D O I：
10.1109/IPDPS.2016.45
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present scalable parallel algorithms with sublinear per-processor communication volume and low latency for several fundamental problems related to finding the most relevant elements in a set, for various notions of relevance: We begin with the classical selection problem with unsorted input. We present generalizations with sorted inputs, dynamic content (bulk-parallel priority queues), and multiple criteria. Then we move on to finding frequent objects and top-k sum aggregation.
引用
收藏
页码：659 / 668
页数：10
相关论文
共 50 条
  • [31] An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm
    Yu, Wei
    Li, Shijun
    Tang, Xiaoyue
    Wang, Kai
    NEURAL COMPUTING & APPLICATIONS, 2019, 31 (Suppl 1): : 77 - 92
  • [32] An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm
    Wei Yu
    Shijun Li
    Xiaoyue Tang
    Kai Wang
    Neural Computing and Applications, 2019, 31 : 77 - 92
  • [33] Encodings for Range Selection and Top-k Queries
    Grossi, Roberto
    Iacono, John
    Navarro, Gonzalo
    Raman, Rajeev
    Rao, Satti Srinivasa
    ALGORITHMS - ESA 2013, 2013, 8125 : 553 - 564
  • [34] Oneshot Differentially Private Top-k Selection
    Qiao, Gang
    Su, Weijie J.
    Zhang, Li
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [35] Efficient Algorithms for the Identification of Top-k Structural Hole Spanners in Large Social Networks
    Xu, Wenzheng
    Rezvani, Mojtaba
    Liang, Weifa
    Yu, Jeffrey Xu
    Liu, Chengfei
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2017, 29 (05) : 1017 - 1030
  • [36] Efficient algorithms for finding diversified top-k structural hole spanners in social networks
    Li, Mengshi
    Peng, Jian
    Ju, Shenggen
    Liu, Quanhui
    Li, Hongyou
    Liang, Weifa
    Yu, Jeffrey Xu
    Xu, Wenzheng
    INFORMATION SCIENCES, 2022, 602 : 236 - 258
  • [37] Supporting efficient distributed top-k monitoring
    Deng, Bo
    Jia, Yan
    Yang, Shuqiang
    ADVANCES IN WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS, 2006, 4016 : 496 - 507
  • [38] Efficient processing of distributed top-k queries
    Yu, HL
    Li, HG
    Wu, P
    Agrawal, D
    El Abbadi, A
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2005, 3588 : 65 - 74
  • [39] Efficient Top-k Retrieval on Massive Data
    Han, Xixian
    Li, Jianzhong
    Gao, Hong
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (10) : 2687 - 2699
  • [40] Efficient Processing of Top-k Joins in MapReduce
    Saouk, Mei
    Doulkeridis, Christos
    Vlachou, Akrivi
    Norvag, Kjetil
    2016 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2016, : 570 - 577
12345