In this paper, we present TxCF-Tree, a balanced tree whose design is optimized to support transactional accesses. The core optimizations of TxCF-Tree’s operations are: providing a traversal phase that does not use any lock and/or speculation, and deferring the lock acquisition or physical modification to the transaction’s commit phase; isolating the structural operations (such as re-balancing) in an interference-less housekeeping thread; and minimizing the interference between structural operations and the critical path of semantic operations (i.e., additions and removals on the tree). We evaluated TxCF-Tree against the stateof- the-art general methodologies for designing transactional trees and we show that TxCF-Tree’s design pays off in most of workloads.
CITATION STYLE
Hassan, A., Palmieri, R., & Ravindran, B. (2015). Transactional interference-less balanced tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9363, pp. 325–340). Springer Verlag. https://doi.org/10.1007/978-3-662-48653-5_22
Mendeley helps you to discover research relevant for your work.