Reverse Key indexes spread the distribution of index updatees across the index tree by reversing the data value of the index key . It's only useful for queries that contain equality predicates . Because lexically adjacent keys are not stored next to each other in a reverse key index , For every updation , Oracle need to search the whole index , it takes more time than normal B-tree index
It's only useful for queries that contain equality predicates .
Because lexically adjacent keys are not stored next to each other in a reverse key index , For every updation , Oracle need to search the whole index , it takes more time than normal B-tree index