Restructuring the concurrent B+-tree with non-blocked search operations

A B-Tree index extension to enhance response time and the life cycle of flash memory

“…This scheme guarantees that storage utilization is at least 66%. Among the other studies of concurrency and recovery issues, in-depth studies have been performed [17,[23][24][25]. Keller and Wiederhold [17] suggested a B-Tree variant that can ensure more concurrency with variable length data, and later, Lomet and Salzberg [24] extended their research to more generalized one.…”

“…Manolopoulos [25] proposed a B-Tree variant to simultaneously enhance its capability of concurrency and recovery. Lim and Kim [23] proposed a recent B-Tree variant for enhancing concurrency. In their research, they proposed a way to prevent any locks on the search path by backing up the previous consistent sate of the B-Tree.…”