A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Concurrency Control Protocol for Parallel B-Tree Structures That Improves the Efficiency of Request Transfers and SMOs within a Node
2018
IEICE transactions on information and systems
Many concurrency control protocols for B-trees use latchcoupling because its execution is efficient on a single machine. Some studies have indicated that latch-coupling may involve a performance bottleneck when using multicore processors in a shared-everything environment, but no studies have considered the possible performance bottleneck caused by sending messages between processing elements (PEs) in sharednothing environments. We propose two new concurrency control protocols, "LCFB" and
doi:10.1587/transinf.2016edp7437
fatcat:2cfsm2bnybdk7njjl6xdd7a3bi