Red-black trees with constant update time

被引：3

作者：

Elmasry, Amr ^{[1
]}

Kahla, Mostafa ^{[2
]}

Ahdy, Fady ^{[2
]}

Hashem, Mahmoud ^{[2
]}

机构：

[1] Alexandria Univ, Dept Comp Engn & Syst, Alexandria, Egypt

[2] Alexandria Univ, Comp & Commun Engn Program, Alexandria, Egypt

来源：

ACTA INFORMATICA | 2019年 / 56卷 / 05期

关键词：

D O I：

10.1007/s00236-019-00335-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We show how a few modifications to the red-black trees allow for constant worst-case update time (once the position of the element to be inserted or deleted is known). The resulting structure is based on relaxing some of the properties of the red-black trees while guaranteeing that the height remains logarithmic with respect to the number of nodes. Compared to the other search trees with constant worst-case update time, our tree is the first to provide a tailored deletion procedure without using the global rebuilding technique. In addition, our procedures are simpler and allow for an easier proof of correctness than those alternative trees.

引用

页码：391 / 404

页数：14

共 50 条

[1] Red–black trees with constant update time
Amr Elmasry
Mostafa Kahla
Fady Ahdy
Mahmoud Hashem
[J]. Acta Informatica, 2019, 56 : 391 - 404
[2] RED-BLACK TREES
SCHNEIER, B
[J]. DR DOBBS JOURNAL, 1992, 17 (04): : 42 - &
[3] Relativistic red-black trees
Howard, Philip W.
Walpole, Jonathan
[J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2014, 26 (16): : 2684 - 2712
[4] Red-black trees with types
Kahrs, S
[J]. JOURNAL OF FUNCTIONAL PROGRAMMING, 2001, 11 : 425 - 432
[5] Relaxed balanced red-black trees
Hanke, S
Ottmann, T
Soisalon-Soininen, E
[J]. ALGORITHMS AND COMPLEXITY, 1997, 1203 : 193 - 204
[6] Group updates for red-black trees
Hanke, S
Soisalon-Soininen, E
[J]. ALGORITHMS AND COMPLEXITY, 2000, 1767 : 253 - 262
[7] Parallel algorithms for red-black trees
Park, H
Park, K
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 415 - 435
[8] STL's red-black trees
Shankel, J
[J]. DR DOBBS JOURNAL, 1998, 23 (04): : 54 - +
[9] Relaxed red-black trees with group updates
Larsen, KS
[J]. ACTA INFORMATICA, 2002, 38 (08) : 565 - 586
[10] HOW COSTLY CAN RED-BLACK TREES BE
CAMERON, H
WOOD, D
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 497 : 117 - 126

← 1 2 3 4 5 →