Self-adjusting binary search trees
Journal of the ACM (JACM)
Planar point location using persistent search trees
Communications of the ACM
Concurrency control in database structures with relaxed balance
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Priority search trees in secondary memory (extended abstract)
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost
SIAM Journal on Computing
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Relaxed multi-way trees with group updates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction to Algorithms
Concurrency Control in B-Trees with Batch Updates
IEEE Transactions on Knowledge and Data Engineering
A Novel Index Supporting High Volume Data Warehouse Insertion
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Real-Time Data Access Control on B-Tree Index Structures
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Relaxed Balancing Made Simple
| Hi-index | 0.00 |
Stratified trees form a family of classes of search trees of special interest because of their generality: they include symmetric binary B-trees, half-balanced trees, and red-black trees, among others. Moreover, stratified trees can be used as a basis for relaxed rebalancing in a very elegant way. The purpose of this paper is to study the rebalancing cost of stratified trees after update operations. The operations considered are the usual insert and delete operations and also bulk insertion, in which a number of keys are inserted into the same place in the tree. Our results indicate that when insertions, deletions, and bulk insertions are applied in an arbitrary order, the amortized rebalancing cost for single insertions and deletions is constant, and for bulk insertions O(logm), where m is the size of the bulk. The latter is also a bound on the structural changes due to a bulk insertion in the worst case.