I have never used RKIs but i am pretty sure i have a fairly good understanding or as much as anyone can have not having used them before. But I still fail to see their advantage and there must be, sorry if i'm a bit slow on this one!

Abhaysk you said...
"it wud be useful were in u have a column with values in ascending/descending order....& the values in index wud be spread accross..due vaules stored in reverese struct..."

As far as i know all indexed columns by nature have values that are either ascending or descending, big deal, if they weren't i use a bit-map index ideal for columns of low cardinality! If the values were spread as you say i would have used a B-tree not reversed, reference my last message. Not sure what you are trying to say here, perhaps you could clarify.


Abhaysk you said...
"query with equality predicates wud be faster...

Faster than range scans, true of any index I would think.


"also if u wanted to update the table based on the column having ascending/descending vales...the updates on index spread rather than occuring at same place if otherwise."

Huh, you got me there?

Cheers
Gus