Hi, I notice the current forward only, updatable implementation does not do prefetch from the network client driver, hence removing a need to move backwards when perfoming an update in the middle of a prefetch set.
It seems a main problem with implementing scrollable sensitive result sets is being able to scan backwards (both heap and btree). Can somebody cast some light on what, if any, underlying assumptions would make this hard? Mike, can you comment on this perhaps? Thanks, Dag
