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 条
  • [41] ON USING CONDITIONAL ROTATION OPERATIONS TO ADAPTIVELY STRUCTURE BINARY SEARCH-TREES
    CHEETHAM, RP
    OOMMEN, BJ
    NG, DTH
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 326 : 161 - 175
  • [42] A practical solution to supporting oblivious basic operations on dynamic outsourced search trees
    Dang, TK
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2006, 21 (01): : 53 - 64
  • [43] A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes
    Chang, Yu-Huei
    Yang, Jinn-Shyong
    Chang, Jou-Ming
    Wang, Yue-Li
    APPLIED MATHEMATICS AND COMPUTATION, 2015, 268 : 489 - 495
  • [44] FAST PARALLEL ALGORITHMS FOR THE UNIT COST EDITING DISTANCE BETWEEN TREES
    SHASHA, D
    ZHANG, KZ
    SPAA 89: PROCEEDINGS OF THE 1989 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, 1989, : 117 - 126
  • [45] Fast parallel algorithms for the unit cost editing distance between trees
    1600, Publ by ACM, Fort Collins, CO, USA
  • [46] Fast Search Using k-d Trees with Fine Search for Spectral Data Identification
    Son, Youngjae
    Chen, Tiejun
    Baek, Sung-June
    MATHEMATICS, 2025, 13 (04)
  • [47] Delegation Sketch: a Parallel Design with Support for Fast and Accurate Concurrent Operations
    Stylianopoulos, Charalampos
    Walulya, Ivan
    Almgren, Magnus
    Landsiedel, Olaf
    Papatriantafilou, Marina
    PROCEEDINGS OF THE FIFTEENTH EUROPEAN CONFERENCE ON COMPUTER SYSTEMS (EUROSYS'20), 2020,
  • [48] Action recognition with appearance-motion features and fast search trees
    Mikolajczyk, K.
    Uemura, H.
    COMPUTER VISION AND IMAGE UNDERSTANDING, 2011, 115 (03) : 426 - 438
  • [49] HEVC fast fractional-pixel prediction with parallel search
    Cheng, Lei
    Yan, Wei
    Xiang, Guoqing
    Liu, Xiao
    Yan, Yunyao
    ELEVENTH INTERNATIONAL CONFERENCE ON DIGITAL IMAGE PROCESSING (ICDIP 2019), 2019, 11179
  • [50] Parallel Binary Search Trees for Rapid IP Lookup using Graphic Processors
    Shekhar, Amar
    Goyal, Jatin
    2013 2ND INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT IN THE KNOWLEDGE ECONOMY (IMKE), 2013, : 176 - 179
12345