Fast Parallel Operations on Search Trees

被引：0
|
作者：
Akhremtsev, Yaroslav [1 ]
Sanders, Peter [1 ]
机构：
[1] KIT, Inst Theoret Informat, Karlsruhe, Germany
来源：
PROCEEDINGS OF 2016 IEEE 23RD INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC) | 2016年
关键词：
D O I：
10.1109/HiPC.2016.44
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Using (a, b)-trees as an example, we show how to perform a parallel split with logarithmic latency and parallel join, bulk updates, intersection, union (or merge), and (symmetric) set difference with logarithmic latency and with information theoretically optimal work. We present both asymptotically optimal solutions and simplified versions that perform well in practice - they are several times faster than previous implementations.
引用
收藏
页码：291 / 300
页数：10
相关论文
共 50 条
  • [21] A FAST SEARCH ALGORITHM ON MODIFIED S-TREES
    CHUNG, KL
    WU, CJ
    PATTERN RECOGNITION LETTERS, 1995, 16 (11) : 1159 - 1164
  • [22] On a sublinear time parallel construction of optimal binary search trees
    Karpinski, Marek
    Rytter, Wojciech
    Parallel Processing Letters, 1998, 8 (03): : 387 - 397
  • [23] An Analysis of Budgeted Parallel Search on Conditional Galton–Watson Trees
    David Avis
    Luc Devroye
    Algorithmica, 2020, 82 : 1329 - 1345
  • [24] PARALLEL ALGORITHMS FOR BALANCING THREADED BINARY SEARCH-TREES
    HAQ, E
    ZHENG, SQ
    EIGHTH ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS: 1989 CONFERENCE PROCEEDINGS, 1989, : 286 - 290
  • [25] Exploiting CPU bit parallel operations to improve efficiency in search
    San Segundo, Pablo
    Rodriguez-Losada, Diego
    Galan, Ramon
    Matia, Fernando
    Jimenez, Agustin
    19TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, VOL I, PROCEEDINGS, 2007, : 53 - 59
  • [26] Parallel Search of k-Nearest Neighbors with Synchronous Operations
    Sismanis, Nikos
    Pitsianis, Nikos
    Sun, Xiaobai
    2012 IEEE CONFERENCE ON HIGH PERFORMANCE EXTREME COMPUTING (HPEC), 2012,
  • [27] A FAST PARALLEL MERGING ALGORITHM FOR 2-3 TREES
    SHIBAYAMA, E
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 220 : 1 - 16
  • [28] Fast parallel reordering and isomorphism testing of k-trees
    Del Greco, JG
    Sekharan, CN
    Sridhar, R
    ALGORITHMICA, 2002, 32 (01) : 61 - 72
  • [29] PARALLEL CLUSTERING BY FAST SEARCH AND FIND OF DENSITY PEAKS
    Ji Chengheng
    Lei Yongmei
    PROCEEDINGS OF 2016 INTERNATIONAL CONFERENCE ON AUDIO, LANGUAGE AND IMAGE PROCESSING (ICALIP), 2016, : 563 - 567
  • [30] Fast BMU Search in SOMs Using Random Hyperplane Trees
    Astudillo, Cesar A.
    Oommen, B. John
    PRICAI 2014: TRENDS IN ARTIFICIAL INTELLIGENCE, 2014, 8862 : 39 - 51
12345