An amortized analysis of insertions into AVL trees
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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
Concurrency Control in B-Trees with Batch Updates
IEEE Transactions on Knowledge and Data Engineering
Efficient Bulk Deletes in Relational Databases
Proceedings of the 17th International Conference on Data Engineering
A Novel Index Supporting High Volume Data Warehouse Insertion
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Concurrency Control for B-Trees with Differential Indices
IDEAS '00 Proceedings of the 2000 International Symposium on Database Engineering & Applications
Group Updates for Red-Black Trees
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Real-Time Data Access Control on B-Tree Index Structures
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Bulk-Insertion Sort: Towards Composite Measures of Presortedness
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
| Hi-index | 0.00 |
A bulk insertion for a given set of keys inserts all keys in the set into a leaf-oriented AVL-tree. Similarly, a bulk deletion deletes them all. The bulk insertion is simple if all keys fall in the same leaf position in the AVL-tree. We prove that simple bulk insertions and deletions of m keys have amortized complexity O(log m) for the tree adjustment phase. Our reasoning implies easy proofs for the amortized constant rebalancing cost of single insertions and deletions in AVL-trees. We prove that in general, the bulk operation composed of several simple ones of sizes m1, ..., mk has amortized complexity O(驴i=1k log mi).