Optimistic Locking?
I was looking through the how-to on how to build mult-row insert and update forms.
http://www.oracle.com/technology/products/database/htmldb/howtos/tabular_form.html
I noticed that the "optimistic" locking model recommended involved using a checksum method... It seems to go something like this:
1. Load a rows for processing....
2. Update the row.
3. Submit
4. Reload the row, and compare the row loaded in step 1 to the same row.
5. If the rows are not a match, generate an error.
6. If the rows match, all is well and do the update.
The question then, is this.....
Is this the way that the automated row processing does it's optimistic locking? This seems a bit cumbersome doesn't it? (also in the example, the second select is pretty sweeping, reading all rows...not exactly a performance barn burner if you know what I mean!)
It would seem to me that there is a certain amount of time between step 4 and step 6 that the row could be changed (since we are not doing a select for update in step 4 that I can see (which is a good thing) ). Is this the case or am I missing something (which is very possible!)?
Robert