88
Voted
TKDE
2002
14 years 9 months ago
2002
103
click to vote
SWAT
1992
Springer
15 years 1 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
73
Voted
IPPS
1994
IEEE
15 years 1 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...