Abstract
The B-tree and its variants are an indispensable tool for database systems and applications. Hence the efficiency of the B-tree is one of the few critical factors that determine the performance of a database system. In main-memory database systems, the computational overhead intrinsic in the B-tree algorithms for branching becomes the dominant factor in performance. In this paper, we propose yet another but disruptive variant of the B+-tree called the DB+-tree that redesigns the node structure for faster branching operations. The novel branching algorithm of the DB+-tree can be implemented in an O(1) number of SIMD and other sequential instructions, which supports fast branching, and this leads to efficient point search, range search, and update operations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
