A. Cursor stability
D. Predicate locking
The question was posed to me in homework.
I’m obligated to ask this question of Insert, Delete Operations and Predicate Reads in division Concurrency Control of RDBMS
For explanation I would say: Cursor stability is a form of two degree consistency designed for programs that iterate over tuples of a relation by using cursors. It ensures that the tuple that is currently being processed is locked in shared mode and any modified tuples are locked in exclusive mode until the transaction commits.