This article will be discussing Reverse Binary Tree index feature of Oracle database, an index which is there to solve block contention problem. It will be discussing how it works, what are its advantages and its limitations. When a normal binary tree index based on a numeric column populated by a sequence, it gives rise to hot block problem. Applications trying to insert new rows will face “buffer busy wait”, because everyone wants to write to same block. This problem is called hot block or block contention.

Comment