Fast Parallel Operations on Search Trees

被引:0
|
作者
Akhremtsev, Yaroslav [1 ]
Sanders, Peter [1 ]
机构
[1] KIT, Inst Theoret Informat, Karlsruhe, Germany
关键词
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 条
  • [31] Fast BMU search in SOMs using random hyperplane trees
    Astudillo, César A., 1600, Springer Verlag (8862):
  • [32] Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search
    Naidan, Bilegsaikhan
    Hetland, Magnus Lie
    INTERNATIONAL JOURNAL OF MULTIMEDIA DATA ENGINEERING & MANAGEMENT, 2012, 3 (04): : 75 - 87
  • [33] Improved Sequential Fuzzy Indexed Search Trees for Fast Classification
    Tusor, Balazs
    Varkonyi-Koczy, Annamaria R.
    Gubo, Stefan
    2024 IEEE INTERNATIONAL SYMPOSIUM ON MEDICAL MEASUREMENTS AND APPLICATIONS, MEMEA 2024, 2024,
  • [34] A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees
    Ruzankin P.S.
    SN Computer Science, 3 (5)
  • [35] Fast Concurrent Lock-Free Binary Search Trees
    Natarajan, Aravind
    Mittal, Neeraj
    ACM SIGPLAN NOTICES, 2014, 49 (08) : 317 - 328
  • [36] CONFORMATIONAL SEARCH USING A PARALLEL FAST MESSY GA WITH MIGRATION AND PARALLEL SELECTION
    MERKLE, LD
    GATES, GH
    LAMONT, GB
    PACHTER, R
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1995, 209 : 98 - COMP
  • [37] An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees
    Avis, David
    Devroye, Luc
    ALGORITHMICA, 2020, 82 (05) : 1329 - 1345
  • [38] Parallel Search Trees with Minimal ABC Index with MPI plus OpenMP
    Lin, Wenshui
    Ma, Chi
    Chen, Qi'an
    Chen, Junjie
    Gao, Tianyi
    Cai, Bingyue
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2015, 73 (02) : 337 - 343
  • [39] PARALLEL BREADTH-1ST SEARCH ALGORITHMS FOR TREES AND GRAPHS
    GHOSH, RK
    BHATTACHARJEE, GP
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1984, 15 (3-4) : 255 - 268
  • [40] EFFICIENT IMPLEMENTATIONS OF SEARCH-TREES ON PARALLEL DISTRIBUTED MEMORY ARCHITECTURES
    COLBROOK, A
    SMYTHE, C
    IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1990, 137 (05): : 394 - 400