Add to ORKGAbstract. B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(logb n), where b is the maximum node degree. Updates can be performed in O(log b 2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.
B-Tree is a tree data structure of the most common used in databases and filesystems, that keeps dat...
. The well-known B-tree data structure provides a mechanism for dynamically maintaining balanced bin...
A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² ...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
In this paper we show how a slight modification of $(a,b)$-trees allows us to perform member and nei...
B-trees with relaxed balance have been defined to facilitate fast updating on shared-memory asynchro...
[[abstract]]In this paper two cost-optimal parallel algorithms are presented for constructing a B-tr...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
An implicit data structure for the dictionary problem maintains n data values in the first n locatio...
We show how binary trees of bounded balance can be maintained so that the time to perform each indiv...
Red-black trees are the binary search trees that guarantee logarithmic complexity also in the worst ...
We present an optimal parallel algorithm for the construction of(a, b)-trees-a generalization of 2-3...
We present an optimal parallel algorithm for the construction of (a, b)-trees-a generalization of 2-...
When search trees are made relaxed, balance constraints are weakened such that updates can be made ...
In this thesis we compared some variants of binary search trees that approach dynamic optimality: Ta...
B-Tree is a tree data structure of the most common used in databases and filesystems, that keeps dat...
. The well-known B-tree data structure provides a mechanism for dynamically maintaining balanced bin...
A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² ...
AbstractThe paper studies balanced trees with variable length records. It generalizes the concept of...
In this paper we show how a slight modification of $(a,b)$-trees allows us to perform member and nei...
B-trees with relaxed balance have been defined to facilitate fast updating on shared-memory asynchro...
[[abstract]]In this paper two cost-optimal parallel algorithms are presented for constructing a B-tr...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
An implicit data structure for the dictionary problem maintains n data values in the first n locatio...
We show how binary trees of bounded balance can be maintained so that the time to perform each indiv...
Red-black trees are the binary search trees that guarantee logarithmic complexity also in the worst ...
We present an optimal parallel algorithm for the construction of(a, b)-trees-a generalization of 2-3...
We present an optimal parallel algorithm for the construction of (a, b)-trees-a generalization of 2-...
When search trees are made relaxed, balance constraints are weakened such that updates can be made ...
In this thesis we compared some variants of binary search trees that approach dynamic optimality: Ta...
B-Tree is a tree data structure of the most common used in databases and filesystems, that keeps dat...
. The well-known B-tree data structure provides a mechanism for dynamically maintaining balanced bin...
A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² ...