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 条
  • [1] Efficient top-k string similarity query algorithms
    Chen, Zi-Yang
    Han, Yu-Jun
    Wang, Xuan
    Zhou, Jun-Feng
    Tongxin Xuebao/Journal on Communications, 2014, 35 (12): : 10 - 20
  • [2] Parameterized top-K algorithms
    Chen, Jianer
    Kanj, Iyad A.
    Meng, Jie
    Xia, Ge
    Zhang, Fenghui
    THEORETICAL COMPUTER SCIENCE, 2013, 470 : 105 - 119
  • [3] Top-k Algorithms and Applications
    Das, Gautam
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 2009, 5463 : 789 - 792
  • [4] Best position algorithms for efficient top-k query processing
    Akbarinia, Reza
    Pacitti, Esther
    Valduriez, Patrick
    INFORMATION SYSTEMS, 2011, 36 (06) : 973 - 989
  • [5] Efficient algorithms of mining top-k frequent closed itemsets
    Lan Yongjie
    Qiu Yong
    ICEMI 2007: PROCEEDINGS OF 2007 8TH INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, VOL II, 2007, : 551 - 554
  • [6] Efficient Top-K Query Algorithms Using Density Index
    Chen, Dongqu
    Sun, Guang-Zhong
    Gong, Neil Zhenqiang
    Zhong, Xiaoqiang
    APPLIED INFORMATICS AND COMMUNICATION, PT I, 2011, 224 : 38 - +
  • [7] Efficient Algorithms for Mining Top-K High Utility Itemsets
    Tseng, Vincent S.
    Wu, Cheng-Wei
    Fournier-Viger, Philippe
    Yu, Philip S.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (01) : 54 - 67
  • [8] Efficient processing of top-k queries: selective NRA algorithms
    Yuan, Jing
    Sun, Guangzhong
    Luo, Tao
    Lian, Defu
    Chen, Guoliang
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2012, 39 (03) : 687 - 710
  • [9] Efficient Top-K Query Algorithms Using Density Index
    Chen, Dongqu
    Sun, Guang-Zhong
    Gong, Neil Zhenqiang
    Zhong, Xiaoqiang
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL I, 2010, : 33 - +
  • [10] Efficient and Robust Top-k Algorithms for Big Data IoT
    Yang, Ruifan
    Zhou, Zheng
    Tseng, Lewis
    Alogaily, Moayad
    Boukerche, Azzedine
    ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2020,
12345