高技术通讯2017，Vol.27Issue(1)：9-19,11.DOI:10.3772/j.issn.1002-0470.2017.01.002
一种面向事务型数据库的无锁并发B+tree索引结构
A wait-free concurrent B+tree index scheme for transaction databases
摘要
Abstract
In order to overcome multi-version concurrent control (MVCC)''s disadvantage of short obstruction in its concurrent control of data access to achieve the full read-write concurrency, a new index scheme based on copy on write (BC) with multi-version concurrency B+tree, called the BCMVBT, was presented.The BCMVBT uses the copy of the operation space for read-write separation to make the read-write transaction be concurrently conducted.Moreover, it avoids the CPU consumption caused by compare and swap (CAS) operations to achieve the full concurrency under write-once-read-many scenarios.Additionally, the current MVBT range query algorithm was improved and a recovery mechanism with wait-free manner was proposed in order to achieve full concurrency of insert/delete/recycle operations.Compared to TMVBT, BCMVBT reduces time cost by 50%.Further experiments show that BCMVBT is more efficient in large transaction environment.关键词
事务/索引/B+tree(BT)/多版本并发/写时复制(COW)Key words
transaction/index structure/B+tree (BT)/multi-version concurrency/copy on write (COW)引用本文复制引用
李乔,赵鸿昊,江鹏,张兆心..一种面向事务型数据库的无锁并发B+tree索引结构[J].高技术通讯,2017,27(1):9-19,11.基金项目
国家科技支撑计划(2012BAH45B01),国家自然科学基金(61100189,61370215,61370211)和国家信息安全计划(2014A085,2015A072)资助项目. （2012BAH45B01）
