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 条

[21] Efficient Top-K Feature Selection Using Coordinate Descent Method
Xu, Lei
Wang, Rong
Nie, Feiping
Li, Xuelong
THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 9, 2023, : 10594 - 10601
[22] Efficient approximate top-k mutual information based feature selection
Salam, Md Abdus
Roy, Senjuti Basu
Das, Gautam
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2023, 61 (01) : 191 - 223
[23] Space-Efficient Framework for Top-k String Retrieval Problems
Hon, Wing-Kai
Shah, Rahul
Vitter, Jeffrey Scott
2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 713 - 722
[24] Efficient Top-K Retrieval with Signatures
Chappell, Timothy
Geva, Shlomo
Anthony Nguyen
Zuccon, Guido
PROCEEDINGS OF THE 18TH AUSTRALASIAN DOCUMENT COMPUTING SYMPOSIUM (ADCS 2013), 2013, : 10 - 17
[25] Efficient Top-k Search for PageRank
Fujiwara, Yasuhiro
Nakatsuji, Makoto
Shiokawa, Hiroaki
Mishima, Takeshi
Onizuka, Makoto
Transactions of the Japanese Society for Artificial Intelligence, 2015, 30 (02) : 473 - 478
[26] Efficient mining of top-k high utility itemsets through genetic algorithms
Luna, Jose Maria
Kiran, Rage Uday
Fournier-Viger, Philippe
Ventura, Sebastian
INFORMATION SCIENCES, 2023, 624 : 529 - 553
[27] Implementing a Hybrid of Efficient Algorithms For Mining Top-K High Utility Itemsets
Rajendra, Ingle Mayur
Vyas, Chaitanya
Moghe, Sanika Sameer
Deshmukh, Deepali
Sakhare, Sachin
Gonge, Sudhanshu
2018 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING COMMUNICATION CONTROL AND AUTOMATION (ICCUBEA), 2018,
[28] Crowdsourced Top-k Algorithms: An Experimental Evaluation
Zhang, Xiaohang
Li, Guoliang
Feng, Jianhua
PROCEEDINGS OF THE VLDB ENDOWMENT, 2016, 9 (08): : 612 - 623
[29] Efficient All Top-k Computation-A Unified Solution for All Top-k, Reverse Top-k and Top-m Influential Queries
Ge, Shen
U, Leong Hou
Mamoulis, Nikos
Cheung, David W.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2013, 25 (05) : 1015 - 1027
[30] Optimal Join Algorithms Meet Top-k
Tziavelis, Nikolaos
Gatterbauer, Wolfgang
Riedewald, Mirek
SIGMOD'20: PROCEEDINGS OF THE 2020 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2020, : 2659 - 2665

← 1 2 3 4 5 →