Planar point location using persistent search trees
Communications of the ACM
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Regular Article: Efficient rebalancing of chromatic search trees
Proceedings of the 30th IEEE symposium on Foundations of computer science
Amortization results for chromatic search trees, with an application to priority queues
Journal of Computer and System Sciences
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth 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
A new method for updating and rebalancing tree-type main memory dictionaries
Nordic Journal of Computing
Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract)
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Relaxed Balanced Red-Black Trees
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Concurrent rebalancing on HyperRed-Black trees
SCCC '97 Proceedings of the 17th International Conference of the Chilean Computer Science Society
The Performance of Concurrent Red-Black Tree Algorithms
The Performance of Concurrent Red-Black Tree Algorithms
Concurrent Search and Insertion in AVL Trees
IEEE Transactions on Computers
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
New Data Structures for IP Lookup and Conflict Detection
Algorithmics of Large and Complex Networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Towards consistency oblivious programming
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. Many different relaxed balancing algorithms have been proposed, especially for red-black trees and AVL-trees, but their performance in concurrent environments is not yet well understood. This paper presents an experimental comparison of the strictly balanced red-black tree and three relaxed balancing algorithms for red-black trees using the simulation of a multiprocessor machine.